Scaling Irregular Parallel Codes with Minimal Programming Effort

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2001, Pages 16-

  Nikolopoulos, Dimitrios S ^a   Polychronopoulos, Constantine D ^a   Ayguadé, Eduard ^b  

^a United States of America   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMMING INTERFACES (API); CODES (SYMBOLS); PARALLEL PROGRAMMING;

APPLICATIONS DOMAINS; DATA DISTRIBUTION; DATA LOAD; DOMAIN SPECIFIC; IRREGULAR APPLICATIONS; LOAD-BALANCING ALGORITHM; PARALLEL APPLICATION; PARALLEL CODE; PARALLEL-PROGRAMMING MODELS; SCALINGS;

MESSAGE PASSING;

EID: 0348057076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/582034.582050     Document Type: Conference Paper

References (20)

1. S. Benkner, P. Mehrotra, J. Van Rosendale, and H. Zima. High-Level Management of Communication Schedules in HPF-like Languages. In Proc. of the 12th ACM International Conference on Supercomputing (ICS'98), pages 109-116, Melbourne, Australia, July 1998.
2. HPF+Project Consortium. HPF+: Optimizing HPF for Advanced Applications. Deliverable 1. 2c, Final Evaluation Report. http://www. par. univie. ac. at/project/hpf+, April 1998.
3. M. Hall and M. Martonosi. Adaptive Parallelism in Compiler-Parallelized Code. In Proc. of the Second SUIF Compiler Workshop, Stanford, California, August 1997.
4. D. Henty. Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling. In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.
5. J. Hoeflinger, P. Alavilli, T. Jackson, and B. Kuhn. Producing Scalable Performance with OpenMP: Experiments with two CFD Applications. Parallel Computing, 27 (4): 391-413, April 2001.
6. Y. Charlie Hu, A. Cox, and W. Zwaenepoel. Improving Fine-Grain Irregular Shared-Memory Benchmarks by Data Reordering. In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.
7. S. Ioannidis and S. Dwarkadas. Compiler and Runtime Support for Adaptive Load Balancing in Software Distributed Shared Memory Systems. In Proc. of the 4th ACM SIGPLAN Workshop on Languages, Compilers and Runtime Systems for Parallel Computers (LCR'98), pages 107-122, Pittsburgh, Philadelphia, May 1998.
8. A. Itskovitz, A. Schuster, and L. Shalev. Thread Scheduling in Distributed Shared Memory Systems. The Journal of Systems and Software, 42 (1): 71-87, January 1998.
9. P. Keleher, A. Cox, and W. Zwaenepoel. Lazy Release Consistency for Software Distributed Shared Memory. In Proc. of the 19th International Symposium on Computer Architecture (ISCA'92), pages 13-21, Queensland, Australia, May 1992.
10. J. Labarta, E. Ayguadé, J. Oliver, and D. Henty. New OpenMP Directives for Irregular Data Access Loops. In Proc. of the Second European Workshop on OpenMP, Edinburgh, Scotland, September 2000.
11. D. Lowenthal and G. Andrews. An Adaptive Approach to Data Placement. In Proc. of the 10th International Parallel Processing Symposium (IPPS'96), Honolulu, Hawaii, April 1996.
12. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving Memory Hierarchy Performance for Irregular Applications. In Proc. of the 13th ACM International Conference on Supercomputing (ICS'99), pages 425-433, Rhodes, Greece, 1999.
13. D. Nikolopoulos, E. Ayguadé, J. Labarta, T. Papatheodorou, and C. Polychronopoulos. The Trade-Off between Implicit and Explicit Data Distribution in Shared-Memory Programming Paradigms. In Proc. of the 15th ACM International Conference on Supercomputing (ICS'2001), pages 23-37, Sorrento, Italy, June 2001.
14. D. Nikolopoulos, T. Papatheodorou, C. Polychronopoulos, J. Labarta, and E. Ayguadé. A Case for User-Level Dynamic Page Migration. In Proc. of the 14th ACM International Conference on Supercomputing (ICS'2000), pages 119-130, Santa Fe, New Mexico, May 2000.
15. D. Nikolopoulos, T. Papatheodorou, C. Polychronopoulos, J. Labarta, and E. Ayguadé. Is Data Distribution Necessary in OpenMP? In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.
16. L. Oliker and R. Biswas. Parallelization of a Dynamic Unstructured Application using Three Leading Paradigms. In Proc. of the IEEE/ACM Supercomputing'99: High Performance Networking and Computing Conference (SC'99), Portland, Oregon, November 1999.
17. U. Rencuzogullari and S. Dwarkadas. Dynamic Adaptation to Available Resource for Parallel Computing on an Autonomous Network of Workstations. In Proc. of the 8th ACM Symposium on Principles and Practice of Parallel Programming (PPoPP'01), Snowbird, Utah, June 2001.
18. J. Saltz, R. Mirchandaney, and D. Baxter. Runtime Parallelization and Scheduling of Loops. In Proc. of the 1st ACM Symposium on Parallel Algorithms and Architectures, pages 303-312, Santa Fe, New Mexico, June 1989.
19. H. Shan, J. P. Singh, R. Biswas, and L. Oliker. A Comparison of Three Programming Models for Adaptive Applications on the Origin2000. In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.
20. P. White. IFS Documentation: Part VI, Technical and Computational Procedures. Technical Report CY21R4, European Center for Medium-Range Forecasts, February 2000.