On-line scheduling of parallelizable jobs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1470 LNCS, Issue , 1998, Pages 322-327

  Rapine, Christophe ^a   Scherson, Isaac D ^b   Trystram, Denis ^a  

^a Domaine Universitaire   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

DISTRIBUTED SYSTEMS; MULTI-USER; ONLINE SCHEDULING; PARALLEL COM- PUTING; PARALLEL JOBS; PARALLEL MACHINE; RESOURCE UTILIZATIONS; SPACE AND TIME;

PARALLEL PROCESSING SYSTEMS;

EID: 84882682029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057869     Document Type: Conference Paper

References (5)

1. J. Blazewicz, P. Dell'Olmo, M. Drozdowskì, and M.G. Speranza. Scheduling multiprocessors tasks on three dedicated processors. Information Processing Letters, 41:275-280, April 1992.
2. J. Blazewicz, M. Drabowski, and J. Weglarz. Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers, 35(5):389-393, 1986.
3. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416-429, March 1969.
4. R.M. Karp. On the computational complexity of combinatorial problems. Networks, 5:45-68, 1975.
5. I. D. Scherson, R. Subramanian, V. L. M. Reis, and L. M. Campos. Scheduling computationally intensive data parallel programs. In Placement dynamique et répartition de charge : application aux systèmes parallèles et répartis (École Française de Parallélisme, Réseaux et Système), pages 107-129. Inria, July 1996.