The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Synchronous data flow
Abstract
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the run-time overhead usually associated with data flow evaporates. Multiple sample rates within the same system are easily and naturally handled. Conditions for correctness of SDF graph are explained and scheduling algorithms are described for homogeneous parallel processors sharing memory. A preliminary SDF software system for automatically generating assembly language code for DSP microcomputers is described. Two new efficiency techniques are introduced, static buffering and an extension to SDF to efficiently implement conditionals.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Petri Net theory and the modeling of systems
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90066-0 · Cited by 3,609
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
Lee, E. A., & Messerschmitt, D. G. (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.5009446 · Cited by 1,318
Self-citationPeterson, J. L. (1977) · ACM Computing Surveys · doi:10.1145/356698.356702 · Cited by 1,179
Gold, B., & Rader, C. M. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 940
Parallel Sequencing and Assembly Line Problems
Hu, T. C. (1961) · Operations Research · doi:10.1287/opre.9.6.841 · Cited by 898
Dennis (1980) · Computer · doi:10.1109/mc.1980.1653418 · Cited by 580
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Karp, R. M., & Miller, R. E. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114108 · Cited by 421
The maximum sampling rate of digital filters under hardware speed constraints
Renfors, M., & Neuvo, Y. A. (1981) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1981.1084972 · Cited by 301
Ackerman (1982) · Computer · doi:10.1109/mc.1982.1653938 · Cited by 290
Davis, & Keller (1982) · Computer · doi:10.1109/mc.1982.1653939 · Cited by 287
High-Speed Multiprocessors and Compilation Techniques
Padua, Kuck, & Lawrie (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675676 · Cited by 270
Analysis of linear digital networks
Crochiere, R. E., & Oppenheim, A. V. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9793 · Cited by 200
Rumbaugh, J. E. (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.5009292 · Cited by 105
On-Line Simulation of Block-Diagram Systems
Dertouzos, M. L., Kaliski, M. E., & Polzen, K. P. (1969) · IEEE Transactions on Computers · doi:10.1109/t-c.1969.222661 · Cited by 9
Cited by
Taming heterogeneity - the Ptolemy approach
Eker, J., Janneck, J. W., Lee, E. A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., & Xiong, Y. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2002.805829 · Cited by 1,074
Self-citationHigh-Level Synthesis for FPGAs: From Prototyping to Deployment
Cong, J., Liu, B., Neuendorffer, S., Noguera, J., Vissers, K., & Zhang, Z. (2011) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2011.2110592 · Cited by 846
FPGA-Based Accelerators of Deep Learning Networks for Learning and Classification: A Review
Shawahna, A., Sait, S. M., & El-Maleh, A. (2019) · IEEE Access · doi:10.1109/access.2018.2890150 · Cited by 496
System level performance analysis – the SymTA/S approach
Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., & Ernst, R. (2005) · IEE Proceedings - Computers and Digital Techniques · doi:10.1049/ip-cdt:20045088 · Cited by 488
Gatouillat, A., Badr, Y., Massot, B., & Sejdic, E. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2849014 · Cited by 429
Metadata
- Authors
- Lee, E. A., & Messerschmitt, D. G.
- Venue
- Proceedings of the IEEE
- Published
- 1987
- Volume
- 75
- Issue
- 9
- Pages
- 1235-1245
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2091158003
- Cited by
- 1,842
- References
- 14
- FWCI
- 5.70
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.