Area optimization of dataflow-graph mappings
- 1 March 1992
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 18 (3) , 297-311
- https://doi.org/10.1016/0167-8191(92)90098-r
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- A random, distributed algorithm to embed trees in partially faulty processor arraysJournal of Parallel and Distributed Computing, 1991
- Addressing, routing, and broadcasting in hexagonal mesh multiprocessorsIEEE Transactions on Computers, 1990
- A data-driven VLSI array for arbitrary algorithmsComputer, 1988
- The Concept and Implementation of Data-Driven Processor ArraysComputer, 1987
- Embedding Tree Structures in VLSI Hexagonal ArraysIEEE Transactions on Computers, 1984
- Data Flow Program GraphsComputer, 1982
- Data Flow SupercomputersComputer, 1980