Principles of runtime support for parallel processors

Proceedings of the International Conference on Supercomputing

Volumn Part F130184, Issue , 1988, Pages 140-152

  Mirchandaney, Ravi ^a   Saltz, Joel H ^a   Smith, Roger M ^a   Nicol, David M ^b   Crowley, Kay ^a  

^a YALE UNIVERSITY   (United States)

^b The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; DIRECTED GRAPHS;

AGGREGATION TECHNIQUES; AUTOMATED SYSTEMS; DATA DEPENDENCIES; DATA-LEVEL PARALLELISM; DIRECTED ACYCLIC GRAPH (DAG); PARALLEL IMPLEMENTATIONS; PARALLEL PROCESSOR; SCIENTIFIC COMPUTATION;

INTELLIGENT CONTROL;

EID: 85027620683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/55364.55378     Document Type: Conference Paper

References (19)

1. Sudhir Ahuja, Nicholas Carriero, and David Gelerter. Linda and friends. IEEE Computer, August 1986.
2. S. B. Baden. Run-Time Partitioning of Scientific Continuum Calculations Running on Mutiprocessors. PhD thesis, Mathematics Dept., University of California, Berkeley, June 1987.
3. M. J. Berger and S. Bokhari. A Partitioning Strategy for Non-Uniform Problems on Multiprocessors. Report 85-55, ICASE, November 1985. Shortened version appeared in Proceedings ICPP 1985.
4. Chen. Can Data Parallel Machines be Made Easy to Program. Technical Report YALEU/DCS/RR-556, Department of Computer Science, Yale University, August 1987.
5. G. C. Fox and S. W. Otto. Concurrent Computation and the Theory of Complex Systems. Report CALT-68-1343, Caltech, 1986.
6. G. A. Geist and M. T. Heath. Matrix factorization on a hypercube multiprocessor. In The Proceedings of the Hypercube Microprocessors Conf., Knoxville, TN, pages 161-180, September 1986.
7. P. Hudak. Para-functional programming. Computer, Aug 1986.
8. I. Ipsen, Y. Saad, and M.H. Schultz. Complexity of dense linear system solution on a multiprocessor ring. Lin. Algebra Appl., 77:205-239, 1986.
9. J. F. Jordan, M. S. Benten, and N. S. Arenstorf. Force User's Manual. Department of Electrical and Computer Engineering 80309-0425, University of Colorado, October 1986.
10. K. Kennedy. Compilation for n-processor architectures. In Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers, page 15, October 1985.
11. E. Lusk, R. Overbeek, and et al. Portable Programs for Parallel Processors. Holt, Rinehart and Winston Inc., 1987.
12. D. M. Nicol and J. H. Saltz. Principles for Problem Aggregation and Assignment in Medium Scale Multiprocessors. Report 87-39, ICASE, September 1987.
13. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. CACM, Dec 1986.
14. PCGPAK User's Guide. 1984.
15. Y. Saad. Communication complexity of the gaussian elimination algorithm on multiprocessors. Lin. Algebra Appl., 77:315-340, 1986.
16. Y. Saad and M. H. Schultz. Topological Properties of Hypercubes. Department of Computer Science YALEU/DCS/RR-389, Yale, June 1986.
17. J. Saltz. Automated Problem Scheduling and Reduction of Communication Delay Effects; submitted for publication. Report 87-22, ICASE, May 1987.
18. J. H. Saltz, R. Mirchandaney, R. Smith, and D. Nicol. The Automated Crystal Runtime System: A Framework. Technical Report 588, Department of Computer Science, Yale University, Nov: 1987.
19. M. Schultz, D. Baxter, S. Eisenstat, and J. Saltz. Building Software Packages for Large Sparse Linear Systems of Equations on Shared Memory Multiprocessors. Technical Report SCA-115, Scientific Computing Associates, 1987.