Scalable loop self-scheduling schemes for heterogeneous clusters

International Journal of Computational Science and Engineering

Volumn 1, Issue 2-4, 2005, Pages 110-117

  Chronopoulos, Anthony T ^a   Penmatsa, Satish ^a   Yu, Ning ^a   Yu, Du ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

distributed; loops; scalable; scheduling schemes

Indexed keywords

EID: 34548729010     PISSN: 17427185     EISSN: 17427193     Source Type: Journal    
DOI: 10.1504/ijcse.2005.009696     Document Type: Article

References (22)

1. Banicescu, I. and Liu, Z. (2000) ‘Adaptive factoring: a dynamic scheduling method tuned to the rate of weight changes’, Proc. High Performance Computing Symposium, Washington, USA, pp.122–129.
2. Banicescu, I., Velusamy, V. and Devaprasad, J. (2003) ‘On the scalability of dynamic scheduling scientific applications with adaptive weighted factoring’, Cluster Computing 6, pp.215–226.
3. Barbosa, J., Tavares, J. and Padilha, A.J. (2000) ‘Linear algebra algorithms in a heterogeneous cluster of personal computers’, Proc. 9th Heterogeneous Computing Workshop (HCW 2000), May, Cancun, Mexico, pp.147–159.
4. Bull, J.M. (1998) ‘Feedback guided dynamic loop scheduling: Algorithms and experiments’, Proc. 4th Intl Euro - Par Conference, Southampton, UK, pp.377–382.
5. Chronopoulos, A.T., Andonie, R., Benche, M. and Grosu, D. (2001) ‘A class of distributed self-scheduling schemes for heterogeneous clusters’, Proc. 3rd IEEE International Conference on Cluster Computing (CLUSTER 2001), October, Newport Beach, California, USA.
6. Cierniak, M., Li, W. and Zaki, M.J. (1995) ‘Loop scheduling for heterogeneity’, Proc. 4th IEEE Intl. Symp. on High Performance Distributed Computing, August, Washington, DC, USA, pp.78–85.
7. Dandamudi, S.P. (1997) ‘The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems’, Proc. MASCOTS’97, January, Haifa, Israel.
8. Dandamudi, S.P. and Thyagaraj, T.K. (1997) ‘A hierarchical processor scheduling policy for distributed-memory multicomputer systems’, Proc. 4th International Conference on High-Performance Computing, Nagoya, Japan, pp.218–223.
9. Fann, Y.W., Yang, C.T., Tseng, S.S. and Tsai, C.J. (2000) ‘An intelligent parallel loop scheduling for parallelizing compilers’, Journal of Information Science and Engineering, pp.169–200.
10. Freeman, T.L., Hancock, D.J., Bull, J.M. and Ford, R.W. (2000) ‘Feedback guided scheduling of nested loops’, Proc. the 5th Intl Workshop, PARA, Bergen, Norway, pp.149–159.
11. Goumas, G., Drosinos, N., Athanasaki, M. and Koziris, N. (2002) ‘Compiling tiled iteration spaces for clusters’, Proc. IEEE International Conference on Cluster Computing, Chicago, Illinois, pp.360–369.
12. Hancock, D.J., Bull, J.M., Ford, R.W. and Freeman, T.L. (2000) ‘An investigation of feedback guided dynamic scheduling of nested loops’, Proc. Intl Workshops on Parallel Processing, August, Toronto, Canada, pp.315–321.
13. Hummel, S.F., Schmidt, J., Uma, R.N. and Wein, J. (1996) ‘Loadsharing in heterogeneous systems via weighted factoring’, Proc. 8th Annual ACM Symp. on Parallel Algorithms and Architectures, Padua, Italy, pp.318–328.
14. Kee, Y. and Ha, S. (1998) ‘A robust dynamic load-balancing scheme for data parallel application on message passing architecture’, Intl Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA’98), Vol. 2, pp.974–980.
15. Kim, T.H. and Purtilo, J.M. (1996) ‘Load balancing for parallel loops in workstation clusters’, Proc. Intl. Conference on Parallel Processing, Bloomingdale, IL, USA, pp.182–190.
16. Mandelbrot, B.B. (1988) Fractal Geometry of Nature, W.H. Freeman & Co., New York, USA.
17. Markatos, E.P. and LeBlanc, T.J. (1994) ‘Using processor affinity in loop scheduling on shared-memory multiprocessors’, IEEE Trans. on Parallel and Distributed Systems, April, Vol. 5, No. 4, pp.379–400.
18. Pachecho, P. (1997) Parallel Programming with MPI, Morgan Kauffman, San Francisco, CA, USA.
19. Philip, T. and Das, C.R. (1997) ‘Evaluation of loop scheduling algorithms on distributed memory systems’, Proc. Intl Conf. on Parallel and Distributed Computing Systems, Nagoya, Japan.
20. Tzen, T.H. and Ni, L.M. (1993) ‘Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers’, IEEE Trans. on Parallel and Distributed Systems, January, Vol. 4, No. 1, pp.87–98.
21. Yan, Y., Jin, C. and Zhang, X. (1997) ‘Adaptively scheduling parallel loops in distributed shared-memory systems’, IEEE Trans. on Parallel and Distributed Systems, January, Vol. 8, No. 1, pp.70–81.
22. Yang, C.T. and Chang, S.C. (2003) ‘A parallel loop self-scheduling on extremely heterogeneous pc clusters’, Proc. Intl Conf. on Computational Science, Melbourne, Australia, pp.1079–1088.