Optimum divisible load scheduling on heterogeneous stars with limited memory

European Journal of Operational Research

Volumn 172, Issue 2, 2006, Pages 545-559

  Drozdowski, M ^a   Wolniewicz, P ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b POZNAN SUPERCOMPUTING AND NETWORKING CENTER   (Poland)

Author keywords

Divisible loads; Memory constraints; Parallel computing; Scheduling

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

DIVISIBLE LOADS; MEMORY CONSTRAINTS; MEMORY SIZES;

SCHEDULING;

EID: 33644691664     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.10.022     Document Type: Article

References (16)

1. G.D. Barlas Collection-aware optimum sequencing of operations and closed form solutions for the distribution of a divisible load on arbitrary processor trees IEEE Transactions on Parallel and Distributed Systems 9 5 1998 411 429
2. O. Beaumont, H. Casanova, A. Legrand, Y. Robert, Y. Yang, Scheduling divisible loads on star and tree networks: Results and open problems, Technical Report LIP, Lyon, RR-LIP-2003-41, 2003.
3. V. Bharadwaj, and G. Barlas Access time minimization for distributed multimedia applications Multimedia Tools and Applications 12 2/3 2000 235 256
4. V. Bharadwaj, D. Ghose, V. Mani, and T. Robertazzi Scheduling Divisible Loads in Parallel and Distributed Systems 1996 IEEE Computer Society Press Los Alamitos, CA
5. V. Bharadwaj, D. Ghose, and T. Robertazzi Divisible load theory: A new paradigm for load scheduling in distributed systems Cluster Computing 6 1 2003 19 29
6. J. Błażewicz, and M. Drozdowski Distributed processing of divisible jobs with communication startup costs Discrete Applied Mathematics 76 1-3 1997 21 41
7. J. Błażewicz, M. Drozdowski, and K. Ecker Management of resources in parallel systems J. Błażewicz K. Ecker B. Plateau D. Trystram Handbook on Parallel and Distributed Processing 2000 Springer Heidelberg 263 341
8. J. Błażewicz, M. Drozdowski, and M. Markiewicz Divisible task scheduling-concept and verification Parallel Computing 25 1999 87 98
9. J.P. Boufflet, and J. Carlier An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system Discrete Applied Mathematics 94 1999 51 76
10. S.K. Chan, V. Bharadwaj, D. Ghose, Experimental study on large size matrix-vector product computations using divisible load paradigm on distributed bus networks, Technical Report No. TR-OSSL/BV-DLT/01, Open Source Laboratory, Department of Electrical and Computer Engineering, The National University of Singapore, Singapore, 2000.
11. M. Drozdowski Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems 1997 Poznań University of Technology Press Poznań (downloadable from website: www.cs.put.poznan.pl/~maciejd/txt/h. ps )
12. M. Drozdowski, P. Wolniewicz, Experiments with scheduling divisible tasks in clusters of workstations, in: A. Bode, T. Ludwig, W. Karl, R. Wismüller (Eds.), Euro-Par 2000, Lecture Notes in Computer Science 1900, Springer-Verlag, 2000, pp. 311-319.
13. M. Drozdowski, and P. Wolniewicz Divisible load scheduling in systems with limited memory Cluster Computing 6 1 2003 19 29
14. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman San Francisco
15. K. Ko, Scheduling Data Intensive Parallel Processing in Distributed and Networked Environments, Ph.D. Thesis, Department of Electrical and Computer Engineering, State University of New York at Stony Brook, 2000.
16. X. Li, V. Bharadvaj, and C.C. Ko Processing divisible loads on single-level tree networks with buffer constraints IEEE Transactions on Aerospace and Electronic Systems 36 4 2000 1298 1308