764 Hits in 3.1 sec

Scheduling on a Constant Number of Machines [chapter]

F. Afrati, E. Bampis, C. Kenyon, I. Milis
1999 Lecture Notes in Computer Science  
, and two different optimization criteria: the makespan and the sum of weigthed completion times.  ...  We consider the problem of scheduling independent jobs on a constant number of machines.  ...  However, even if S is an optimal preemptive schedule, the schedule thus produced is almost certainly not close to optimal, The principle of the algorithm since there can be a large number of possibly long  ... 
doi:10.1007/978-3-540-48413-4_28 fatcat:7n2fbdszwvamvbrw3b3yoxljfa

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

E. L. Lawler, J. Labetoulle
1978 Journal of the ACM  
It IS shown that certain problems of optimal preemptive scheduling of unrelated parallel processors can be formulated and solved as hnear programming problems As a by-product of the linear programming  ...  to schedule n jobs on m unrelated processors so as to minimize makespan KEY WORDS AND PHRASES preemptive scheduling, parallel processors, linear programmmg CR CATEGORIES. 4 32, 5 39  ...  Introduction The general problem we wish to deal with in this paper is that of finding optimal preemptive schedules for independent jobs on unrelated parallel processors.  ... 
doi:10.1145/322092.322101 fatcat:nz3o4uj6hbf6pnpwdlcqztoyvm

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs.  ...  There are several measures of performance which are to be optimized in uniform parallel machines scheduling.  ...  Online Scheduling of Preemptive Jobs to Minimize Makespan Wen and Du [65] have considered the problem of pre-emptive on-line scheduling for two processors in which one of the processors has speed 1 and  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Scheduling jobs that arrive over time [chapter]

Cynthia Phillips, Clifford Stein, Joel Wein
1995 Lecture Notes in Computer Science  
Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both.  ...  A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time.  ...  Note that as long a s (3) and (4) are satisfied, the order in which the first m For unrelated machines the relationship between ZP and optimal preemptive schedules is more complex for two reasons.  ... 
doi:10.1007/3-540-60220-8_53 fatcat:bwfb6ysqdjgunkvf7v3eaolzey

On the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous

Kecheng Yang, James H. Anderson
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
In the non-preemptive case, it is shown that no work-conserving scheduler, including GEDF, can be SRT-optimal on uniform multiprocessors, even if the number of processors is limited to two. *  ...  In the preemptive case, it is shown that such an extension is possible for two-processor platforms but unlikely for platforms of more than two processors, unless fundamentally new proof techniques are  ...  On uniform multiprocessors, we prove that the preemptive GEDF scheduler is SRT-optimal on platforms of only two processors.  ... 
doi:10.1109/rtcsa.2015.14 dblp:conf/rtcsa/YangA15 fatcat:o43etob5jbaxzdxuc35dlqnyyi

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors [article]

Dimitrios Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois
2014 arXiv   pre-print
Our results concern the minimization of the total weighted completion time of a set of MapReduce jobs on unrelated processors and improve substantially on the model proposed by Moseley et al.  ...  We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce systems.  ...  Consider two optimal schedules σ and σ of Shuffle tasks and Reduce tasks on processors of the set P R ∪ P S and on processors of the set P R respectively.  ... 
arXiv:1312.4203v3 fatcat:c6phzpkwbjd73psdvux5iqjupi

Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors

Martin Niemeier, Andreas Wiese, Sanjoy Baruah
2011 2011 23rd Euromicro Conference on Real-Time Systems  
the makespan of the schedule.  ...  We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool.  ...  As a consequence, preemptive optimal schedules will not have a smaller makespan than the non-preemptive optimal schedules assumed in the derivation of Theorem IV.6 and Corollary IV.7.  ... 
doi:10.1109/ecrts.2011.19 dblp:conf/ecrts/NiemeierWB11 fatcat:mtvw3e4l6jazjcshmpxf6c4bmy

Task Distributions on Multiprocessor Systems [chapter]

Evgeny V. Shchepin, Nodari N. Vakhania
2000 Lecture Notes in Computer Science  
We consider the problem of scheduling of n independent jobs on m unrelated machines to minimize the max(t 1, t2, ..., tm), ti being the completion time of machine i.  ...  We also improve this result and obtain (1 − 1 m )-job approximation to optimal.  ...  Construction of an optimal schedule can be split into two stages.  ... 
doi:10.1007/3-540-44929-9_10 fatcat:xjm2bsuybvbmzcoa5rbqhsxhgm

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors [chapter]

Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois
2015 Lecture Notes in Computer Science  
In this work, we extend the model of MapReduce scheduling on unrelated processors (Moseley et al., SPAA 2011) and deal with the practically important case of jobs with any number of Map and Reduce tasks  ...  Moreover, this is the first time that a constant approximation ratio is obtained for minimizing the total weighted completion time on unrelated processors under a nontrivial class of precedence constraints  ...  are 1 + ✏ times faster than the processors used by the optimal schedule.  ... 
doi:10.1007/978-3-319-20086-6_11 fatcat:xcoquezigzdxbpm7yy73t7qexy

A Survey on Scheduling Approaches for Hard Real-Time Systems

Mehrin Rouhifar, Reza Ravanmehr
2015 International Journal of Computer Applications  
This paper composed of two parts; first part surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks.  ...  In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated that include both uni and multi processors schemes.  ...  On the other hand, scheduling algorithms are classified to two types, preemptive and non-preemptive.  ... 
doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

Bjorn B. Brandenburg
2013 2013 25th Euromicro Conference on Real-Time Systems  
It is shown to benefit latency-sensitive workloads, both analytically by means of schedulability experiments, and empirically using response-time measurements in LITMUS RT . 1 Priority inheritance is ineffective  ...  The O(m) independencepreserving protocol (OMIP), a new, asymptotically optimal binary sempahore protocol based on migratory priority inheritance, is proposed and analyzed.  ...  Figure 2 : 2 C-EDF schedule of six jobs in two two-processor clusters sharing one resource 1 under the OMIP.  ... 
doi:10.1109/ecrts.2013.38 dblp:conf/ecrts/Brandenburg13 fatcat:yot6uog37rbhrnzblpgdjcefly

Minimizing the stretch when scheduling flows of divisible requests

Arnaud Legrand, Alan Su, Frédéric Vivien
2008 Journal of Scheduling  
We explain the relationship between our model and the preemptive single processor case, and we show how to extend algorithms that have been proposed in the literature for the single processor model to  ...  We also address the Pareto optimization of max-stretch. Then, we extensively study the performance of these algorithms and heuristics under realistic scenarios.  ...  In the single processor case, Fig. 1 Geometrical transformation of a divisible uniform problem into a preemptive single processor problem a schedule can be seen as a priority list of the jobs (see the  ... 
doi:10.1007/s10951-008-0078-4 fatcat:7g6lmsc4zfcubh6d66ccvyypga

Guest editorial: multiprocessor scheduling

Alan Burns, Laurent George
2013 Real-time systems  
New scheduling approaches  ...  In recent years, multiprocessor architectures have become a firm favorite with the real-time community, and multicore processors are found in products ranging from small portable cell phones to large computer  ...  Then, they propose two exact schedulability tests for hierarchical and global thread scheduling.  ... 
doi:10.1007/s11241-013-9177-1 fatcat:llviqg6ukjh77lybys7a2girsa

Page 5496 of Mathematical Reviews Vol. , Issue 90I [page]

1990 Mathematical Reviews  
Summary: “Some variations are presented for the preemptive scheduling problem on unrelated processors.  ...  The goal is to schedule the tasks on the m processors such that the length of the schedule is minimized.  ... 

Page 2793 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Network flow and linear program- ming approaches are proposed for independent tasks scheduled on, respectively, uniform and unrelated processors with arbitrary patterns of availability for schedule length  ...  Summary: “It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial  ... 
« Previous Showing results 1 — 15 out of 764 results