Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid

Proceedings - 2nd International Symposium on Parallel and Distributed Computing, ISPDC 2003

Volumn , Issue , 2003, Pages 80-87

  Fujimoto, Noriyuki ^a   Hagihara, Kenichi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRID COMPUTING; MULTITASKING; PARALLEL PROCESSING SYSTEMS;

COMPUTATIONAL GRIDS; COMPUTING POWER; OBJECTIVE FUNCTIONS; OPTIMAL SCHEDULE; PERFORMANCE GUARANTEES; PERFORMANCE MEASURE; PREDICTION INFORMATIONS; TASK SCHEDULING PROBLEM;

SCHEDULING ALGORITHMS;

EID: 84947903944     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2003.1267647     Document Type: Conference Paper

References (25)

1. D. Abramson, J. Giddy, and L. Kotler. High performance parametric modeling with Nimrod/G: Killer application for the global grid In International Parallel and Distributed Processing Symposium (IPDPS), pages 520-528, 2000.
2. A. Alhusaini, V. Prasanna, and C. Raghavendra. A unified resource scheduling framework for heterogeneous computing environments. In 8th Heterogeneous Computing Workshop (HCW), pages 156-165, 1999.
3. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. SETI@home: An experiment in public-resource computing. Communications of the ACM, 45(11):56-61, 2002.
4. J. Blazewicz, F. Guinand, B. Penz, and D. Trystram. Scheduling complete trees on two uniform processors with integer speed ratios and communication delays. Parallel Processing Letters, 10(4):267-277, 2000.
5. P. Brucker, J. Hurink, and W. Kubiak. Scheduling identical jobs with chain precedence constraints on two uniform machines. Mathematical Methods of Operations Research, 49(2):211-219, 1999.
6. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. In 9th Heterogeneous Computing Workshop (HCW), pages 349-363, 2000.
7. N. Fujimoto and K. Hagihara. Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid. In 32nd Annual International Conference on Parallel Processing (ICPP-03), pages 391-398, 2003.
8. H. N. Gabow. An almost-linear algorithm for two-processor scheduling. Journal of the ACM, 29:766-780, 1982.
9. M. R. Garey and D. S. Johnson. Strong NP-completeness results: motivation, examples, and implications. Journal of the ACM, 25(3):499-508, 1978.
10. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287-326, 1979.
11. E. Heymann, M. A. Senar, E. Luque, and M. Livny. Adaptive scheduling for master-worker applications on the computational grid. In 1st IEEE/ACM International Workshop on Grid Computing (GRID), pages 214-227, 2000.
12. D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for machine scheduling on uniform processors: Using dual approximation approach. SIAM Journal on Computing, 17:539-551, 1988.
13. E. Horowitz and S. K. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23:317-327, 1976.
14. W. Kubiak. Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints. In Abstracts EURO IX-TIMS XXVIII Paris, page 195, 1988.
15. W. Kubiak. Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints. Zeitschrifts fur Operations Research, 33:423-437, 1989.
16. W. Kubiak, B. Penz, and D. Trystram. Scheduling chains on uniform processors with communication delays. Journal of Scheduling, 5(6):459-476, 2002.
17. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, Hand Book in Operations Research and Management Science, volume 4: Logistics of Production and Inventory, pages 445-522. North-Holland, 2002.
18. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Machines, 1:343-362, 1977.
19. D. Paranhos, W. Cirne, and F. Brasileiro. Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids. In International Conference on Parallel and Distributed Computing (Euro-Par), Lecture Notes in Computer Science, volume 2790, pages 169-180, 2003.
20. G. Shao, F. Berman, and R. Wolski. Master/slave computing on the grid. In 9th Heterogeneous Computing Workshop (HCW), pages 3-16, 2000.
21. M. Sirbu and D. Marinescu. A scheduling expert advisor for heterogeneous environments. In 6th Heterogeneous Computing Workshop (HCW), pages 74-87, 1997.
22. H. Topcuoglu, S. Hariri, W. Furmanski, J. Valente, I. Ra, D. Kim, Y. Kim, X. Bing, and B. Ye. The software architecture of a virtual distributed computing environment. In High-Performance Distributed Computing Conf., pages 40-49, 1997.
23. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Science, 10:384-393, 1975.
24. V. V. Vazirani. Approximation Algorithms. Springer Verlag, 2001.
25. M. Yarrow, K. McCann, R. Biswas, and R. Van der Wijngaart. An advanced user interface approach for complex parameter study process specification on the information power grid. In 1st IEEE/ACM International Workshop on Grid Computing (GRID), pages 146-157, 2000.