Joint application mapping/interconnect synthesis techniques for embedded chip-scale multiprocessors
| Autor: | Shuvra S. Bhattacharyya, Neal K. Bambha |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Strongly connected component
Computer science Distributed computing Multiprocessing Parallel computing Deadlock Network topology Bottleneck Multiprocessor scheduling Scheduling (computing) Computational Theory and Mathematics Hardware and Architecture High-level synthesis Signal Processing System on a chip |
| Zdroj: | IEEE Transactions on Parallel and Distributed Systems. 16:99-112 |
| ISSN: | 1045-9219 |
| DOI: | 10.1109/tpds.2005.20 |
| Popis: | As transistor sizes shrink, interconnects represent an increasing bottleneck for chip designers. Several groups are developing new interconnection methods and system architectures to cope with this trend. New architectures require new methods for high-level application mapping and hardware/software codesign. We present high-level scheduling and interconnect topology synthesis techniques for embedded multiprocessor systems-on-chip that are streamlined for one or more digital signal processing applications. That is, we seek to synthesize an application-specific interconnect topology. We show that flexible interconnect topologies utilizing low-hop communication between processors offer advantages for reduced power and latency. We show that existing multiprocessor scheduling algorithms can deadlock if the topology graph is not strongly connected, or if a constraint is imposed on the maximum number of hops allowed for communication. We detail an efficient algorithm that can be used in conjunction with existing scheduling algorithms for avoiding this deadlock. We show that it is advantageous to perform application scheduling and interconnect synthesis jointly, and present a probabilistic scheduling/interconnect algorithm that utilizes graph isomorphism to pare the design space. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|