Independent and divisible tasks scheduling on heterogeneous star-shaped platforms with limited memory

Proceedings - 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing 2005, PDP 2005

Volumn 2005, Issue , 2005, Pages 179-186

  Beaumont, O ^a   Legrand, A ^a   Marchal, L ^a   Robert, Y ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Bounded buffers; Divisible load; Makespan; Memory constraints; Memory limitation; Scheduling; Steady state

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER);

BOUNDED BUFFERS; DIVISIBLE LOAD; MAKESPAN; MEMORY CONSTRAINTS; MEMORY LIMITATION; STEADY-STATE;

SCHEDULING;

EID: 33646553600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2005.25     Document Type: Conference Paper

References (20)

1. C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Scheduling strategies for master-slave tasking on heterogeneous processor platforms. IEEE Trans. Parallel Distributed Systems. 15(4):319-330, 2004.
2. G. Barlas. Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees. IEEE Trans. Parallel Distributed Systems, 9(5):429-441, 1998.
3. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Bandwidth-centric allocation of independent tasks on heterogeneous platforms. In International Parallel and Distributed Processing Symposium (IPDPS'2002). IEEE Computer Society Press, 2002.
4. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Independent and divisible tasks scheduling on heterogenous star-shape platforms with limited memory. Technical Report 2004-22, LIP, ENS Lyon, France, Apr. 2004.
5. O. Beaumont, A. Legrand, and Y. Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. In ISCIS XVII, Seventeenth International Symposium On Computer and Information Sciences, pages 115-119. CRC Press, 2002.
6. O. Beaumont, A. Legrand, and Y. Robert. Scheduling divisible workloads on heterogeneous platforms. Parallel Computing, 29:1121-1152, 2003.
7. V. Bharadwaj, D. Ghose, and V. Mani. Optimal Sequencing and Arrangement in Single-Level Tree Networks with Communication Delays. IEEE transactions on parallel and distributed systems, 5(9), 1994.
8. E. Carter, H. Casanova, J. Ferrante, and B. Kreaseck. Autonomous protocols for bandwidth-centric scheduling of independent-task applications. In International Parallel and Distributed Processing Symposium IPDPS'2003. IEEE Computer Society Press, 2003.
9. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In Ninth Heterogeneous Computing Workshop, pages 349-363. IEEE Computer Society Press, 2000.
10. E. G. Coffman. Computer and job-shop scheduling theory. John Wiley & Sons, 1976.
11. M. Drozdowski and P. Wolniewicz. Divisible Load Scheduling in Systems with Limited Memory. Cluster Computing, 6(1): 19-29, 2003.
12. P.-F. Dutot. Master-slave tasking on heterogeneous processors. In International Parallel and Distributed Processing Symposium IPDPS'2003. IEEE Computer Society Press. 2003.
13. P.-F. Dutot. Complexity of master-slave tasking on heterogeneous trees. European Journal of Operational Research, 2004. Special issue on the Dagstuhl meeting on Scheduling for Computing and Manufacturing systems (to appear).
14. M. R. Garey and D. S. Johnson. Computers and Intractability; a Guide to the Theory of NP-Completeness. W. H. Freeman and Company. 1991.
15. J. P. Goux, S. Kulkarni, J. Linderoth, and M. Yoder. An enabling framework for master-worker applications on the computational grid. In Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC'00). IEEE Computer Society Press, 2000.
16. E. Heymann, M. A. Senar, E. Luque, and M. Livny. Adaptive scheduling for master-worker applications on the computational grid. In R. Buyya and M. Baker, editors, Grid Computing - GRID 2000, pages 214-227. Springer-Verlag LNCS 1971, 2000.
17. B. Kreaseck. Dynamic autonomous scheduling on Heterogeneous Systems. PhD thesis, University of California, San Diego, 2003.
18. M. Maheswaran, S. Ali, H. Siegel, D. Hensgen, and R. Freund. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In Eight Heterogeneous Computing Workshop, pages 30-44. IEEE Computer Society Press, 1999.
19. G. Shao, F. Berman, and R. Wolski. Master/slave computing on the grid. In Heterogeneous Computing Workshop HCW'00. IEEE Computer Society Press, 2000.
20. J. B. Weissman. Scheduling multi-component applications in heterogeneous wide-area networks. In Heterogeneous Computing Workshop HCW'00. IEEE Computer Society Press, 2000.