Load balancing highly irregular computations with the adaptive factoring

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 87-98

  Banicescu, I ^a   Velusamy, V ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (33)

1. I. Banicescu and S. F. Hummel. Balancing Processor Loads and Exploiting Data Locality in N-Body Simulations. In Proceedings of Supercomputing'95 Conference, 1995.
2. I. Banicescu and Z. Liu. Adaptive Factoring: A Dynamic Scheduling Method Tuned to the Rate of Weight Changes. In Proceedings of the High Performance Computing Symposium (HPC 2000), pages 122-129, 2000.
3. I. Banicescu and R. Lu. Experiences with Fractiling in N-Body Simulations. In Proceedings of High Performance Computing'98 Symposium, pages 121-126, 1998.
4. I. Banicescu and V. Velusamy. Performance of Scheduling Scientific Applications with Adaptive Weighted Factoring. In Proceedings of the IEEE - International Parallel and Distributed Processing Symposium (IPDPS 2001) - Heterogenous Computing Workshop, on CD-ROM, April 2001.
5. R. Biswas, S. Das, D. Harvey, and L.Oliker. Portable Parallel Programming for Dynamic Load Balancing of Unstructured Grid Applications. In Proceedings of 13th International Parallel Processing Symposium, April 1999.
6. R. Biswas and L. Oliker. Load Balancing Unstructured Adaptive Grids for CFD Problems. Proc. 8th SIAM Conference on Parallel Processing for Scientific Computing, 1997.
7. R. D. Blumofe and C. E. Leiserson. Scheduling Multithreaded Computations by Work Stealing. In Proceedings of Symposium on Foundations of Computer Science, pages 356-368, November 1994.
8. T. Casavant and J. Kuh. A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. IEEE Trans. Software Eng SE-14(2), pages 141-154, Feb. 1988.
9. J. Chen and V. Taylor. Mesh Partitioning for Distributed Systems: Exploring Optimal Number of Partitions with Local and Remote Communication. In Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
10. D. L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptive Load Sharing in Homogeneous Distributed Systems. IEEE Trans. Software Eng SE-12(5), pages 662-675, May 1996.
11. L. E. Flynn and S. F. Hummel. The mathematical foundations of the factoring scheduling method. Technical Report IBM Research Report RC18462, IBM, Oct 1992.
12. S. F. Hummel, J. Schmidt, R. N. Uma, and J. Wein. Load-Sharing in Heterogeneous Systems via Weighted Factoring. In Proceedings of Symposium on Parallel Algorithms and Architectures, pages 318-328, 1996.
13. S. F. Hummel and E. Schonberg. Low-overhead Scheduling of Nested Parallelism. IBM Journal of Research and Development 35(3/6), pages 743-765, Sept/Nov 1991.
14. S. F. Hummel, E. Schonberg, and L. E. Flynn. A Practical and Robust Method for Scheduling Parallel Loops. 1991 Supercomputing Conference, pages 610-619, November 1991.
15. S. F. Hummel, E. Schonberg, and L. E. Flynn. Factoring: A Method for Scheduling Parallel Loops. Communications of the ACM, 35(8):90-101, Aug. 1992.
16. C. Kruskal and A. Weiss. Allocating Independent Subtasks on Parallel Processors. IEEE Trans. Software Eng SE-11(10), pages 1001-1016, Oct. 1985.
17. E. Luke, I. Banicescu, and J. Li. The Optimal Effectiveness Metric for Parallel Application Analysis. Information Processing Letters, 66(5):223-229, June 1998.
18. B. Maerten, D. Roose, A. Basermann, and J. Fingberg. DRAMA: A Library for Parallel Dynamic Load Balancing of Finite Element Applications. In Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
19. E. P. Markatos and T. J. LeBlanc. Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors. Proceedings of Supercomputing '92, pages 104-113, Nov. 1992.
20. L. Oliker and R. Biswas. Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations. In Symposium on Parallel Algorithms and Architectures (SPAA'97), pages 33-42, 1997.
21. C. Polychronopoulos. Loop Coalescing: A Compiler Transformation for Parallel Machines. Proc. ICPP, pages 235-242, 1987.
22. C. Polychronopoulos and D. Kuck. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Trans on Computers C-36(12), pages 1425-1439, Dec. 1987.
23. C. Polychronopoulos, D. J. Kuck, and D. A. Padua. Optimal Processor Allocation to Nested Parallel Loops. Proceedings of the 1986 International Conference on Parallel Processing, pages 519-527, Aug. 1986.
24. C. Polychronopoulos, D. J. Kuck, and D. A. Padua. Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds. IEEE Trans. Computer., C-36, Apr. 1987.
25. L. Rudolph, M. Slivkin-Allalouf, and E. Upfal. A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. In Proceedings of Symposium on Parallel Algorithms and Architectures, pages 237-245, 1991.
26. K. Schloegel, G. Karypis, and V. Kumar. Dynamic Repartitioning of Adaptively Refined Meshes. In Proceedings of Supercomputing '98, November 1998.
27. N. G. Shivaratri, P. Krueger, and M. Singhal. Load Distributing for Locally Distributed Systems. IEEE Computer, pages 33-45, Dec. 1992.
28. J. Singh. Parallel Hierarchical N-body Methods and their Implications for Multiprocessors. PhD thesis, Stanford University, 1993.
29. A. Sohn and H. Simon. S-HARP: A Scalable Paralel Dynamic Partitioner for Adaptive Mesh-based Computations. In Proceedings of Supercomputing '98, November 1998.
30. T. H. Tzen and L. M. Ni. Dynamic Loop Scheduling for Shared-Memory Multiprocessors. Proc. Int. Conf. on Parallel Processing, pages 247-250, Vol. II 1991.
31. T. H. Tzen and L. M. Ni. Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Computers. IEEE Trans. Parallel Distributed Syst., 4:87-98, Jan. 1993.
32. Y. T. Wang and R. Morris. Load Sharing in Distributed Systems. IEEE Transactions on Computers, C-34(3):204-217, Mar. 1985.
33. M. Warren and J. Salmon. A Parallel Hashed Oct Tree N-body Algorithm. In Proceeding of Supercomputing'93, pages 12-21. IEEE Computer Society, 1993.