Scheduling tasks sharing files on heterogeneous master-slave platforms

Journal of Systems Architecture

Volumn 52, Issue 2, 2006, Pages 88-104

  Giersch, Arnaud ^a,c   Robert, Yves ^b,d   Vivien, Frédéric ^b,e  

^a Faculté de Médecine   (France)

^b UNIVERSITÉ DE LYON   (France)

^c UNIVERSITÉ DE STRASBOURG   (France)

^d IEEE   (France)

^e INRIA   (France)

Author keywords

File sharing; Heterogeneous clusters; Heuristics; Independent tasks; Scheduling

Indexed keywords

FILE-SHARING; HETEROGENOUS CLUSTERS; INDEPENDENT TASKS;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; PARAMETER ESTIMATION; PROGRAM PROCESSORS;

SCHEDULING;

EID: 30744448433     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2004.10.008     Document Type: Article

References (13)

1. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman, Heuristics for scheduling parameter sweep applications in Grid environments, in: Ninth Heterogeneous Computing Workshop, IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 349-363.
2. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman, Using simulation to evaluate scheduling heuristics for a class of applications in grid environments, Research Report RR-1999-46, LIP, ENS Lyon, France, 1999.
3. F. Berman High-performance schedulers I. Foster C. Kesselman The Grid: Blueprint for a New Computing Infrastructure 1999 Morgan-Kaufmann Los Altos, CA 279 309
4. M. Maheswaran, S. Ali, H.J. Siegel, D. Hensgen, R.F. Freund, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems, in: Proceedings of the Eight Heterogeneous Computing Workshop, IEEE Computer Society Press, Silver Spring, MD, 1999, pp. 30-44.
5. T.D. Braun, H.J. Siegel, N. Beck, L.L. Bölöni, M. Maheswaran, A.I. Reuther, J.P. Robertson, M.D. Theys, B. Yao, D. Hensgen, and R.F. Freund A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems Journal of Parallel and Distributed Computing 61 6 2001 810 837
6. B.A. Shirazi A.R. Hurson K.M. Kavi Scheduling and Load Balancing in Parallel and Distributed Systems 1995 IEEE Computer Society Press Silver Spring, MD
7. Ph. Chrétienne E.G. Coffman Jr. J.K. Lenstra Z. Liu Scheduling Theory and its Applications 1995 John Wiley and Sons New York
8. O. Beaumont, A. Legrand, 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, CRC Press, Boca Raton, 2002, pp. 115-119.
9. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
10. E.M. Macambira, and C.C. de Souza The edge-weighted clique problem: valid inequalities, facets and polyhedral computations European Journal of Operational Research 123 2 2000 346 371
11. M.R. Garey, and D.S. Johnson Computers and Intractability, a Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
12. A. Giersch, Y. Robert, F. Vivien, Scheduling tasks sharing files on heterogeneous clusters, Research Report RR-2003-28, LIP, ENS Lyon, France, also available as INRIA Research Report 4819, 2003.
13. A. Giersch, Y. Robert, and F. Vivien Scheduling tasks sharing files from distributed repositories Euro-Par'04: Parallel Processing Lecture Notes in Computer Science 2004 Springer Verlag Berlin 148 159