Experimental study of scheduling with memory constraints using hybrid methods

Journal of Computational and Applied Mathematics

Volumn 232, Issue 2, 2009, Pages 638-654

  Berlinska J ^a   Drozdowski, M ^b   Lawenda, M ^c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^c POZNAN SUPERCOMPUTING AND NETWORKING CENTER   (Poland)

Author keywords

Divisible loads; Memory limitations; Multiple installments; Parallel processing; Scheduling

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMMUNICATION TIME; COMPUTATION TIME; COMPUTATIONAL STUDIES; DISTRIBUTED SYSTEMS; DIVISIBLE LOAD SCHEDULING; DIVISIBLE LOADS; EXECUTION TIME; EXPERIMENTAL STUDIES; HYBRID ALGORITHMS; HYBRID METHOD; LIMITED MEMORY; LINEAR PROGRAMMING PROBLEM; MEMORY CONSTRAINTS; MEMORY LIMITATIONS; MULTIPLE INSTALLMENTS; PARALLEL COMPUTATION; PARALLEL PROCESSING; PROCESSOR MEMORY; REMOTE COMPUTERS; SCHEDULING PROBLEM; SINGLE LEVEL;

ALGEBRA; COMBINATORIAL MATHEMATICS; LINEARIZATION;

SCHEDULING ALGORITHMS;

EID: 68349144587     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2009.07.004     Document Type: Article

References (14)

1. Agrawal R., and Jagadish H.V. Partitioning techniques for large-grained parallelism. IEEE Transactions on Computers 37 (1988) 1627-1634
2. Cheng Y.-C., and Robertazzi T.G. Distributed computation with communication delay. IEEE Transactions on Aerospace and Electronic Systems 24 (1988) 700-712
3. Bharadwaj V., Ghose D., Mani V., and Robertazzi T. Scheduling Divisible Loads in Parallel and Distributed Systems (1996), IEEE Computer Society Press, Los Alamitos CA
4. Drozdowski M. Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems. Series: Monographs vol. 321 (1997), Poznań University of Technology Press. http://www.cs.put.poznan.pl/mdrozdowski/txt/h.ps
5. Robertazzi T. Ten reasons to use divisible load theory. IEEE Computer 36 (2003) 63-68
6. X. Li, V. Bharadwaj, C.C. Ko, Processing divisible loads on single-level tree networks with buffer constraints, IEEE Transactions on Aerospace and Electronic Systems 36 (2000) 1298-1308
7. Drozdowski M., and Wolniewicz P. Divisible load scheduling in systems with limited memory. Cluster Computing 6 (2003) 19-29
8. Drozdowski M., and Wolniewicz P. Optimum divisible load scheduling on heterogeneous stars with limited memory. European Journal of Operational Research 172 (2006) 545-559
9. Drozdowski M., and Lawenda M. Multi-installment divisible load processing in heterogeneous systems with limited memory. In: Wyrzykowski R., et al. (Ed). PPAM 2005. Lecture Notes in Computer Science vol. 3911 (2006), Springer, Berlin 847-854
10. Drozdowski M., and Lawenda M. A new model of multi-installment divisible loads processing in systems with limited memory. In: Wyrzykowski R., et al. (Ed). PPAM 2007. Lecture Notes in Computer Science vol. 4967 (2008), Springer, Berlin 1009-1018
11. Lp_solve reference guide, 2007. http://lpsolve.sourceforge.net/5.5/
12. J. Berlińska, M. Drozdowski, M. Lawenda, Multi-Installment Divisible Loads Scheduling in Systems with Limited Memory, Research Report RA-07/08, Institute of Computing Science, Poznan University of Technology, 2008 http://www.cs.put.poznan.pl/mdrozdowski/rapIIn/ra0708.pdf
13. Bharadwaj V., Ghose D., and Mani V. Multi-installment load distribution in tree networks with delays. IEEE Transactions on Aerospace and Electronic Systems 31 (1995) 555-567
14. Y. Yang, H. Casanova, M. Drozdowski, M. Lawenda, A. Legrand, On the complexity of multi-round divisible load scheduling, Research Report 6096, INRIA Rhône-Alpes, 38334 Montbonnot Saint Ismier, France, January 2007. https://hal.inria.fr/inria-00123711