Four vector-matrix primitives

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 292-302

  Agrawal, Ajit ^a   Blelloch, Guy E ^b,c   Krawitz, Robert L ^d   Phillips, Cynthia A ^d  

^a YALE UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c SUN MICROSYSTEMS   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APL (PROGRAMMING LANGUAGE); LINEAR PROGRAMMING; MULTIPROCESSING SYSTEMS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; VECTORS;

ASYMPTOTICALLY OPTIMAL; CONSTANT FACTORS; GAUSSIAN ELIMINATION; HYPERCUBE MULTIPROCESSORS; NUMERICAL ALGORITHMS; PARALLEL MATRIX ALGORITHMS; SERIAL ALGORITHMS; SIMPLEX ALGORITHM;

MATRIX ALGEBRA;

EID: 85031685898     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72966     Document Type: Conference Paper

References (17)

1. Guy E. Blelloch. Applications and algorithms on the Connection Machine. TR87-1, Thinking Machines Corporation, Cambridge, MA, November 1987.
2. Guy E. Blelloch. Scan Primitives and Parallel Vector Models. PhD thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, November 1988.
3. Peter R. Capello. Gaussian elimination on a hyper- cube automation. J. Parallel and Dist. Comput., 4:288-308, July 1987.
4. Vladimir Cherkassky and Ross Smith. Efficient mapping and implementation of matrix algorithms on a hypercube. The Journal of Supercomputing, 2(l):7-27, September 1988.
5. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
6. Sanjay R. Deshpande and Roy M. Jenevin. Scaleability of a binary tree on a hypercube. In 1986 International Conference on Parallel Processing, pages 661-668, IEEE Computer Society, 1986.
7. eoffrey C. Fox, S. W. Otto, and A. J. Hey. Matrix algorithms on a hypercube I: Matrix multiplication. Parallel Computing, 4(1):7-31, 1987.
8. Geoffrey C. Fox and Wojtek Furmanski. Optimal communication algorithms on hypercube. Technical Report CCCP-314, California Inst, of Technology, Pasadena, CA, July 1986.
9. G. A. Geist and M. T. Heath. Matrix factorization on a hypercube multiprocessor. In Proceedings of the First Conference on Hypercube Multiprocessors, pages 161-180, August 1985.
10. William D. Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.
11. Kenneth E. Iverson. A Programming Language. Wiley, New York, 1962.
12. S. Lennart Johnsson. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distributed Comput., 4(2):133- 172, April 1987.
13. S. Lennart Johnsson and Ching-Tien Ho. Spanning graphs for optimum broadcasting and personalized communication in hypercubes. Technical Report YALEU/DCS/RR-500, Dept. of Computer Science, Yale Univ., New Haven, CT, November 1986. Revised November 1987, YALEU/DCS/RR- 610. To appear in IEEE Trans. Computers.
14. C. Moler. Matrix computation on a distributed memory multiprocessor. In Proceedings of the First Conference on Hypercube Multiprocessors, pages 161-180, August 1985.
15. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982.
16. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes. Cambridge University Press, Cambridge, 1986.
17. Quentin F. Stout and Bruce Wager. Passing messages in link-bound hypercubes. In Michael T. Heath, editor, Hypercube Multiprocessors 1987, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1987.