Run-time techniques for exploiting irregular task parallelism on distributed memory Architectures

Journal of Parallel and Distributed Computing

Volumn 42, Issue 2, 1997, Pages 143-156

  Fu, Cong ^a   Yang, Tao ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031139107     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1319     Document Type: Article

References (30)

1. Amza C., Cox A., Dwarkadas S., Keleher P., Lu H., Rajamony R., Yu W., Zwaenepoel W. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer. 29:Feb. 1996;18-28.
2. Ashcraft C., Grimes R. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Software. 15:1989;291-309.
3. R. Blumfoe, M. Frigo, C. Joerg, C. Leiserson, K. Randall, Apr. 1996, Dag-consistent distributed shared memory, Proceeding of 10th International Parallel Processing Symposium, 132, 141.
4. E. Brewer, F. Chong, L. Liu, S. Sharma, J. Kubiatowicz, 1995, Remote queues: Exposing message queues for optimization and atomicity, 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 42, 53.
5. W. Cai, 1995.
6. Chong F. T., Sharma S. D., Brewer E. A., Saltz J. Multiprocessor runtime support for fine-grained irregular DAGs. Parallel Process. Lett. 5:Dec. 1995.
7. R. Cytron, J. Ferrante, Feb. 1987, What's in a name? The value of renaming for parallelism detection and storage allocation, Proc. of Inter. Conf. on Parallel Processing, 19, 27.
8. Das R., Uysal M., Saltz J., Hwang Y.-S. Communication optimizations for irregular scientific computations on distributed memory architectures. J. Parallel Distrib. Comput. 22:Sept. 1994;462-479.
9. C. Fu, T. Yang, May 1996, Run-time compilation for parallel sparse matrix computations, Proceedings of International Conference on Supercomputing, 237, 244, Philadelphia.
10. C. Fu, T. Yang, Nov. 1996, Sparse LU factorization with partial pivoting on distributed memory machines, Proceedings of Supercomputing'96, Pittsburgh.
11. Geist G. A., Ng E. Task scheduling for parallel sparse Cholesky factorization. Internat. J. Parallel Programming. 18:1989;291-314.
12. Gerasoulis A., Jiao J., Yang T. Scheduling of structured and unstructured computation. Interconnections Networks and Mappings and Scheduling Parallel Computation. 1995;Am. Math. Soc. Providence.
13. Golub G., Ortega J. M. Scientific Computing: An Introduction with Parallel Computing Compilers. 1993;Academic Press, San Diego.
14. Heath M., Ng E., Peyton B. Parallel algorithms for sparse linear systems. SIAM Rev. 33:Sept. 1991;420-460.
15. N. Karmarkar, Feb. 1991, A new parallel architecture for sparse matrix computation based on finite project geometries, Proc. of Supercomputing '91, 358, 369.
16. A. Lain, P. Banerjee, July 1994, Techniques to overlap computation and communication in irregular iterative applications, Proc. of ACM Inter. Conf. on Supercomputing, 236, 245.
17. Pande S., Agrawal D. P., Mauney J. A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems. IEEE Trans. Parallel Distrib. Systems. 6:Apr. 1995;388-399.
18. Peyret R., Taylor T. Computational Methods for Fluid Flow. 1983;Springer-Verlag, Berlin/New York.
19. E. Rothberg, Dec. 1992, Exploiting the Memory Hierarchy in Sequential and Parallel Sparse Cholesky Factorization, Dept. of Computer Science, Stanford.
20. E. Rothberg, R. Schreiber, Nov. 1994, Improved load distribution in parallel sparse Cholesky factorization, Proc. of Supercomputing'94, 783, 792.
21. Sarkar V. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. 1989;MIT Press, Cambridge.
22. K. E. Schauser, C. J. Scheiman, 1995, Experience with active messages on the Meiko CS-2, International Parallel Processing Symposium, 140, 149.
23. Schreiber R. George A., Gilbert J. R., Liu J. W. H. Scalability of Sparse Direct Solvers. Graph Theory and Sparse Matrix Computation. 56:1993;191-209 Springer-Verlag, New York.
24. Shu W., Kale L. Chare kernel - A runtime support system for parallel computations. J. Parallel Distrib. Comput. 11:Mar. 1991;198-211.
25. S. Venugopal, V. Naik, J. Saltz, Nov. 1992, Performance of distributed sparse Cholesky factorization with pre-scheduling, Proc. of Supercomputing'92, 52, 61, Minneapolis.
26. T. von Eicken, D. E. Culler, S. C. Goldstein, K. E. Schauser, May 1992, Active messages: A mechanism for integrated communication and computation, Proc. of the 19th Int'l Symposium on Computer Architecture, Gold Coast, Australia.
27. Wen C.-P., Chakrabarti S., Deprit E., Krishnamurthy A., Yelick K. Runtime Support for Portable Distributed Data Structures. Languages, Compilers, and Runtime Systems for Scalable Computers. May 1995;Kluwer Academic Publishers, Dordrecht/Norwell.
28. Wu M. Y., Gajski D. Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Systems. 1:1990;330-343.
29. T. Yang, May 1993, Scheduling and Code Generation for Parallel Architectures, Dept. of Computer Science, Rutgers University, New Brunswick.
30. T. Yang, A. Gerasoulis, 1992, PYRROS: Static task scheduling and code generation for message-passing multiprocessors, Proc. of 6th ACM International Conference on Supercomputing, 428, 437.