An efficient load balancing scheme for grid-based high performance scientific computing

ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing

Volumn 2005, Issue , 2005, Pages 217-225

  Kejariwal, Arun ^a   Nicolau, Alexandru ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL SCIENCES COMPUTING; PARALLEL PROCESSING SYSTEMS; PROTEIN FOLDING; STORAGE ALLOCATION (COMPUTER); SYNTHESIS (CHEMICAL);

COMPUTATIONAL GRIDS; HIGH PERFORMANCE COMPUTING (HPC); PROCESSOR UTILIZATION; PROGRAM PARALLELISM;

GRID COMPUTING;

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

References (50)

1. Grid computing, http://www.gridcomputing.com.
2. IBM Grid computing. http://www-1.ibm.com/grid/.
3. Matlab. http://www.mathworks.com.
4. The NCAR Community Climate Model (CCM3). http://www.cgd.ucar.edu/cms/ ccm3/source.shtml.
5. NSF tera-grid. http://www.teraGrid.org.
6. The Grid: Blueprint for a future computing infrastructure. Morgan Kaufmann Publishers, San Francisco, CA, 1999.
7. R. J. Allan, J. Brooke, F. Costen, and M. Westhead. Grid-based high performance computing. Technical report, Computational Science and Engineering Department, Daresbury, WA, UK, May 2000.
8. M. Baker, R. Buyya, and D. Laforenza. Grids and grid technologies for wide-area distributed computing. Software - Practice and Experience, 32(15): 1437-1466, Dec. 2002.
9. U. Banerjee. Data dependence in ordinary programs. Master's thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Nov. 1976. Report No. 76-837.
10. U. Banerjee. Loop Transformation for Restructuring Compilers. Kluwer Academic Publishers, Boston, MA, 1993.
11. F. Berman and R. Wolski. The AppLeS project: A status report. In Proceedings of the 8th NEC Research Symposium, May 1997.
12. M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, Palo Alto, CA, June 1986.
13. B. Butte. Solving the data warehouse dilemma with grid technology. Technical report, IBM Global Services, Aug. 2004.
14. S. Carr. Memory-Hierarchy Management. PhD thesis, Dept. of Computer Science, Rice University, Sept. 1992.
15. T. L. Casavant and J. G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 14(2): 141-154, Feb. 1988.
16. P. Clauss. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs. In Proceedings of the 10th ACM International Conference on Supercomputing, pages 278-285, 1996.
17. R. Cytron. Doacross: Beyond vectorization for multiprocessors. In Proceedings of the 1986 International Conference on Parallel Processing, St. Charles, IL, Aug. 1986.
18. J. Davies. Parallelloop constructs for multiprocessors. Technical Report 81-1070, Department of Computer Science, University of Illinois at Urbana-Champaign, May 1981.
19. E. H. D'Hollander. Partitioning and labeling of loops by unimodular transformations. IEEE Transactions on Parallel and Distributed Systems, 3(4):465-476, 1992.
20. J. Gehring and A. Reinefeld. MARS - A framework for minimizing the job execution time in a metacomputing environment. Future Generation Computer Systems, 12(1):87-99, May 1996.
21. A. S. Grimshaw and W. A. Wulf. The Legion vision of a worldwide virtual computer. Communications of the ACM, 40(1):39-45, Jan. 1997.
22. M. Haghighat and C. Polychronopoulos. Symbolic program analysis and optimization for parallelizing compilers. In Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven, CT, Aug. 1992.
23. M. R. Haghighat and C. D. Polychronopoulos. Symbolic analysis for parallelizing compilers. ACM Transactions on Programming Languages and Systems, 18(4):477-518, July 1996.
24. E. Huedo, R. S. Montero, and I. M. Llorente. A framework for adaptive execution in grids. Software - Practice & Experience, 34(7):631-651, 2004.
25. F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of the Fifteenth Annual ACM Symposium on the Principles of Programming Languages, San Diego, CA, Jan. 1988.
26. M. Iyengar, S. Jain, and R. Jain. Numerical Methods for Scientific and Engineering Computation. John Wiley and Sons, 1985.
27. A. Kejariwal, P. D'Alberto, A. Nicolau, and C. D. Polychronopoulos. A geometric approach for partitioning N-dimensional non-rectangular iteration spaces. In Proceedings of the 17th International Workshop on Languages and Compilers for Parallel Computing, West Lafayette, IN, 2004.
28. A. Kejariwal, A. Nicolau, U. Banerjee, and C. D. Polychronopoulos. A novel approach for partitioning iteration spaces with variable densities. In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Chicago, IL, 2005.
29. C. P. Kruskal and A. Weiss. Allocating independent subtasks on parallel processors. IEEE Transactions on Software Engineering, 11(10):1001-1016, 1985.
30. D. Kuck, A. H. Sameh, R. Cytron, A. Veidenbaum, C. D. Polychronopoulos, G. Lee, T. McDaniel, B. R. Leasure, C. Beckman, J. R. B. Davies, and C. P. Kruskal. The effects of program restructuring, algorithm change and architecture choice on program performance. In Proceedings of the 1984 International Conference on Parallel Processing, pages 129-138, Aug. 1984.
31. LAMMPS. http://www.cs.sandia.gov/~sjplimp/lammps.html.
32. Y. Li and M. Mascagni. Analysis of large-scale grid-based Monte Carlo applications. International Journal of High Performance Computing Applications, 17:369-382, 2003.
33. S. Lundstrom and G. Barnes. A controllable MIMD architectures. In Proceedings of the 1980 International Conference on Parallel Processing, St. Charles, IL, Aug. 1980.
34. M. O'Boyle and G. A. Hedayat. Load balancing of parallel affine loops by unimodular transformations. Technical Report UMCS-92-1-1, Department of Computer Science, University of Manchester, Jan. 1992.
35. D. A. Padua. Multiprocessors: Discussion of theoritical and practical problems. Technical Report 79-990, Department of Computer Science, University of Illinois at Urbana-Champaign, Nov. 1979.
36. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184-1201, Dec. 1986.
37. C. Polychronopoulos. Loop coalescing: A compiler transformation for parallel machines. In Proceedings of the 1987 International Conference on Parallel Processing, pages 235-242, Aug. 1987.
38. C. Polychronopoulos, D. J. Kuck, and D. A. Padua. Execution of parallel loops on parallel processor systems. In Proceedings of the 1986 International Conference on Parallel Processing, pages 519-527, Aug. 1986.
39. W. Pugh. The Omega test: A fast and practical integer programming algorithm for dependence analysis. In Proceedings of Supercomputing '91, Albuquerque, NM, Nov. 1991.
40. R. Sakellariou. On the Quest for Perfect Load Balance in Loop-Based Parallel Computations. PhD thesis, Department of Computer Science, University of Manchester, Oct. 1996.
41. K. Saqabi, S. Otto, and J. Walpole. Gang scheduling in heterogeneous distributed systems. Technical report, OGI, 1994.
42. S.S. Vadhiyar and J. J. Dongarra. A metascheduler for the grid. In Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, pages 343-351, 2002.
43. C. A. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Massachusetts Institute of Technology, 1995.
44. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the First USENIX Symposium on Operating System Design and Implementation, Nov. 1994.
45. J. Weissman. Scheduling Parallel Computations in a Heterogeneous Environment. PhD thesis, University of Virginia, Aug. 1995.
46. J. B. Weissman. The interference paradigm for network job scheduling. Technical Report 96-4, Department of Computer Science, The University of Texas at San Antonio, 1996.
47. E. W. Weisstein. Abel's impossibility theorem, from mathworld-a wolfram web resource, http://mathworld.wolfram.com/AbelsImpossibilityTheorem.html.
48. M. J. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, MA, 1989.
49. Y. Wu and T. Lewis. Parallel processor balance through loop spreading. In Proceedings of the 3rd ACM International Conference on Supercomputing, pages 665-674, Reno, NV, 1989.
50. S. Zhou, X. Zheng, J. Wang, and P. Delisle. Utopia: a load sharing facility for large, heterogeneous distributed computer systems. Software - Practice & Experience, 23(12): 1305-1336, Dec. 1993.