A quantitative analysis of locality in dataflow programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A quantitative analysis of locality in dataflow programs

Full text

Pdf (616 KB)

Source

International Symposium on Microarchitecture archive
Proceedings of the 24th annual international symposium on Microarchitecture table of contents

Albuquerque, New Mexico, Puerto Rico

Pages: 12 - 18

Year of Publication: 1991

ISBN:0-89791-460-0

Authors

William Marcus Miller	Department of Computer Science, Colorado State University, Ft. Collins, CO
Walid A. Najjar	Department of Computer Science, Colorado State University, Ft. Collins, CO
A. P. Wim Böhm	Department of Computer Science, Colorado State University, Ft. Collins, CO

Sponsors

IEEE-CS : Computer Society
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/123465.123469 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.

	AI87	Arvind and R.A. Iannucci. Two fundamentals issues in multiprocessors: the data-flow solutions. Technical Report LCS CSG 226- 6, Laboratory for Computer Science, MIT, Cambrige Massachussett, May 1987.
	ANP89	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989 [doi>10.1145/69558.69562]
	BG90	A. P. W. Böhm , J. R. Gurd, Iterative Instructions in the Manchester Dataflow Computer, IEEE Transactions on Parallel and Distributed Systems, v.1 n.2, p.129-139, April 1990 [doi>10.1109/71.80141]
	Bro87	Steven Brobst. Organization of an instruction schedulting and token storage unit in a tagged token dataflow machine. In S. K. Sahni, editor, Proc. of the 1987 International Conf. on Parallel Processing, pages 40-45, 1987.
	Cul85	D. E. Culler, RESOURCE MANAGEMENT FOR THE TAGGED TOKEN DATAFLOW ARCHITECTURE, Massachusetts Institute of Technology, Cambridge, MA, 1985
	Feo87	John T. Feo. The livermore loops in sisal. Technical Report UCID-21159, Computing Research Group, Lawrence Livermore National Laboratory, Livermore, CA 94550, August 1987.
	GH90	V. G. Grafe , J. E. Hoch, The EPSILON-2 multiprocessor system, Journal of Parallel and Distributed Computing, v.10 n.4, p.309-318, Dec. 1990 [doi>10.1016/0743-7315(90)90032-K]
	GPKK82	D. Gajski, D. A. Padua, D. J. Kuck, and R. H. Kuhn. A second opinion on Data-Flow machines and languages. IEEE Computer, pages 58-69, 1982.
	HG91	Herbert H. J. Hum , Guang R. Gao, A novel high-speed memory organization for fine-grain multi-thread computing, Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms, p.34-51, June 1991, Eindhoven, The Netherlands
	HP90	David A. Patterson , John L. Hennessy, Computer architecture: a quantitative approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1990
	Ian88	R.A. Iannucci. A dataflow/von Neumann hybrid architecture. Technical Report MIT/LCS/TR-418, MIT Laboratory for Computer Science, May 1988.
	McM86	F.H. McMahon. Livermore fortran kernels: A computer test of numerical performance range. Technical Report UCRL- 53745, Lawrence Livermore National Laboratory, Livermore, CA, December 1986.
	MSA+85	James McGraw, Stephen Skedzielewski, Stephen Allan, Rod Oldehoeft, John Glauert, Chris Kirkham, Bill Noyce, and Robert Thomas. SISAL: Streams and iteration in a single assignment language: Reference manual version 1.2. Manual M-146, Rev. 1, Lawrence Livermore National Laboratory, Livermore, CA, March 1985.
	NG87	W. Najjar and J.-L. Gaudic~t. Multi-level execution in Data-Flow architectures. In S. K. Sahni, editor, Proc. International Conf. Parallel Processing, pages 32-39, St. Charles, Illinois, 1987.
	Ric85	John R. Rice. Problems to test parallel and vector languages. Technical Report CSD- TR 516, Purdue University, 1985.
	Ric90	John R. Rice. Problems to test paraIlet and vector languages- 2. Technical Report CSD- TR 1016, Purdue University, 1990.
	SYH+89	S. Sakai , y. Yamaguchi , K. Hiraki , Y. Kodama , T. Yuba, An architecture of a dataflow single chip processor, Proceedings of the 16th annual international symposium on Computer architecture, p.46-53, April 1989, Jerusalem, Israel
	Vee86	Arthur H. Veen, Dataflow machine architecture, ACM Computing Surveys (CSUR), v.18 n.4, p.365-396, Dec. 1986 [doi>10.1145/27633.28055]

CITED BY 4

	W. Marcus Miller , Walid A. Najjar , A. P. Wim Böhm, A model for dataflow based vector execution, Proceedings of the 8th international conference on Supercomputing, p.11-22, July 11-15, 1994, Manchester, England
	Walid A. Najjar , W. Marcus Miller , A. P. Wim Böhm, An analysis of loop latency in dataflow execution, ACM SIGARCH Computer Architecture News, v.20 n.2, p.352-360, May 1992
	Lucas Roh , Walid A. Najjar , A. P. Wim Böhm, Generation and quantitative evaluation of dataflow clusters, Proceedings of the conference on Functional programming languages and computer architecture, p.159-168, June 09-11, 1993, Copenhagen, Denmark
	Walid A. Najjar , Lucas Roh , A. P. Wim Böhm, The Initial Performance of a Bottom-Up Clustering Algorithm for Dataflow Graphs, Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, p.91-100, January 20-22, 1993