Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/165939.165950acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article
Free access

Data stream control optimization in dataflow architectures

Published: 01 August 1993 Publication History

Abstract

In order to achieve implementation control in a dataflow architecture, it is necessary to bring data streams under control and branch them in accord with prevailing conditions. This study suggests methodologies for modeling and formulating the control overhead of data streams. From these methodologies, techniques are derived to minimize overhead. In order to verify the practicality of these techniques, they were first applied to three representative Japanese dataflow architectures to show their basic ability to reduce overhead, and for further verification, they were next applied to several real applications to test their more specific abilities, as well as their value as techniques for optimizing compilation.

References

[1]
K. Hiraki, S. Sekiguchi, and S. Shimada, Status Report of SIGMA-1: A Data-Flow Supercomputer, in "Advanced Topics in Data-Flow Computing", J.Gaudiot and L.Bic ed., Prentice Hall, pp.207-223, 1991.]]
[2]
K. Hiraki, S. Sekiguchi, and T. Shimada, System Architecture of a Dataflow Supercomputer, TEN- CON 87-IEEE Region 10 Conference, pp.1044- 1049,1987.]]
[3]
S. Sakai, Y. Kodama, and Y. Yamaguchi, An Architecture of a Dataflow Single Chip Processor, 16th ISCA, pp.46-53, 1989.]]
[4]
S. Sakai, Y. Kodama, and Y. Yamaguchi, Prototype Implementation of a Highly Parallel Dataflow Machine EM-4, 5th IPPS, pp.278-286, 1991.]]
[5]
T. Temma et al, Data Flow Processor Chip for Image Processing, IEEE Trans., ED-32, pp.1784-1791, 1985.]]
[6]
M. Iwashita et al, A Data Flow Image Processor, ICS'87, pp.408-409, 1987.]]
[7]
Arvind, R. S. Nikhil, Executing a Program on the MIT Tagged-Token Dataflow Architecture, IEEE Trans. on Computers, Vol.39, No.3, pp.300-318, 1990.]]
[8]
M. Beck, R. Johnson, and K. Pingali, From Control Flow to Dataflow, Journal of Parallel and distributed Computing, No.12, pp.118-129, 1991.]]
[9]
S. Sekiguchi, T. Shimada, and K. Hiraki, A Decision Principle of Switch Nodes in Parallel Language DFC, Trans. of Information Processing Society of Japan, Vol.31, No.10, pp.1454-1462, 1990.]]
[10]
T. Okamoto el al, An Implementation Method of a High Level Language for a Data-Driven Processor, in Proc. of Japan Symposium of Parallel Processing (JSPP'89), pp.227-233, 1989.]]
[11]
Arvind and R. S. Nikhil, I-structure: Data Structures for Parallel Computing, ACM Trans. on Programming Languages and Systems, Vol.11, No.4, pp.598-632, 1989.]]
[12]
S. Kyo, S. Okazaki, and M. Mizoguchi, Dataflow Graph Optimization for Dataflow Architectures-A Dataflow Optimizing Compiler-, to appear in 22th ICPP, 1993.]]
[13]
M. Sowa et al, Data-Driven Control of Multi- Microprocessor System, Trans. IECE Japan, Vol.E67, No.2, 1984.]]
[14]
R. A. Iannucci, Toward a Dataflow/von Neumann Hybrid Architecture, 15th ISCA, pp.131-140, 1988.]]
[15]
D. E. Culler and G. M. Papadopoulos, The Explicit Token Store, Journal of Parallel and distributed Computing, No.10, pp.289-308, 1990.]]
[16]
R. S. Nikhil and Arvind, Can dataflow subsume yon Neumann computing ?, 16th ISCA, pp.262- 272, 1989.]]
[17]
R. S. Nikhil, G. M. Papadopoulos, and Arvind, *T: a Killer Micro for a Brave New World, MIT Technical Report, 1991.]]

Cited By

View all
  • (1993)Dataflow Graph Optimization for Dataflow Architectures a Dataflow Otimizing CompilerProceedings of the 1993 International Conference on Parallel Processing - Volume 0210.1109/ICPP.1993.66(236-240)Online publication date: 16-Aug-1993

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICS '93: Proceedings of the 7th international conference on Supercomputing
August 1993
425 pages
ISBN:089791600X
DOI:10.1145/165939
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ICS93
Sponsor:

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)21
  • Downloads (Last 6 weeks)7
Reflects downloads up to 14 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (1993)Dataflow Graph Optimization for Dataflow Architectures a Dataflow Otimizing CompilerProceedings of the 1993 International Conference on Parallel Processing - Volume 0210.1109/ICPP.1993.66(236-240)Online publication date: 16-Aug-1993

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media