A scheme to extract run-time parallelism form sequential loops

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A scheme to extract run-time parallelism form sequential loops

Full text

Pdf (928 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 5th international conference on Supercomputing table of contents

Cologne, West Germany

Pages: 75 - 84

Year of Publication: 1991

ISBN:0-89791-434-1

Authors

Chinhyan Kim	Electrical Engineering-Systems, University of Southern California, Los Angeles, California
Jean-Luc Gaudiot	Electrical Engineering-Systems, University of Southern California, Los Angeles, California

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 5, Citation Count: 0

Additional Information:

references 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/109025.109049 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	SISAL Language Reference Manual Version 1.2.
	2	Arvind and K.P. Gostelow. The U-interpreter. IEEE Computer, 1982.
	3	Arvind , Robert A. Iannucci, Two fundamental issues in multiprocessing, 4th International DFVLR Seminar on Foundations of Engineering Sciences on Parallel Computing in Science and Engineering, p.61-88, April 1988, Bonn, Germany
	4	Arvind and R.E. Thomas. I-structures: An efficient data type for functional languages. Technical report, MIT, Laboratory for Computer Science, 1980.
	5	C. A. Fletcher, Computational techniques for fluid dynamics, Springer-Verlag New York, Inc., New York, NY, 1988
	6	Jean-Luc Gaudiot, Structure handling in data-flow systems, IEEE Transactions on Computers, v.35 n.6, p.489-502, June 1986
	7	J-L. Gaudiot and L. Bie. Advanced topics in data-flow computing. Prentice Hall, 1990.
	8	J.-L. Gaudoit , Y.-H. Wei, Token Relabeling in a Tagged Token Data-Flow Architecture, IEEE Transactions on Computers, v.38 n.9, p.1225-1239, September 1989 [doi>10.1109/12.29463]
	9	J. Saltz It. Berryman and J. Scroggs. Execution time support for adaptive scientific algorithms on distributed memory machines. Technical report, ICASE NASA Langley Research Center, 1990.
	10	D.J. Mavriplis. Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshes. AIAA Journal, 1988.
	11	Peiyi Tang , Pen-Chung Yew , Chuan-Qi Zhu, Compiler techniques for data synchronization in nested parallel loops, Proceedings of the 4th international conference on Supercomputing, p.177-186, June 11-15, 1990, Amsterdam, The Netherlands
	12	Y. Saad , H. A. G. Wijshoff, A benchmark package for sparse matrix computations, Proceedings of the 2nd international conference on Supercomputing, p.500-509, June 1988, St. Malo, France [doi>10.1145/55364.55412]
	13	Y. Wei and J-L. Gaudiot. Compiling programs to direct access data.flow graphs. In Proceedings of 1990 International Conference on Parallel Processing, 1990.
	14	Chuan-Qi Zhu , Pen-Chung Yew, A scheme to enforce data dependence on large multiprocessor systems, IEEE Transactions on Software Engineering, v.13 n.6, p.726-739, June 1987 [doi>10.1109/TSE.1987.233477]