Abstract
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments for multirate signal processing applications. In this paradigm, the repetition of computations is specified by the relative rates at which the computations consume and produce data. This implicit specification of iteration allows a compiler to easily explore alternative nested loop structures for the target code with respect to their effects on code size, buffering requirements and throughput. In this paper, we develop important relationships between the SDF description of an algorithm and the range of looping structures offered by this description, and we discuss how to improve code efficiency by applying these relationships.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arvind, L. Bic and T. Ungerer, “Evolution of Data-Flow Computers,” Chapter 1 inAdvanced Topics In Data-Flow Computing, edited by J.L. Gaudiot and L.Bic, Prentice Hall, 1991.
S.S. Bhattacharyya, J.T. Buck, S. Ha, and E.A. Lee, “Generating Compact Code From Dataflow Specifications of Multirate DSP Algorithms,” Memorandum No. UCB/ERL M93/36, Electronics Research Laboratory, College of Engineering, University of California at Berkeley, May 1993.
S.S. Bhattacharyya and E.A. Lee, “Scheduling Synchronous Dataflow Graphs For Efficient Looping,”Journal of VLSI Signal Processing, to appear in 1993.
J. Buck, S. Ha, E.A. Lee, and D.G. Messerschmitt, “Ptolemy: A Framework for Simulating and Prototyping Heterogeneous Systems,”International Journal of Computer Simulation, to appear in January 1994.
J.B. Dennis, “First Version of a Dataflow Procedure Language,”MIT/LCS/TM-61, Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge MA 02139, 1975.
J.B. Dennis, “Stream Data Types for Signal Processing,” Technical Report, September 1992.
G.R. Gao, R. Govindarajan, and P. Panangaden, “Well-Behaved Programs for DSP Computation,”ICASSP, San Francisco, California, March 1992.
D. Genin, J. De Moortel, D. Desmet, and E. Van de Velde, “System Design, Optimization, and Intelligent Code Generation for Standard Digital Signal Processors,”ISCAS, Portland, Oregon, May 1989.
P.N. Hilfinger, “Silage Reference Manual, Draft Release 2.0,” Computer Science Division, EECS Dept., University of California at Berkeley, July 1989.
W.H. Ho, E.A. Lee, and D.G. Messerschmitt, “High Level Dataflow Programming for Digital Signal Processing,”VLSI Signal Processing III, IEEE Press 1988.
S. How, “Code Generation for Multirate DSP Systems in GABRIEL,” Master's Degree Report, U.C. Berkeley, May 1988.
E.A. Lee, “Static Scheduling of Dataflow Programs for DSP,”Advanced Topics in Dataflow Computing, edited by J.L. Gaudiot and L. Bic, Prentice-Hall, 1991.
E.A. Lee, “A Coupled Hardware and Software Architecture for Programmable Digital Signal Processors,” Ph.D. Thesis, University of California at Berkeley, May 1986.
E.A. Lee and D.G. Messerschmitt, “Static Scheduling of Synchronous Dataflow Programs for Digital Signal Processing,”IEEE Transactions on Computers, January 1987.
E.A. Lee and D.G. Messerschmitt, “Synchronous Dataflow,”Proceedings of the IEEE, September 1987.
J.R. McGraw, S.K. Skedzielewski, S. Allan, D. Grit, and R. Oldehoft, J. Glauert, I. Dobes, and P. Hohensee, “SISAL: Streams and Iteration in a Single Assignment Language,” Language Reference Manual, Version 1.1., July 1983.
D.R. O'Hallaron, “The ASSIGN Parallel Program Generator,” Technical Report, Memorandum Number CMU-CS-91-141, School of Computer Science, Carnegie Mellon University, May 1991.
D.B. Powell, E.A. Lee, and W.C. Newmann, “Direct Synthesis of Optimized DSP Assembly Code From Signal Flow Block Diagrams,”ICASSP, San Francisco, California, March 1992.
H. Printz, “Automatic Mapping of Large Signal Processing Systems to a Parallel Machine,” Memorandum CMU-CS-91-101, School of Computer Science, Carnegie-Mellon University, May 1991.
S. Ritz, M. Pankert, and H. Meyr, “Optimum Vectorization of Scalable Synchronous Dataflow Graphs,” Technical Report IS2/DSP93. 1a, Aachen University of Technology, Germany, January 1993.
G. Sih, “Multiprocessor Scheduling to Account for Interprocessor Communication,” Ph.D Thesis, University of California at Berkeley, 1991.
R.E. Tarjan, “Depth First Search and Linear Graph Algorithms,”SIAM J. Computing, June 1972.
W.W. Wadge and E.A. Ashcroft, “Lucid, the Dataflow Language,” Academic Press, 1985.
Author information
Authors and Affiliations
Additional information
This research is part of the Ptolemy project, which is supported by the Advanced Research Projects Agency and the U.S. Air Force (under the RASSP program, contract F33615-93-C-1317), Semiconductor Research Corporation (project 94-DC-008), National Science Foundation (MIP-9201605), Office of Naval Technology (via Naval Research Laboratories), the State of California MICRO program, and the following companies: Bell Northern Research, Cadence, Dolby, Hitachi, Mentor Graphics, Mitsubishi, NEC, Pacific Bell, Philips, Rockwell, Sony, and Synopsys.
Rights and permissions
About this article
Cite this article
Bhattacharyya, S.S., Lee, E.A. Looped schedules for dataflow descriptions of multirate signal processing algorithms. Form Method Syst Des 5, 183–205 (1994). https://doi.org/10.1007/BF01383830
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01383830