Steady-state scheduling on heterogeneous clusters

International Journal of Foundations of Computer Science

Volumn 16, Issue 2, 2005, Pages 163-194

  Beaumont, Olivier ^a   Legrand, Arnaud ^b   Marchal, Loris ^b   Robert, Yves ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746228290     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105002930     Document Type: Conference Paper

References (62)

1. M. Adler, Y. Gong, and A. L. Rosenberg. Optimal sharing of bags of tasks in heterogeneous clusters. In 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA '03), pages 1-10. ACM Press, 2003.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, Berlin, Germany, 1999.
3. H. Bal and M. Haines. Approaches for integrating task and data parallelism. IEEE Concurrency, 6(3):74-84, 1998.
4. M. Banikazemi, V. Moorthy, and D. K. Panda. Efficient collective communication on heterogeneous networks of workstations. In Proceedings of the 27th International Conference on Parallel Processing (ICPP'98), IEEE Computer Society Press, 1998.
5. M. Banikazemi, J. Sampathkumar, S. Prabhu, D. Panda, and P. Sadayappan. Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations. In HCW'99, the 8th Heterogeneous Computing Workshop, pages 125-133. IEEE Computer Society Press, 1999.
6. O. Beaumont, V. Boudet, and Y. Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In HCW'2002, the 11th Heterogeneous Computing Workshop. IEEE Computer Society Press, 2002.
7. 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.
8. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Optimal algorithms for the pipelined scheduling of task graphs on heterogeneous systems. Technical Report RR-2003-29, LIP, ENS Lyon, France, Apr. 2003.
9. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Optimizing the steady-state throughput of broadcasts on heterogeneous platforms heterogeneous platforms. Technical report, LIP, ENS Lyon, France, June 2003.
10. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogenous platforms. Research Report RR-2004-20, LIP, ENS Lyon, France, Apr. 2004.
11. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms. In 2004 International Conference on Parallel Processing (ICPP'2004). IEEE Computer Society Press, 2004.
12. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms. Research Report RR-2004-07, LIP, ENS Lyon, France, Jan. 2004.
13. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Pipelining broadcasts on heterogeneous platforms. In International Parallel and Distributed Processing Symposium IPDPS'2004, IEEE Computer Society Press, 2004.
14. O. Beaumont, A. Legrand, and Y. Robert. Scheduling divisible workloads on heterogeneous platforms. Parallel Computing, 29:1121-1152, 2003.
15. O. Beaumont and L. Marchal. Pipelining broadcasts on heterogeneous platforms under the one-port model. Research Report RR-2004-32, LIP, ENS Lyon, France, July 2004.
16. D. Bertsimas and D. Gamarnik. Asymptotically optimal algorithm for job shop scheduling and packet routing. Journal of Algorithms, 33(2):296-318, 1999.
17. M. D. Beynon, T. Kurc, A. Sussman, and J. Saltz. Optimizing execution of component-based applications using group instances. Future Generation Computer Systems, 18(4):435-448, 2002.
18. P. Bhat, C. Raghavendra, and V. Prasanna. Adaptive communication algorithms for distributed heterogeneous systems. Journal of Parallel and Distributed Computing, 59(2):252-279, 1999.
19. P. B. Bhat, V. K. Prasanna, and C. S. Raghavendra. Efficient collective communication in distributed heterogeneous systems. In 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99). IEEE Computer Society Press, 1999.
20. V. Boudet and Y. Robert. Scheduling heuristics for heterogeneous processors. In 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001), pages 2109-2115. CSREA Press, 2001. Extended version available (on the Web) as Technical Report 2001-22, LIP, ENS Lyon.
21. T. D. Braun, H. J. Siegel, and N. Beck. Optimal use of mixed task and data parallelism for pipelined computations. J. Parallel and Distributed Computing, 61:810-837, 2001.
22. L. 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.
23. S. Chakrabarti, J. Demmel, and K. Yelick. Models and scheduling algorithms for mixed data and task parallel programs. J. Parallel and Distributed Computing, 47:168-184, 1997.
24. S. Charcranoon, T. Robertazzi, and S. Luryi. Optimizing computing costs using divisible load analysis. IEEE Transactions on computers, 49(9):987-991, Sept. 2000.
25. P. 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).
26. 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.
27. N. Hall, W.-P. Liu, and J. Sidney. Scheduling in broadcast networks. Networks, 32(14):233-253, 1998.
28. J.-I. Hatta and S. Shibusawa. Scheduling algorithms for efficient gather operations in distributed heterogeneous systems. In 2000 International Conference on Parallel Processing (ICPP'2000). IEEE Computer Society Press, 2000.
29. 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.
30. L. Hollermann, T. S. Hsu, D. R. Lopez, and K. Vertanen. Scheduling problems in a practical allocation model. J. Combinatorial Optimization, 1(2):129-149, 1997.
31. B. Hong and V. Prasanna. Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput. In Proceedings of the 32th International Conference on Parallel Processing (ICPP'2003). IEEE Computer Society Press, 2003.
32. B. Hong and V. Prasanna. Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput. In International Parallel and Distributed Processing Symposium IPDPS'2004. IEEE Computer Society Press, 2004.
33. T. S. Hsu, J. C. Lee, D. R. Lopez, and W. A. Royce. Task allocation on a network of processors. IEEE Trans. Computers, 49(12):1339-1353, 2000.
34. S. L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Computers, 38(9):1249-1268, 1989.
35. D. W. Krumme, G. Cybenko, and K. N. Venkataraman. Gossiping in minimal time. SIAM J. Computing, 21:111-139, 1992.
36. A. Legrand, L. Marchal, and Y. Robert. Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms. Technical Report RR-2003-33, LIP, ENS Lyon, France, June 2003.
37. A. Legrand, L. Marchal, and Y. Robert. Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms. In 6th Workshop on Advances in Parallel and Distributed Computational Models APDCM 2004. IEEE Computer Society Press, 2004.
38. A. Legrand, F. Mazoit, and M. Quinson. An application-level network mapper. Research Report RR-2003-09, LIP, ENS Lyon, France, feb 2003.
39. R. Libeskind-Hadas, J. R. K. Hartline, P. Boothe, G. Rae, and J. Swisher. On multicast algorithms for heterogeneous networks of workstations. Journal of Parallel and Distributed Computing, 61(11):1665-1679, 2001.
40. P. Liu. Broadcast scheduling optimization for heterogeneous cluster systems. Journal of Algorithms, 42(1):135-152, 2002.
41. P. Liu and T.-H. Sheng. Broadcast scheduling optimization for heterogeneous cluster systems. In SPAA'2000, 12th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 129-136. ACM Press, 2000.
42. M. Maheswaran and H. J. Siegel. A dynamic matching and scheduling algorithm for heterogeneous computing systems. In Seventh Heterogeneous Computing Workshop. IEEE Computer Society Press, 1998.
43. H. Oh and S. Ha. A static scheduling heuristic for heterogeneous processors. In Proceedings of Europar'96, LNCS 1123. Springer Verlag, 1996.
44. V. Paxson. Measurements and Analysis of End-to-End Internet Dynamics. PhD thesis, University of California, Berkeley, 1997.
45. S. Ramaswamy, S. Sapatnekar, and P. Banerjee. A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Trans. Parallel and Distributed Systems, 8(11):1098-1116, 1997.
46. A. L. Rosenberg. On sharing bags of tasks in heterogeneous networks of workstations: greedier is not better. In Cluster Computing 2001, pages 124-131. IEEE Computer Society Press, 2001.
47. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986.
48. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, volume 24 of Algorithms and Combinatorics. Springer-Verlag, 2003.
49. G. Shao. Adaptive scheduling of master/worker applications on distributed computational resources. PhD thesis, Dept. of Computer Science, University Of California at San Diego, 2001.
50. G. Shao, F. Berman, and R. Wolski. Master/slave computing on the grid. In Heterogeneous Computing Workshop HCW'00. IEEE Computer Society Press, 2000.
51. B. A. Shirazi, A. R. Hurson, and K. M. Kavi. Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, 1995.
52. G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175-187, 1993.
53. O. Sinnen and L. Sousa. Comparison of contention-aware list scheduling heuristics for cluster computing. In T. M. Pinkston, editor, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pages 382-387. IEEE Computer Society Press, 2001.
54. O. Sinnen and L. Sousa. Exploiting unused time-slots in list scheduling considering communication contention. In R. Sakellariou, J. Keane, J. Gurd, and L. Freeman, editors, EuroPar'2001 Parallel Processing, pages 166-170. Springer-Verlag LNCS 2150, 2001.
55. J. Sohn, T. Robertazzi, and S. Luryi. Optimizing computing costs using divisible load analysis. IEEE Transactions on parallel and distributed systems, 9(3):225-234, Mar. 1998.
56. M. Spencer, R. Ferreira, M. Beynon, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz. Executing multiple pipelined data analysis operations in the grid. In 2002 ACM/IEEE Supercomputing Conference. ACM Press, 2002.
57. J. Subhlok, J. Stichnoth, D. O'Hallaron, and T. Gross. Exploiting task and data parallelism on a multicomputer. In Fourth ACM SIGPLAN Symposium on Priciples & Practices of Parallel Programming. ACM Press, May 1993.
58. J. Subhlok and G. Vondran. Optimal use of mixed task and data parallelism for pipelined computations. J. Parallel and Distributed Computing, 60:297-319, 2000.
59. K. Taura and A. A. Chien. A heuristic algorithm for mapping communicating tasks on heterogeneous resources. In Heterogeneous Computing Workshop, pages 102-115. IEEE Computer Society Press, 2000.
60. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Task scheduling algorithms for heterogeneous processors. In Eighth Heterogeneous Computing Workshop. IEEE Computer Society Press, 1999.
61. J. B. Weissman. Scheduling multi-component applications in heterogeneous wide-area networks. In Heterogeneous Computing Workshop HCW'00. IEEE Computer Society Press, 2000.
62. R. Wolski, N. Spring, and J. Hayes. The network weather service: a distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems, 15(10):757-768, 1999.