Dynamic multi phase scheduling for heterogeneous clusters

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Ciorba, Florina M ^a   Andronikos, Theodore ^a   Riakiotakis, Ioannis ^a   Chronopoulos, Anthony T ^b   Papakonstantinou, George ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b University of Texas at San Antonio   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; SYNCHRONIZATION;

DISTRIBUTED COMPUTING SYSTEMS; DYNAMIC SCHEDULING; FLOYD-STEINBERG ALGORITHM; LOAD BALANCING;

SCHEDULING;

EID: 33847097940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639308     Document Type: Conference Paper

References (31)

1. I. Banicescu and Z. Liu. Adaptive Factoring: A Dynamic Scheduling Method Tuned to the Rate of Weight Changes, Proc. of the High Performance Computing Symposium 2000, Washington, USA, 2000, pp. 122-129.
2. I. Banicescu, V. Velusamy and J. Devaprasad. On the Scalability of Dynamic Scheduling Scientific Applications with Adaptive Weighted Factoring, Cluster Computing 6, 2003, pp. 215-226.
3. J. Barbosa, J. Tavares and A. J. Padilha. Linear Algebra Algorithms in a Heterogeneous Cluster of Personal Computers, Proc. of the 9th Heterogeneous Computing Workshop (HCW 2000), Cancun, Mexico, 2000, pp. 147-159.
4. D.J. Hancock, J.M. Bull, R.W. Ford and T.L. Freeman. An Investigation of Feedback Guided Dynamic Scheduling of Nested Loops Proc. of the IEEE International Workshops on Parallel Processing, 21-24 Aug. 2000, ed. P. Sadayappan, pp. 315-321.
5. M. Cierniak, W. Li and M. J. Zaki. Loop Scheduling for Heterogeneity, Proc. of the 4th IEEE Intl. Symp. on High Performance Distributed Computing, Washington, DC, 1995, pp. 78-85.
6. A. T. Chronopoulos, R. Andonie, M. Benche and D. Grosu. A Class of Distributed Self-Scheduling Schemes for Heterogeneous Clusters, Proc. of the 3rd IEEE International Conference on Cluster Computing (CLUSTER 2001), Newport Beach, CA USA, 2001.
7. Y.W. Fann, C.T. Yang, S.S. Tseng and C.J. Tsai. An Intelligent Parallel Loop Scheduling for Parallelizing Compilers, Journal of Information Science and Engineering, 16:69-200, 2000.
8. G. Goumas, N. Drosinos, M. Athanasaki and N. Koziris. Compiling Tiled Iteration Spaces for Clusters, Proc. of the 4th IEEE International Conference on Cluster Computing (CLUSTER 2002), Chicago, IL USA, 2002, pp. 360-369.
9. S.F. Hummel, J. Schmidt, R.N. Uma and J. Wein. Load-Sharing in Heterogeneous Systems via Weighted Factoring, Proc. of 8th Annual Symp. on Parallel Algorithms and Architectures, Padua, Italy, 1996, pp. 318-328.
10. T.H. Kim and J.M. Purtilo. Load Balancing for Parallel Loops in Workstation Clusters, Proc. of Intl. Conference on Parallel Processing, Bloomingdale, IL USA, 3:182-190, 1996.
11. E.P. Markatos and T.J. LeBlanc. Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors, IEEE Transactions on Parallel and Distributed systems, 5(4):379-400, April 1994.
12. Peter Pachecho. Parallel Programming with MPI, Morgan Kauffman 1997.
13. T.H. Tzen and L.M. Ni. Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers, IEEE Trans. on Parallel and Distributed Systems, 4(1):87-98, Jan. 1993.
14. M. Wolfe. High Performance Compilers for Parallel Computing, Addison-Wesley Publication Co., 1996.
15. Y. Yan, C. Jin and X. Zhang. Adaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems, IEEE Trans. on Parallel and Distributed Systems, 8(1):70-81, Jan. 1997.
16. C.T. Yang and S.C. Chang. A Parallel Loop Self-Scheduling on Extremely Heterogeneous PC Clusters, Proc. of Intl Conf. on Computational Science, Melbourne, Australia and St. Petersburg, Russia, 2003, pp. 1079-1088.
17. R.W. Floyd and L. Steinberg. An adaptive algorithm for spatial grey scale. Proc. Soc. Inf. Display, 17:75-77, 1976.
18. N. Manjikian and T.S. Abdelrahman. Exploiting Wavefront Parallelism on Large-Scale Shared-Memory Multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 12(3):259-271, 2001.
19. T. Andronikos, F.M. Ciorba, P. Theodoropoulos, D. Kamenopoulos and G. Papakonstantinou. Code Generation for General Loops Using Methods from Computational Geometry. Proc. of the IASTED Parallel and Distributed Computing and Systems Conference (PCDS 2004), Cambrige, MA USA, November 9-11, 2004, pp. 348-353.
20. F.M. Ciorba, T. Andronikos, I. Drositis and G. Papakonstantinou. Reducing Communication via Chain Pattern Scheduling. In Proc. of the 4th IEEE International Symposium on Network Computing and Applications (IEEE NCA05), Cambridge, MA USA, July 27-29 2005, pp. 187-193.
21. M. Gonzalez, E. Ayugade, X. Martorell and J. Labarta. Defining and Supporting Pipelined Executions in OpenMP. Proc. of the Int'l Workshop on OpenMP Applications and Tools: OpenMP Shared Memory Parallel Programming (WOMPAT 2001), 2001, pp. 155-169.
22. M. Gonzalez, E. Ayugade, X. Martorell and J. Labarta. Exploting Pipelined Executions in OpenMP. Proc. of the Int'l Conference on Parallel Processing (ICPP 2003), 2003, pp. 153-160.
23. C.P. Kruskal and A. Weiss. Allocating independent subtasks on parallel processors. IEEE Trans. on Software Engineering, 11(10):1001-1016, 1985.
24. C.D. Polychronopoulos and D.J. Kuck. Guided self-scheduling: A practical self-scheduling scheme for parallel supercomputers. IEEE Trans. on Computer, C-36(12): 1425-1439, 1987.
25. F. Rastello, A. Rao and S. Pande. Optimal Task Scheduling to minimize Inter-Tile Latencies. Parallel Computing, 29(2): 209-239, 2003.
26. J. Xue. Loop Tiling for Parallelism. Kluwer Academic Publishers, August 2000 (280 pages).
27. P. Boulet, J. Dongarra, F. Rastello, Y. Robert and F. Vivien. Algorithmic Issues on Heterogeneous Computing Platforms. Parallel Processing Letters, 9(2): 197-213, 1998.
28. T. Thanalapati and S. Dandamudi. An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers. IEEE Transactions on Parallel and Distributed Systems, 12(7): 758-768, 2001.
29. Y.K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4): 406-471, 1999.
30. G. Goumas, A. Sotiropoulos and N. Koziris. Minimizing Completion Time for Loop Tiling with Computation and Communication Overlapping. Proc. of the 2001 International Parallel and Distributed Processing Symposium (IPDPS2001), IEEE Press, San Francisco, California, April 2001.
31. I. Riakiotakis and P. Tsanakas. Dynamic Scheduling of Nested Loops with Uniform Dependencies in Heterogeneous Networks of Workstations. Proc. of the 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'05) Las Vegas, NV, USA, 2005.