Synchronous data flow

Proceedings of the IEEE

Volumn 75, Issue 9, 1987, Pages 1235-1245

  Lee, Edward A ^a   Messerschmitt, David G ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84939698077     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1987.13876     Document Type: Article

References (52)

1. D. A. Padua, D. J. Kuck, and D. H. Lawrie, “High-speed multiprocessors and compilation techniques.,” IEEE Trans. Cornput., vol. C-29, no. 9, pp. 763–776, Sept. 1980
2. J. B. Dennis, “Data flow supercomputers,” Computer, vol. 13, no. 11, pp. 48–56, Nov. 1980
3. J. B. Dennis and D. P. Misunas, “A computer architecture for highly parallel signal processing,” in Proc. 1974 Nat. Comput. Conf., pp. 402-409, 1974
4. I. Watson and J. Gurd, “A practical data flow computer,” Computer, vol. 15, no. 2, pp. 51–57, Feb. 1982
5. A. L. Davis and R. M. Keller, “Data flow program graphs,” Computer, vol. 15, no. 2, pp. 26–41, Feb. 1982
6. W. B. Ackerman, “Data flow languages,” Computer, vol. 15, no. 2, pp. 15–25, Feb. 1982
7. P. C. Treleaven, D. R. Brownbridge, and R. P. Hopkins, “Data driven and demand driven computer architecture,” University of Newcastle upon Tyne, Newcastle upon Tyne, UK, Tech. Rep., 1981
8. D. A. Schwartz and T. P. Barnwell, III, “Cyclo-static solutions: Optimal multiprocessor realizations of recursive algorithms,” in VLSI Signal Processing, II, S-Y. Kung, R. E. Owen, and J. G. Nash, Eds. New York, NY: IEEE PRESS, 1986
9. D. A. Schwartz, “Synchronous multiprocessor realizations of shift-invariant flow graphs,” Ph.D. dissertation, Georgia Inst. Technol. Tech. Rep. DSPL-85-2, July 1985
10. T. P. Barnwell, C. J. M. Hodges, and M. Randolf, “Optimum implementation of single time index signal flow graphs on synchronous multiprocessor machines,” in Proc. Int. Conf. on Acoustics, Speech, and Signal Processing (May 3–5, 1982)
11. T. P. Barnwell and D. A. Schwartz, “Optimal implementation of flow graphs on synchronous multiprocessors,” in Proc. 1983 Asilomar Conf. on Circuits and Systems, Nov. 1983
12. M. Renfors and Y. Neuvo, “The maximum sampling rate of digital filters under hardware speed constraints,” IEEE Trans. Circuits and Syst., vol. CAS-28, no. 3, pp. 196–202, Mar. 1981
13. A. L. Davis, “The architecture and system method of DDM1: A recursively structured data driven machine,” in Proc. 5th Annu. Symp. on Computer Architecture, pp. 210–215, Apr. 1978
14. J, Rumbaugh, “A data flow multiprocessor,” IEEE Trans. Cornput., vol. C-26, no. 2, p. 138, Feb. 1977
15. R. G. Babb, “Parallel processing with large grain data flow techniques,” Computer, vol. 17, no. 7, pp. 55–61, July 1984
16. G. Ungerboeck, “Fractional tap-spacing and consequences for clock recovery in data modems,” IEEE Trans. Commun., vol. COM-24, pp. 856–864, Aug. 1976
17. R. D. Gitlin and S. B. Weinstein, “Fractionally-spaced equalization: An improved digital transversal equalizer,” Bell Syst. Tech. J., vol. 60, no. 2, Feb. 1981
18. D. D. Falconer, “Jointly adaptive equalization and carrier recovery in two-dimensional digital communication systems,” Bell Syst. Tech. J., vol. 55, no. 3, Mar. 1976
19. D. J. Hait, “The BLOSIM simulation program,” U. C. Berkeley, Master's Rep., Nov. 11, 1985
20. Kelly, Lochbaum, and Vyssotsky, “A block diagram compiler,” Bell Syst. Tech. J., vol. 40, no. 3, May 1961
21. B. Gold and C. Rader, Digital Processing of Signals. New York, NY: McGraw-Hill, 1969
22. B. Karafin, “The new block diagram compiler for simulation of sampled-data systems,” in AFIPS Conf. Proc., vol. 27, pp. 55–61, 1965
23. M. Dertouzous, M. Kaliske, and K. Polzen, “On-line simulation of block-diagram systems,” IEEE Trans. Comput., vol. C-18, no. 4, pp. 333–342, Apr. 1969
24. G. Korn, “High-speed block-diagram languages for microprocessors and minicomputers in instrumentation, control, and simulation,” Comput. Elec. Eng., vol. 4, pp. 143-159,1977
25. W. Henke, “MITSYN-An interactive dialogue language for time signal processing,” MIT Res. Lab. Electron. Memo. RLETM-1, Feb. 1975
26. T. Crystal and L. Kulsrud, “Circus,” Inst, for Defense Analysis, Princeton, NJ, CRD Working Paper, Dec. 1974
27. Dipartimento di Elettronica, Politecnico di Torino, TOPSIM III—Simulation Package for Communication Systems—User’s Manual. Torino, Italy: Politecnico di Torino
28. D. G. Messerschmitt, “A tool for structured functional simulation,” IEEE J. Selected Areas Commun., vol. SAC-2, no. 1, pp. 137–147, Jan. 1984
29. D. G. Messerschmitt, “Structured interconnection of signal processing programs,” in Proc. Globecom84, Dec. 1984
30. L. Snyder, “Parallel programming and the Poker programming environment,” Computer, vol. 17, no. 7, pp. 27–36, July 1984
31. R. E. Crochiere and A. V. Oppenheim, “Analysis of linear digital networks,” Proc. IEEE, vol. 63, no. 4, pp. 581–595, Apr. 1975
32. J. P. Brafman, J. Szczupak, and S. K. Mitra, “An approach to the implementation of digital filters using microprocessors,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, no. 5, pp. 442–446, Oct. 1978
33. J. Zeman and G. S. Moschytz, “Systematic design and programming of signal processors, using project management techniques,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31 no. 6, pp. 1536–1549, Dec. 1983
34. S. Y. Kung, J. Annevelink, and D. Dewilde, “Heirarchical iterative flowgraph integration for VLSI array processers,” in VLSI Signal Processing, P. R. Capello et al., Eds. New York, NY: IEEE PRESS, 1984, pp. 294–305
35. F. Commoner and A. W. Holt, “Marked directed graphs,” J. Comput. Syst. Sci., vol. 5, pp. 511–523, 1971
36. R. Reiter, “Scheduling parallel computations,” J. Assoc. Comput Mach., vol. 14, pp. 590-599, 1968
37. E. A. Lee, “A coupled hardware and software architecture for programmable digital signal processors,” Ph.D. dissertation, Memo. UCB/ERL M86/54, EECD Dept., UC Berkeley, 1986
38. R. M. Karp, R. E. Miller, and S. Winograd, “The organization of computations for uniform recurrence equations,” J. Assoc. Comput. Mach., vol. 14, pp. 563-590, 1967
39. S. K. Rao, “Regular iterative algorithms and their implementations on processor arrays,” Ph.D. dissertation, Informat. Sys. Lab., Stanford Univ., Stanford, CA, Oct. 1985
40. R. M. Karp and R. E. Miller, “Properties of a model for parallel computations: Determinacy, termination, queueing,” SIAM J., vol. 14, pp. 1390–1411, Nov. 1966
41. R. Reiter, “A study of a model for parallel computations,” Ph.D. dissertation, Univ. Michigan, Ann Arbor, 1967
42. J. L. Peterson, “Petri nets,” Comput. Surv., vol. 9, no. 3, Sept. 1977
43. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981
44. T. Agerwala, “Putting Petri nets to work,” Computer, vol. 1, no. 1, pp. 85–94, Dec. 1979
45. R. M. Karp and R. E. Miller, “Parallel program schemata,” J. Comput. Syst. Sci., vol. 3, no. 2, pp. 147–195, May 1969
46. E. A. Lee and D. G. Messerschmitt, “Pipeline interleaved programmable DSP’s: Parts I and II,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1320–1333 and 1334–1345, Sept. 1987
47. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. Comput., vol. C-36, no. 2, pp. 24–35, Jan. 1987
48. E. G. Coffman, Jr., Computer and Job Scheduling Theory. New York, NY: Wiley, 1976
49. T. L. Adam, K. M. Chandy, and J. R. Dickson, “A comparison of list schedules for parallel processing systems,” Commun. Assoc. Comput. Mach., vol. 17, no. 12, pp. 685–690, Dec. 1974
50. T. C. Hu, “Parallel sequencing and assembly line problems,” Operations Res., vol. 9, no. 6, pp. 841-848,1961
51. W. H. Kohler, “A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems,” IEEE Trans. Comput., vol. C-24, pp. 1235–1238, Dec. 1975
52. K. M. Kavi, B. P. Buckles, and U. N. Bhat, “A formal definition of data flow graph models,” IEEE Trans. Comput., vol. C-35, no. 11, pp. 940–948, Nov. 1986