Space/time-efficient scheduling and execution of parallel irregular computations

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1195-1222

  Yang, Tao ^a,b   Fu, Cong ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

^c Mailstop SJ1 2 10   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

DIRECT REMOTE MEMORY ACCESS; PARALLEL IRREGULAR COMPUTATIONS; RUN TIME SUPPORT;

MULTIPROGRAMMING;

EID: 0032255043     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295660     Document Type: Article

References (38)

1. BLELLOCH, G. E., GIBBONS, P. B., AND MATIAS, Y. 1995. Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. In Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architectures. 1-12.
2. BLUMOFE, R., JOERG, C., KUSZMAUL, B., LEISERSON, C., RANDALL, K., AND ZHOU, Y. 1995. Cilk: An Efficient Multithreaded Runtime System. In Proceedings of the 5th ACM Symposium on Principles and Practice of Parallel Programming. 207-216.
3. CHAKRABARTI, S., DEMMEL, J., AND YELICK, K. 1995. Modeling the Benefits of Mixed Data and Task Parallelism. In Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architectures. 74-83.
4. CHONG, F. T., SHARMA, S. D., BREWER, E. A., AND SALTZ, J. 1995. Multiprocessor Runtime Support for Fine-Grained Irregular DAGs. In Toward Teraflop Computing and New Grand Challenge Applications., R. K. Kalia and P. Vashishta, Eds. Nova Science Publishers, New York.
5. COSNARD, M. AND LOI, M. 1995. Automatic Task Graph Generation Techniques. Parallel Processing Letters 5, 4 (Dec.), 527-538.
6. CYTRON, R., J. FERRANTE, ROSEN, B., WEGMAN, M., AND ZADECK, F. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13, 4, 451-490.
7. DARPA. 1998. DARPA PIs' Workshop on Performance Engineered Systems. http://www.cs.umd.edu/projects/hpsl/arpa/Aug19/DARPAworkshop.htm.
8. DAS, R., UYSAL, M., SALTZ, J., AND HWANG, Y.-S. 1994. Communication Optimizations for Irregular Scientific Computations on Distributed Memory Architectures. Journal of Parallel and Distributed Computing 22, 3 (Sept.), 462-479.
9. DONGARRA, J., CROZ, J. D., HAMMARLING, S., AND HANSON, R. 1988. An Extended Set of Basic Linear Algebra Subroutines. ACM Trans. on Mathematical Software 14, 18-32.
10. FINK, S., BADEN, S., AND KOHN, S. 1996. Flexible Communication Mechanismsfor Dynamic Structured Applications . In Lecture Notes in Computer Science No. 1117, Proc. of Irregular'96. 203-215.
11. FU, C. 1997. Scheduling and Run-time Support for Parallel Irregular Computations. Ph.D. thesis, Dept. of Computer Science, University of California at Santa Barbara.
12. FU, C. AND YANG, T. 1996A. Run-time Compilation for Parallel Sparse Matrix Computations. In Proceedings of the ACM International Conference on Supercomputing. Philadelphia, 237-244.
13. FU, C. AND YANG, T. 1996b. Sparse LU Factorization with Partial Pivoting on Distributed Memory Machines. In Proceedings of ACM/IEEE Conference on Supercomputing'96. Pittsburg.
14. FU, C. AND YANG, T. 1997. Run-time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures. Journal of Parallel and Distributed Computing 42, 143-156. Also as UCSB technical report TRCS97-03.
15. GEORGE, J. A. AND LIU, J. W. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall.
16. GERASOULIS, A., JIAO, J., AND YANG, T. 1995. Scheduling of Structured and Unstructured Computation . In Interconnections Networks and Mappings and Scheduling Parallel Computation, D. Hsu, A. Rosenberg, and D. Sotteau, Eds. American Math. Society, 139-172.
17. GIRKAR, M. AND POLYCHRONOPOULOS, C. 1992. Automatic Extraction of Functinal Parallelism from Ordinary Programs. IEEE Transactions on Parallel and Distributed Systems 3, 2, 166-178.
18. IBEL, M., SCHAUSER, K. E., SCHEIMAN, C. J., AND WEIS, M. 1996. Implementing Active Messages and Spilt-C for SCI Clusters and Some Achitectural Implications. In 6th International Workshop on SCI-based Low-cost/High-performance Computing.
19. JIAO, J. 1996. Software Support for Parallel Processing of Irregular and Dynamic Computations. Ph.D. thesis, Dept. of Computer Science, Rutgers University.
20. KARMARKAR, N. 1991. A New Parallel Architecture for Sparse Matrix Computation Based on Finite Project Geometries. In Proceedings of Supercomputing '91. 358-369.
21. KENNEDY, K. 1996. High Performance Fortran: Problems and Progress. Tech. rep., Center for Research on Parallel Computing, Newsletter, 4 (3). Summer.
22. LAIN, A. AND BANERJEE, P. 1994. Techniques to Overlap Computation and Communication in Irregular Iterative Applications. In Proceedings of the ACM International Conference on Supercomputing. 236-245.
23. LI, X. 1996. Sparse Gaussian Elimination on High Performance Computers. Ph.D. thesis, CS, UC Berkeley.
24. POLYCHRONOPOULOS, C. D. 1998. Parallel Programming and Compilers. Kluwer Academic Publishers.
25. RAMASWAMY, S., SAPATNEKAR, S., AND BANERJEE, J. 1994. A Convex Programming Approach for Exploiting Data and Functional Parallelism. In Proceedings of the International Conference on Parallel Processing. 116-125.
26. ROTHBERG, E. 1992. Exploiting the Memory Hierarchy in Sequential and Parallel Sparse Cholesky Factorization. Ph.D. thesis, Dept. of Computer Science, Stanford.
27. ROTHBERG, E. AND SCHREIBER, R. 1994. Improved Load Distribution in Parallel Sparse Cholesky Factorization. In Proceedings of ACM/IEEE Conference on Supercomputing. 783-792.
28. SARKAR, V. 1989. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press.
29. SCHAUSER, K. E. AND SCHEIMAN, C. J. 1995. Experience with Active Messages on the Meiko CS-2. In International Parallel Processing Symposium. 140-149.
30. SHEN, K., JIAO, X., AND YANG, T. 1998. Elimination Forest Guided 2D Sparse LU Factorization. In proceedings of the ACM Symposium on Parallel Algorithms and Architectures. 5-15.
31. STRICKER, T., STICHNOTH, J., O'HALLARON, D., HINRICHS, S., AND GROSS, T. 1995. Decoupling Synchronization and Data Transfer in Message Passing Systems of Parallel Computers. In Proceedings of the ACM International Conference on Supercomputing. 1-10.
32. TANG, H. 1998. Personal Communication.
33. VON EICKEN, T., CULLER, D. E., GOLDSTEIN, S. C., AND SCHAUSER, K. E. 1992. Active Messages: a Mechanism for Integrated Communication and Computation. In Proceedings of the 19th International Symposium on Computer Architecture. Gold Coast, Australia.
34. WEN, C.-P., CHAKRABARTI, S., DEPRIT, E., KRISHNAMURTHY, A., AND YELICK, K. 1995. Runtime Support for Portable Distributed Data Structures. Languages, Compilers, and Runtime Systems for Scalable Computers. Kluwer Academic Publishers, Chapter 9.
35. WOLSKI, R. AND FEO, J. 1993. Program Parititoning for NUMA Multiprocessor Computer Systems. Journal of Parallel and Distributed Computing.
36. YANG, T. 1993. Scheduling and Code Generation for Parallel Architectures. Ph.D. thesis, Dept. of Computer Science, Rutgers University, New Brunswick.
37. YANG, T. AND GERASOULIS, A. 1992. List Scheduling with and without Communication Delays. Parallel Computing 19, 1321-1344.
38. YANG, T. AND GERASOULIS, A. 1994. DSC: Scheduling Parallel Tasks on An Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems 5, 9, 951-967. A short version is in Proceedings of Supercomputing'91.