Scheduling jobs with simple precedence constraints on parallel ...
Recommend Documents
May 26, 2011 - [2] Chandra Chekuri and Michael Bender. An efficient ... [6] Vincent W. Freeh, Nandini Kappiah, David K. Lowenthal, and Tyler K. Bletsch.
Consider a scheduling problem where n jobs j â V , with integral processing times ¯pj, ... of the machines, and if a job is scheduled on machine i, using s of the k ...
May 31, 2014 - We consider the problems of scheduling deteriorating jobs with release dates on a single machine (parallel machines) and jobs can.
University of Minnesota ..... âstrictâ and âniceâ for the reasons that will become clear later. Each method is ... The âniceâ method was created in the attempt to fix the.
Nov 28, 1995 - scheduling algorithm-one that is insensitive to register ... greater than two, since side exits may have a number of values that are live-out.
Aug 23, 2000 - Ausiello, d'Atri, and Sacc`a (1983) (see also Ausiello, d'Atri, and Sacc`a ...... 669/2000 Michael Naatz: A note on a question of C. D. Savage ...
instance, as is the case with Graham's classical list algorithm for the identical ... its original definition by [GLLR79] where it was used to denote the number of ...
May 28, 2004 - Computers & Operations Research 32 (2005) 2731â2750 ... Therefore, this research proposes two heuristic approaches that lead to good.
Apr 3, 1998 - Consider the execution of a parallel application that dynamically generates parallel jobs with speci ed resource requirements during its.
Let the jobs be indexed according to the SGR order so that a1 6 a2 6 ءءء 6 an. We introduce variables xj, j ¼ 1, 2, ... , n, where xj ¼ k if job Jj is processed on ...
scheduling the jobs in the order of their completion times in a preemptive ... eral versions of the off-line preemptive deterministic algorithm PSRS, which can be ...
Bicriteria Scheduling for Parallel Jobs. Dror G. Feitelson and Ahuva Mu'alem. School of Computer Science and Engineering
Sep 2, 2013 - scheduling of deteriorating jobs with consideration of setup times is relatively ...... Computers & Operations Research 32 (3): 521â536.
ever, can be encoded more succinctly by O( n ) numbers: for each job, we need to specify its .... Finally, the jobs are scheduled using (an adaption of) Graham's greedy schedul- .... optimality; for a proof we refer to a full version of the paper.
1School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213. ... good results if the mapping of the requested processors on the smaller set.
multiprocessor jobs with a fixed number of processors requested for parallel ..... work (both phases use the well-known Graham's strategy); and phase 2 (time ...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job.
ing of moldable jobs focused on when and how to choose ... Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER'03).
Dept. of Computer and Info. Science ... allel jobs [5, 17] and contiguous node allocation strategies ... buddy strategy was best, performing better than fully con-.
Computer Sciences Corporation. Attention: ... Abstract. Backfill is a technique in which lower priority jobs re- .... a combination of jobs that fit the best. All three of ...
Centre for Mathematics and Computer Science. P.O. Box 4079 ... The second field contains the job characteristics; p, + 1 indicates that we have unit processing ...
9 jobs - Abstract. We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de- creasing to e/(e ...
Abstract. Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases ...
odology for scheduling jobs on identical, parallel machines. ... performance or expensive computer simuâ lation with ...... is an Associate Editor of the IEEE Transactions on Automatic ... Who 's Who in the Frontiers of Science and Tech- riulogy.
