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

Exploiting data parallelism in signal processing on a dataflow machine

Published: 01 April 1989 Publication History

Abstract

This paper will show that the massive data parallelism inherent to most signal processing tasks may be easily mapped onto the parallel structure of a data flow machine. A special system called STRUCTFLOW has been designed to optimize the static data flow model for hardware efficiency and low latency. The same abstractions from the general purpose data flow model that lead to a quasi systolic operation of the processing elements make explicit flow control of the data tokens as they pass through the arcs of the flow graph obsolete. We will describe the architecture of the system and discuss the restrictions on the structure of the flow graphs.

References

[1]
Augcnstcin, R.; Enhvurf umi Realisierung einer Verarbeitungseinheir; Masters Thesis, Fak. Electrical Eng., Univasitit Karlsruhe. 1987( in German)
[2]
Campbell, M. L.; Static Allocation for a Data Flow Multiprocessor; IEEE Int. Conf. Parallel Processing, p. 51 lff, 1985
[3]
Chase, M.; A Pipelined Data Flow Architecture for Digital Signal Processing, VLSI Signal Processing. Sect. 18, IEEE Press, 1984
[4]
Chen, S.; Rittcr, G.X.; A Reconfigurable Archirecrure for Image Processing; IEEE, Int. Conf. Computer Design, p. 516ff, 1984
[5]
Dennis, J. B.; Data Flow Ideas for Supercomputers, IEEE COMPCON Spring, p. 15ff, 1984
[6]
Dennis, J.B.; Rong, G.G.; Maximum Pipelining of Array Operalions on Sfafic Dora Flow Machine, IEEE, Int. Conf. Parallel Processing, p. 33lff. 1983
[7]
Gallinat, J.; Entwurf und Aufbrru einer Matching-Einheil, Masters Thesis, Fak. Computer Science, Univcrsitiit Karlstuhe, 1987 ( in German )
[8]
Hogenauer, E.B.; Newbold, R.F.; Inn, Y.J.; DDSP -A Data Flow Cornpurer for Signal Processing, IEEE Int. Conf Parallel Processing, p. 126ff. 1982
[9]
Hong, Y.-C.; Payne, T. H.; Fcrguson, L. 0.; An Archilecfure for a Dataflow Mufriprocessor, IEEE Int. Conf. Parallel Processing, p. 349ff, 1986
[10]
Leier, W.; A Small, High-Speed Data Flow Processor, IEEE Int. Conf. Parallel Processing, p. 34 lff, 1983
[11]
Montz, L.B.; Safety and Optimization Transformalions for Data Flow Programs; TR 240, LCS, MIT, 1980
[12]
Sawawakar, P.S.; Forquer, T.J.; Derry, R.P.; Programmable Modular Signal Processor - A Data Flow Computer for Real Time Signal Processing, IEEE Int. Conf. Parallel Processing, p. 344ff. 1985
[13]
Scarchillo, A.; Entwurf und Aufbau ciner Kommunikationseinhcit; Masters-Thesis, Fak. Electrical Eng., Universitit Karlsruhe, 1987 ( in German)
[14]
Seals, J.D.; Shivcly, R.R.; EMSP: A Data Flow Compufer for Signal Processing Applicalionr, VLSI Signal Processing, Sect. 6. IEEE Press, 1984
[15]
McGraw, J., et al.: SISAL: Sfreams and Iteration in a SingIe-Assignmenl LMgunge; Lawrence Livermore Ntnl. Labs, 1983
[16]
Tcmma, T., Mizoguchi, M.; Hanaki, S.: Template-Confrolled Image Processor TIP-1 Pelformance Evaluation, IJCAI,1983
[17]
Vedder, R.; Finn, D.; The Huges Data Flow Mutiiprocessor: Archilecturefor Efficienf Signal and Data Processing, IEEE 12th Ann. Int. symp. computer Architecture, p. 324ff, 1985
[18]
Veen, A.: A Formal Model for Dala Flow Programs wifh Token Coloring; internal repcxt, MC, Asterdam, 1981
[19]
Veen, A.: The Misconrlrued Semicolon: Reconciling Imperative Languages and Dalafow Machines; CWI Tract, MC, Amsterdam, 1986

Recommendations

Reviews

David B. Skillicorn

One of the chronic problems of computer science is that researchers do not keep up with the literature. As a result, repetition is common. In this paper the author designs a stream-based dataflow language almost exactly like Lucid [1] (of which he appears unaware) and a static dataflow architecture almost exactly like Dennis's [2]. In order to allow fixed buffering between stages, only one set of stream elements is allowed into each part of the dataflow graph at a time. This effectively removes the opportunity for pipelining and its associated performance gains. Hence this architecture can be expected to perform quite poorly. A prototype processing element has been built, but the author essentially presents a paper design.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

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

  • 0
    Total Citations
  • 430
    Total Downloads
  • Downloads (Last 12 months)81
  • Downloads (Last 6 weeks)7
Reflects downloads up to 28 Dec 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media