Compile-time scheduling and assignment of data-flow program graphs with data-dependent iteration
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (11) , 1225-1238
- https://doi.org/10.1109/12.102826
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- A block diagram compiler for a digital signal processing MIMD computerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An efficient pipelined dataflow processor architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- New solutions to the mapping problem of parallel systems: The evolution approachParallel Computing, 1987
- An Architectural Comparison of Dataflow SystemsComputer, 1986
- A Survey of Proposed Architectures for the Execution of Functional LanguagesIEEE Transactions on Computers, 1984
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- A Practical Data Flow ComputerComputer, 1982
- A Task Allocation Model for Distributed Computing SystemsIEEE Transactions on Computers, 1982
- Data Flow SupercomputersComputer, 1980
- Path Length Computations on Graph Models of ComputationsIEEE Transactions on Computers, 1969