Models and scheduling algorithms for mixed data and task parallel programs

Journal of Parallel and Distributed Computing

Volumn 47, Issue 2, 1997, Pages 168-184

  Chakrabarti, Soumen ^a   Demmel, James ^a,b   Yelick, Katherine ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (45)

1. R. Arpaci, D. Culler, A. Krishnamurthy, S. Steinberg, K. Yelick, 1995, Empirical evaluation of the CRAY-T3D: A compiler perspective, International Symposium on Computer Architecture, ACM SIGARCH.
2. Baden S. B. Programming abstractions for dynamically partitioning and coordinating localized scientific calculations running on multiprocessors. SIAM J. Sci. Statist. Comput. 12:1991;145-157.
3. Z. Bai, J. Demmel, 1993, Design of a parallel nonsymmetric eigenroutine toolbox, Part I, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM.
4. C. Bischof, S. Huss-Lederman, X. Sun, A. Tsao, T. Turnbull, May 1994, Parallel performance of a symmetric eigensolver based on the invariant subspace decomposition approach, Scalable High Performance Computing Conference, Knoxville, TN, 32, 39, IEEE Press, New York.
5. L. S. Blackford, J. Choi, A. Cleary, J. Demmel, I. Dhillon, J. J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. W. Walker, R. C. Whaley, Scalapack: A portable linear algebra library for distributed memory computers - Design issues and performance, Proceedings of Supercomputing '96.
6. Blelloch G. E., Chatterjee S., Hardwick J. C., Sipelstein J., Zagha M. Implementation of a portable nested data-parallel language. J. Parallel Distrib. Comput. 21:1994;4-14.
7. Blumwofe R., Leiserson C. Scheduling multithreaded computations by work stealing. Foundations of Computer Science (FOCS), Santa Fe, NM. November 1994;IEEE Press, New York.
8. S. Chakrabarti, S. Muthukrishnan, June 1996, Resource scheduling for parallel database and scientific applications, Symposium on Parallel Algorithms and Architectures (SPAA), Italy, Assoc. Comput. Mach. New York.
9. C. Chekuri, W. Hasan, R. Motwani, 1995, Scheduling problems in parallel query optimization, ACM Symposium on Principles of Database Systems.
10. Choi J., Dongarra J., Ostrouchov S., Petitet A., Walker D., Whaley R. C. A proposal for a set of parallel basic linear algebra subprograms. Computer Science Dept. Technical Report. CS-95-292:May 1995.
11. Cuppen J. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36:1981;177-195.
12. J. Demmel, K. Stanley, 1994, The performance of finding eigenvalues and eigenvectors of dense symmetric matrices on distributed memory computers, Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia.
13. Desprez F., Tourancheau B., Dongarra J. J. Performance complexity ofLU. Technical report. [LAPACK Working Note 67]:Feb. 1994.
14. Dongarra J., Hempel R., Hay A., Walker D. A proposal for a user-level message passing interface in a distributed memory environment. Technical Report. ORNL/TM-12231:February 1993.
15. J. Dongarra, R. van de Geijn, D. Walker, April 1992, A look at scalable dense linear algebra libraries, Scalable High-Performance Computing Conference, IEEE Comput. Soc. Los Alamitos, CA.
16. Fortran 90.
17. Forum H. P. F. High performance Fortran language specification, version 1.0. Technical Report. CRPC-TR92225:May 1993.
18. I. Foster, M. Xu, B. Avalani, A. Chowdhary, 1994, A compilation system that integrates high performance Fortran and Fortran M, Scalable High Performance Computing Conference, 293, 300, IEEE, New York.
19. Garey M. R., Graham R. L. Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4:1975;187-200.
20. George A., Liu J. Computer Solution of Large Sparse Positive Definite Systems. 1981;Prentice-Hall, Englewood Cliffs.
21. Gerasoulis A., Yang T. On the granularity and clustering of directed acyclic task graphs. IEEE Trans. Parallel Distrib. Syst. 4:1993;686-701.
22. Gilbert J., Tarjan R. The analysis of a nested dissection algorithm. Numer. Math. 50:1987;377-404.
23. Graham R. L. Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math. 17:1969;416-429.
24. High Performance Fortran Forum, High performance Fortran language specification version 1.0, Draft, Jan. 1993.
25. Hiranandani S., Kennedy K., Tseng C. Compiling Fortran D for MIMD distributed-memory machines. Comm. Assoc. Comput. Mach. 35:1992;66-80.
26. Hu Y. C., Johnson S. L., Teng S.-H. High performance Fortran for highly unstructured problems. Principles and Practice of Parallel Programming (PPoPP). 1997.
27. Johnsson S. L. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distrib. Comput. 4:1987.
28. X. Li, H. Huang, May 1993, On the concurrency of C++, Proceedings ICCI'93. Fifth International Conference on Computing and Information, 215, 219, Ontario, Canada.
29. Liu J. W. H. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Rev. 34:1992;82-109.
30. W. Ludwig, P. Tiwari, 1994, Scheduling malleable and nonmalleable parallel tasks, Symposium on Discrete Algorithms (SODA), 167, 176, ACM-SIAM, New York.
31. Luna S. Implementing an efficient portable global memory layer on distributed memory multiprocessors. Technical Report. UCB/CSD-94-810:May 1994.
32. Mechoso C. R., Ma C.-C., Farrara J., Spahr J. A., Moore R. W. Parallelization and distribution of a coupled atmosphere-ocean general circulation model. Monthly Weather Rev. 121:1993;2062-2076.
33. Papadimitriou C. H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19:1990;322-328.
34. S. Ramaswamy, S. Sapatnekar, P. Banerjee, 1994, A convex programming approach for exploiting data and functional parallelism on distributed memory multiprocessors, International Conference on Parallel Processing (ICPP), IEEE, New York.
35. Rudin W. Real and Complex Analysis. 1974;McGraw-Hill, New York.
36. J. Rutter, 1994, A serial implementation of Cuppen's divide and conquer algorithm for the symmetric eigenvalue problem, University of California.
37. Sarkar V. Automatic partitioning of a program dependence graph into parallel tasks. IBM J. Res. Devel. 35:1991.
38. Stanley K., Demmel J. Modeling the performance of linear systems solvers on distributed memory multiprocessors. Technical report. 1994.
39. Subhlok J., Stichnoth J., O'Hallaron D., Gross T. Exploiting task and data parallelism on a multicomputer. Principles and Practice of Parallel Programming (PPoPP), San Diego. May 1993;ACM-SIGPLAN, New York. p. 13-22.
40. Subhlok J., Vondran G. Optimal mapping of sequences of data parallel tasks. Principles and Practice of Parallel Programming (PPoPP). 1995;. p. 134-143.
41. Subhlok J., Yang B. A new model for integrated nested task and data parallel programming. Principles and Practice of Parallel Programming (PPoPP). 1997.
42. Thakur R., Choudhary A., Fox G. Runtime array redistribution in HPF programs. Technical Report. SCCS-601:1994.
43. C.-P. Wen, K. Yelick, November 1993, Parallel timing simulation on a distributed memory multiprocessor, International Conference on CAD, Santa Clara, CA.
44. Whaley R. C. Basic linear algebra communication subprograms: Analysis and implementation across multiple parallel architectures. Technical report. [LAPACK Working Note 73]:June 1994.
45. Whaley R. C. Basic linear algebra communication subroutines: Analysis and implementation across multiple parallel architectures. Technical report. [LAPACK Working Note 73]:June 1994.