The doconsider loop

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The doconsider loop

Full text

Pdf (1.19 MB)

Source

International Conference on Supercomputing archive
Proceedings of the 3rd international conference on Supercomputing table of contents

Crete, Greece

Pages: 29 - 40

Year of Publication: 1989

ISBN:0-89791-309-4

Authors

Joel H. Saltz	Department of Computer Science, Yale University, New Haven, CT
Ravi Mirchandaney	Department of Computer Science, Yale University, New Haven, CT
Kathleen Crowley	Department of Computer Science, Yale University, New Haven, CT

Sponsors

Computer Tech Inst. : Computer Technology Institute
SIGARCH: ACM Special Interest Group on Computer Architecture
SIAM : Society for Industrial and Applied Mathematics
AICA : Assoc Italianai de Calcolo Automatico

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/318789.318794 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	r. Allen , D. Callahan , K. Kennedy, Automatic decomposition of scientific programs for parallel execution, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.63-76, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41631]
	2	E. Anderson. Solving Sparse Triangular Linear Systems on Parallel Computers. Report 794, UIUC, June 1988.
	3	D. Baxter , J. Saltz , M. Schultz , S. Eisenstat , K. Crowley, An experimental study of methods for parallel preconditioned Krylov methods, Proceedings of the third conference on Hypercube concurrent computers and applications, p.1698-1711, January 1989, Pasadena, California, United States [doi>10.1145/63047.63128]
	4	R. Cytron. Doacross. beyond vectorization for multiprocessors. In The Proceedings of the ICPP, 1986, pages 836-844, 1986.
	5	K. Gallivan , W. Jalby , D. Gannon, On the problem of optimizing data transfers for complex memory systems, Proceedings of the 2nd international conference on Supercomputing, p.238-253, June 1988, St. Malo, France [doi>10.1145/55364.55388]
	6	A. Greenbaum. Solving Sparse Triangular Linear Systems Using Fortran with Paralllel Extensions on the NYU Ultracomputer Prototype. Report 99, NYU Ultracomputer Note, April 1986.
	7	C. Koelbel. The BIF Data Structures User's Manual. in preparation, Purdue University, West Lafayette, IN, 1987.
	8	V. P. Krothapalli , P. Sadayappan, An approach to synchronization for parallel computing, Proceedings of the 2nd international conference on Supercomputing, p.573-581, June 1988, St. Malo, France [doi>10.1145/55364.55420]
	9	Ewing Lusk , James Boyle , Ralph Butler , Terrence Disz , Barnett Glickfeld , Ross Overbeek , James Patterson , Rick Stevens, Portable programs for parallel processors, Holt, Rinehart & Winston, Austin, TX, 1988
	10	D. A. Padua, D. J. Kuck, and D. H. Lawrie. High-speed multiprocessors and compilation techniques, iEEE Trans. on Computers, 29(9):763-776, September 1980.
	11	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	12	C. D. Polychronopoulos , D. J. Kuck, Guided self-scheduling: A practical scheduling scheme for parallel supercomputers, IEEE Transactions on Computers, v.36 n.12, p.1425-1439, Dec. 1987
	13	Joel H. Saltz, Aggregation methods for solving sparse triangular systems on multiprocessors, SIAM Journal on Scientific and Statistical Computing, v.11 n.1, p.123-144, January 1990 [doi>10.1137/0911008]
	14	J. Saltz. Methods for automated problem mapping. In The IMA Volumes in Mathematics and its Applications. Volume 13: Numerical A lgocithms for Modern Parallel Computer Architectures Martin Schultz Editor, Springer-Verlag, 1988.
	15	D. Baxter , R. Mirchandaney , J. H. Saltz, Run-time parallelization and scheduling of loops, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.303-312, June 18-21, 1989, Santa Fe, New Mexico, United States [doi>10.1145/72935.72967]
	16	Joel H. Salz , Ravi Mirchandaney , Kay Crowley, Run-Time Parallelization and Scheduling of Loops, IEEE Transactions on Computers, v.40 n.5, p.603-612, May 1991 [doi>10.1109/12.88484]
	17	P. Tang and P. Yew. Processor self-scheduling for multiple nested parallel loops. In The Pro* ceedings of the ICPP, 1986, pages 528-535, 1986.

CITED BY 7

	Aart J. C. Bik , Harry A. G. Wijshoff, Compilation techniques for sparse matrix computations, Proceedings of the 7th international conference on Supercomputing, p.416-424, July 19-23, 1993, Tokyo, Japan
	Lawrence Rauchwerger , David Padua, The privatizing DOALL test: a run-time technique for DOALL loop identification and array privatization, Proceedings of the 8th international conference on Supercomputing, p.33-43, July 11-15, 1994, Manchester, England
	A. J. C. Bik , H. A. G. Wijshoff, Advanced compiler optimizations for sparse computations, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.430-439, December 1993, Portland, Oregon, United States
	Lawrence Rauchwerger , David Padua, The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization, ACM SIGPLAN Notices, v.30 n.6, p.218-232, June 1995
	Lawrence Rauchwerger , Nancy M. Amato , David A. Padua, Run-time methods for parallelizing partially parallel loops, Proceedings of the 9th international conference on Supercomputing, p.137-146, July 03-07, 1995, Barcelona, Spain
	Aart J. C. Bik , Harry A. G. Wijshoff, Automatic Data Structure Selection and Transformation for Sparse Matrix Computations, IEEE Transactions on Parallel and Distributed Systems, v.7 n.2, p.109-126, February 1996
	Lawrence Rauchwerger , David A. Padua, The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization, IEEE Transactions on Parallel and Distributed Systems, v.10 n.2, p.160-180, February 1999