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

An architecture of a dataflow single chip processor

Published: 01 April 1989 Publication History

Abstract

A highly parallel (more than a thousand) dataflow machine EM-4 is now under development. The EM-4 design principle is to construct a high performance computer using a compact architecture by overcoming several defects of dataflow machines. Constructing the EM-4, it is essential to fabricate a processing element (PE) on a single chip for reducing operation speed, system size, design complexity and cost. In the EM-4, the PE, called EMC-R, has been specially designed using a 50,000-gate gate array chip. This paper focuses on an architecture of the EMC-R. The distinctive features of it are: a strongly connected arc dataflow model; a direct matching scheme; a RISC-based design; a deadlock-free on-chip packet switch; and an integration of a packet-based circular pipeline and a register-based advanced control pipeline. These features are intensively examined, and the instruction set architecture and the configuration architecture which exploit them are described.

References

[1]
Amamiya.M. TakesueM. HasegawaR. and Mikami,H.: Implementation and Evaluation of a ListProcessing-Otientad Data Flow Machine, Pmt. the 13th Annu. Symp. on Computer Architecture, pp.lO-19 (June 1986).
[2]
Arvind, Dertouxos,M.L. and Iannucci,R.A.: A Multiprocessor Emulation Facility, MIT-LCS Technical Report 302 (Sep. 1983).
[3]
Dennis,J.B., Lim,W.Y.P. and Ackerman,W.B.: The MIT Datatlow Engineering Model, Proc. IFIP Congress 83. 553560 (1983).
[4]
GurdJ., Kirkham,C.C. and Warson.1.: The Manchester Prototype Dataflow Computer, Commun. ACM, 21. 1, pp.3452 (1985).
[5]
Hiraki, Sekiguti.S. artd Shimada,T.: System Architecture of a Datatlow Supercomputer. TENCON87, Seoul (1987).
[6]
Otsuka,Y., Sakai,S. and Yuba,T.: Static Load Allocation in DataRow Machines, Pmt. of Technical Group on Computer Architecture, IECE Japan, CA.%-136, in Japanese (1986).
[7]
Sakai,S., Yamaguchi,Y., Hiraki.IC. and YubaJ.: Introduction of a Strongly-Connected-Arc Model in a Data Driven Single Chip tissor EMC-R. Proc. Datallow Workshop 1987, EXE Japan, pp.231-238, in Japanese (1987).
[8]
Shimada,T., Hiraki,K. Nishida,K. and Sekiguchi.S.: Evaluation of a Prototype Data Flow Processor of the SIGMA-l for Scientific Computations, Inf. Process. Leu.,l6, 3, pp.139-143 (1983).
[9]
Yamaguchi,Y., Toda,K. and Yuba,T.: A Performance Evaluation of a Lisp-Based Data-Driven Machine(EM-3). Proc. 10th Annual Symposium on Computer Architecture, pp.163.169 (1983).
[10]
Yamaguchi,Y. SakaiS., An Architectural Design of a Highly Parallel Dataflow Machine, to appear in IFIP'89 (1989).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ISCA '89: Proceedings of the 16th annual international symposium on Computer architecture
April 1989
426 pages
ISBN:0897913191
DOI:10.1145/74925
  • cover image ACM SIGARCH Computer Architecture News
    ACM SIGARCH Computer Architecture News  Volume 17, Issue 3
    Special Issue: Proceedings of the 16th annual international symposium on Computer Architecture
    June 1989
    400 pages
    ISSN:0163-5964
    DOI:10.1145/74926
    Issue’s Table of Contents

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 543 of 3,203 submissions, 17%

Upcoming Conference

ISCA '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)109
  • Downloads (Last 6 weeks)33
Reflects downloads up to 22 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2020)A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow MaximizationJournal of the ACM10.1145/338345467:2(1-26)Online publication date: 17-Apr-2020
  • (2020)Frege Systems for Quantified Boolean LogicJournal of the ACM10.1145/338188167:2(1-36)Online publication date: 5-Apr-2020
  • (2020)Looking Beyond the HorizonDigital Threats: Research and Practice10.1145/33736391:1(1-13)Online publication date: 17-Mar-2020
  • (2020)Deterministic Factorization of Sparse Polynomials with Bounded Individual DegreeJournal of the ACM10.1145/336566767:2(1-28)Online publication date: 4-May-2020
  • (2019)Layout Resynthesis by Applying Design-for-manufacturability Guidelines to Avoid Low-coverage Areas of a Cell-based DesignACM Transactions on Design Automation of Electronic Systems10.1145/332506624:4(1-19)Online publication date: 29-May-2019
  • (2019)Share-n-LearnACM Transactions on Design Automation of Electronic Systems10.1145/331804424:4(1-27)Online publication date: 22-Apr-2019
  • (2019)CAD-BaseACM Transactions on Design Automation of Electronic Systems10.1145/331557424:4(1-30)Online publication date: 18-Apr-2019
  • (2016)Optimizing swap space for improving process response after system resumeACM SIGAPP Applied Computing Review10.1145/2893706.289371015:4(54-61)Online publication date: 17-Feb-2016
  • (2016)Improving random write performance in homogeneous and heterogeneous erasure-coded drive arraysACM SIGAPP Applied Computing Review10.1145/2893706.289370915:4(31-53)Online publication date: 17-Feb-2016
  • (2016)Dynamic system modeling of evolutionary algorithmsACM SIGAPP Applied Computing Review10.1145/2893706.289370815:4(19-30)Online publication date: 17-Feb-2016
  • Show More Cited By

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