Iteration bounds of single-rate data flow graphs for concurrent processing
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 40 (9) , 629-634
- https://doi.org/10.1109/81.244917
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Transforming periodic synchronous multiprocessor programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A graph theoretic technique for the generation of systolic implementations for shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986
- On supercomputing with systolic/wavefront array processorsProceedings of the IEEE, 1984
- Data Flow Program GraphsComputer, 1982
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975
- Enumeration of the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1973
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed GraphJournal of the ACM, 1972
- An efficient search algorithm to find the elementary circuits of a graphCommunications of the ACM, 1970
- Algorithm 97: Shortest pathCommunications of the ACM, 1962