Performance of scheduling scientific applications with adaptive weighted factoring

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 791-801

  Banicescu, I ^a   Velusamy, V ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORK MANAGEMENT; SCHEDULING;

COMPUTATIONAL FIELD SIMULATIONS; DYNAMIC LOOP SCHEDULING; DYNAMIC SCHEDULING ALGORITHMS; HETEROGENEOUS ENVIRONMENTS; N-BODY SIMULATION; PERFORMANCE DEGRADATION; SCHEDULING TECHNIQUES; SCIENTIFIC APPLICATIONS;

SCHEDULING ALGORITHMS;

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

References (35)

1. C. Anderson. An Implementation of the Fast Multipole Method Without Multipoles. SIAM J. Sci. Stat. Comput., 13(4):923-947, July 1992.
2. A. W. Appel. An Efficient program for Many-Body Simulations. SIAM Journal of computing, 6, 1985.
3. I. Banicescu and S. F. Hummel. Balancing Processor Loads and Exploiting Data Locality in N-Body Simulations. In Proceedings of Supercomputing'95 Conference, 1995.
4. I. Banicescu and R. Lu. Experiences with Fractiling in N-Body Simulations. In Proceedings of High Performance Computing'98 Symposium, pages 121-126, 1998.
5. I. Banicescu, P. Soni, S. Ghafoor, and V. Velusamy. Effectiveness of Adaptive Weighted Factoring in Computaional Field Simulation on Unstructured Grids. In Proceedings of the High Performance Computing Symposium (HPC 2000), pages 168-177, 2000.
6. I. Banicescu, V. Velusamy, and S. Ghafoor. Dynamic Load Balancing with Adaptive Weighted Factoring in Computaional Field Simulation Applications. In Proceedings of the Twelfth International Conference on Parallel and Distributed Computing and Systems, pages 352-359, 2000.
7. J. Barnes and P. Hutt. A Hierarchical O(Nlog(N)) Force Calculation Algorithm. Nature, 324, 1986.
8. 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.
9. R. Biswas and L. Oliker. Load Balancing Unstructured Adaptive Grids for CFD Problems. Proc. 8th SIAM Conference on Parallel Processing for Scientific Computing, 1997.
10. 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.
11. R. Diekmann, D. Meyer, and B. Monien. Parallel Decomposition of Unstructured FEM-Meshes. Concurrency: Practice and Experience, 10(1):53-72, 1995.
12. A. Y. Grama, V. Kumar, and A. Sameh. Scalabel Parallel Formulations of Barnes-Hut Method for N-Body Simulations. In Proc. of Supercomputing'94, pages 439-448, November 1994.
13. L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. ACM Press, 1987.
14. L. Greengard and W. Gropp. A Parallel Version of the Fast Multipole Algorithm. Scientific Computing, pages 213-222, 1987.
15. B. Hendrickson and R. Leland. An Improved Spectral Graph Partitioining Algorithm for Mapping Parallel Computations. SIAM J. of Sci. Comput, pages 452-469, 1995.
16. Y. Hu and S. L. Johnsson. Implementing O(N) N-body Algorithms Efficiently in Parallel Languages. Journal of Scientific Programming, 5(4):337-364, 1996.
17. 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.
18. 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.
19. C. Kruskal and A. Weiss. Allocating Independent Subtasks on Parallel Processors. IEEE Trans. Software Eng SE- 11(10), pages 1001-1016, Oct. 1985.
20. J. F. Leathrum Jr. Parallelization of the Fast Multipole Algorithm: Algorithm and Architecture Design. PhD thesis, Duke University, 1992.
21. E. Luke, I. Banicescu, and J. Li. The Optimal Effectiveness Metric for Parallel Application Analysis. Information Processing Letters, 66(5):223-229, June 1998.
22. 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.
23. 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.
24. B. Monien and R. Diekmann. A Local Graph Partitioning Heuristic Meeting Bisection Bounds. 8th SIAM Conf. on Parallel Processing for Scientific Computing (PP'97), 1997.
25. 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.
26. 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.
27. J. Savage and M. Wloka. Parallelism in Graph Partitioning. J. Par. Dist. Comput., pages 257-272, 1991.
28. K. Schloegel, G. Karypis, and V. Kumar. Dynamic Repartitioning of Adaptively Refined Meshes. In Proceedings of Supercomputing '98, November 1998.
29. H. Simon. Partitioning of Unstructured Problems for Parallel Processing. Computing Systems in Engineering, 1991.
30. J. Singh. Parallel Hierarchical N-body Methods and their Implications for Multiprocessors. PhD thesis, Stanford University, 1993.
31. J. Singh, J. Hennessy, and A. Gupta. Scaling Parallel Programs for Multiprocessors: Methodology and Examples. Computer, pages 42-50, July 1993.
32. A. Sohn and H. Simon. S-HARP: A Scalable Paralel Dynamic Partitioner for Adaptive Mesh-based Computations. In Proceedings of Supercomputing '98, November 1998.
33. 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.
34. 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.
35. 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.