Filters








1,624 Hits in 1.7 sec

Scheduling Malleable Tasks [chapter]

Hu Zhang, Klaus Jansen
2007 Handbook of Approximation Algorithms and Metaheuristics  
Then we compute a (1 + δ)-approximate preemptive schedule, and finally we convert the preemptive schedule into a non-preemptive schedule.  ...  Table 2 : The algorithm to convert a preemptive schedule to a nonpreemptive schedule in [14] . The algorithm to convert the preemptive schedule to non-preemptive schedule is shown in Table 2 .  ... 
doi:10.1201/9781420010749.ch45 fatcat:se256h7nz5du7lpzavgbhbbe6m

Brief Announcement

Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai
2018 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18  
We address these fundamental problems, which have been studied previously in the non-preemptive model, and develop novel techniques for tackling them.  ...  In the packing phase, we apply our rounding procedure (for the LP solution) to the tree representation of the intervals.  ...  OUR CONTRIBUTIONS 2.1 Throughput Maximization The non-preemptive version of MaxT, classical RAP, was studied earlier.  ... 
doi:10.1145/3210377.3210666 dblp:conf/spaa/SarpatwarSS18 fatcat:lyujqevhqrhwzejrtxxvq6vkwm

Cutting stock with no three parts per pattern: Work-in-process and pattern minimization

Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli
2011 Discrete Optimization  
general case; however, for special cases of practical relevance, properly including G = K n , quasi-exact solutions for the PMP and the WMP can be found: the latter in polynomial time, the former via a set-packing  ...  Fig. 7 . 7 (a) Compatibility graph; (b) preemptive CSP-optimal solution by 2FFD; (c) non-preemptive CSP-optimal solution.  ...  By Lemma 26, we know that the corresponding solution x has µ(I) save-fbs; thus, being every save-fbs non-preemptive and without split jobs, it is sufficient to show that one can find an optimal non-preemptive  ... 
doi:10.1016/j.disopt.2010.10.002 fatcat:zz62fvsn6zdntp2vemh4ornheu

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

Hans Kellerer, T. Tautenhahn, G. Woeginger
1999 SIAM journal on computing (Print)  
This algorithm is based on resolving the preemptions of the corresponding optimum preemptive s c hedule.  ...  The forest corresponding to the optimum preemptive s c hedule has a single non-trivial tree with root J x and with J 1 : : : J x;1 as leaves.  ...  Let J i be the root of the rightmost non-trivial out-tree.  ... 
doi:10.1137/s0097539796305778 fatcat:bpoxobbc6rbtfds4r77z5nu4dy

Approximability and nonapproximability results for minimizing total flow time on a single machine

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
1996 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96  
This algorithm is based on resolving the preemptions of the corresponding optimum preemptive s c hedule.  ...  The forest corresponding to the optimum preemptive s c hedule has a single non-trivial tree with root J x and with J 1 : : : J x;1 as leaves.  ...  Let J i be the root of the rightmost non-trivial out-tree.  ... 
doi:10.1145/237814.237989 dblp:conf/stoc/KellererTW96 fatcat:yjxicpvd3fg7fdvslpqcbe74wi

A Survey to Real Time Message Routing Network System with KLA Modelling

Paul T. Chiou, Yu Sun, Young G S
2017 International Journal in Foundations of Computer Science & Technology  
, bidirectional tree, and bidirectional ring.  ...  During the KLA, each student was supplied a pack of 1.5-Ounce Kit Kat Bars (Milk Chocolate, but flavors may vary). Each pack consists of 4 finger bars.  ... 
doi:10.5121/ijfcst.2017.7401 fatcat:lyeznaafsrfzplhjhhygnxgtbu

The Preemptive Resource Allocation Problem

Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai, Michael Wagner
2019 Foundations of Software Technology and Theoretical Computer Science  
ACM Subject Classification Theory of computation → Design and analysis of algorithms; Theory of computation → Packing and covering problems; Theory of computation → Scheduling algorithms  ...  We note that the preemptive versus non-preemptive problems differ quite a bit in their structural properties. As mentioned above, MinR generalizes the classic vector packing (VP) problem.  ...  As mentioned above, the non-preemptive version of this problem is the classic RAP.  ... 
doi:10.4230/lipics.fsttcs.2019.26 dblp:conf/fsttcs/SarpatwarSS19 fatcat:c4x4syzv5vbznjnlkegk5ufwoa

Power-aware SoC test optimization through dynamic voltage and frequency scaling

Vijay Sheshadri, Vishwani D. Agrawal, Prathima Agrawal
2013 2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration (VLSI-SoC)  
Some of the heuristics that have been proposed for SoC test scheduling include tree-growing algorithm [24] , bin packing [13] , [15] and simulated annealing [12] , [36] .  ...  We also observe that the preemptive and non-preemptive strategies yield almost identical solutions.  ... 
doi:10.1109/vlsi-soc.2013.6673258 dblp:conf/vlsi/SheshadriAA13 fatcat:o2u3l54ilbebtnonfln25asl4e

Dynamic Windows Scheduling with Reallocation [article]

Martin Farach-Colton and Katia Leal and Miguel A. Mosteiro and Christopher Thraves
2014 arXiv   pre-print
The problem is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain.  ...  Preemptive Reallocation guarantees low channel-usage because clients are preemptively reallocated to achieve the offline packing of [4] .  ...  Aiming to minimize channel usage, clients are preemptively reallocated to guarantee the same offline packing.  ... 
arXiv:1404.1087v1 fatcat:t54oz2w5f5fcjbef4uevaukxea

Scheduling (Dagstuhl Seminar 16081)

Nikhil Bansal, Nicole Megow, Clifford Stein, Marc Herbstritt
2016 Dagstuhl Reports  
Scheduling problems are traditionally classified as either preemptive, or non-preemptive.  ...  What is the complexity of the problem when the speeds are monotone non-decreasing or non-increasing? What is the complexity of the non-preemptive version of the problem?  ... 
doi:10.4230/dagrep.6.2.97 dblp:journals/dagstuhl-reports/BansalMS16 fatcat:7yjnnvu26vcjfa3r6nknvrpkk4

Tor circuit fingerprinting defenses using adaptive padding [article]

George Kadianakis, Theodoros Polyzos, Mike Perry, Kostas Chatzikokolakis
2022 arXiv   pre-print
Tree SVM Dec. Tree SVM Dec.  ...  It is also possible to enhance our padding machines so that they emit additional padding cells on rendezvous circuits to simulate the non-optimal cell packing of exit circuits.  ...  Combined with accuracy results on Table 1 , they describe the classification performance for both Decision Tree and SVM classifiers for our multi site scenario. Proof.  ... 
arXiv:2103.03831v2 fatcat:jlxsi3onlneitcbzglvhgsx3vq

Page 5223 of Mathematical Reviews Vol. , Issue 2002G [page]

2002 Mathematical Reviews  
,a, using the Maple algcurves pack- age.  ...  This paper extends the study of nni distance to trees with non-uniform degrees.  ... 

Page 7324 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
Chan, A near-linear area bound for drawing binary trees (161-168); Barun Chandra and Magnus M. Halldorsson, Greedy local improvement and weighted set packing approximation (169-176).  ...  Ravi Kumar], Sridhar Rajagopalan, Amit Sahai and Andrew Tomkins, Minimiz- ing wirelength in zero and bounded skew clock trees (177-184); Chandra Chekuri and Sanjeev Khanna, On multi-dimensional packing  ... 

Allocation of Real-Time Tasks onto Identical Core Platforms under Deferred fixed Preemption-Point Model

Ikram Senoussaoui, Houssam-Eddine Zahaf, Mohammed Kamel Benhaoua, Giuseppe Lipari, Richard Olejnik
2020 Proceedings of the 28th International Conference on Real-Time Networks and Systems  
Deferred-preemption model has been proposed as a compromise between fully preemptive and non-preemptive systems: on one hand they reduce the cache related preemption delays; on the other hand they introduce  ...  Maximum non-preemptive execution-time Let Q (τ i ) be the largest non-preemptive interval for task τ i .  ...  A non-preemptive region is the union of consecutive non-preemptive blocks between which no preemption point has been selected. They can be expressed as follows: ∀k = 1, . . .  ... 
doi:10.1145/3394810.3394821 dblp:conf/rtns/SenoussaouiZBLO20 fatcat:nfhthaxsnbasfibith2eus7rhm

Implications of classical scheduling results for real-time systems

J.A. Stankovic, M. Spuri, M. Di Natale, G.C. Buttazzo
1995 Computer  
multiprocessor results are addressed as well as important issues such a s future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic scheduling, preemption versus non-preemption  ...  However, in general, these heuristics use a non-preemptive model.  ...  The main disadvantage of the non-preemptive model is the (usually) less e cient utilization of the processor. Heuristics also exist for a preemptive model 33] .  ... 
doi:10.1109/2.386982 fatcat:pgdsgkk5mbhzra4bud4w5fxerq
« Previous Showing results 1 — 15 out of 1,624 results