Name
Abstract | ||
|---|---|---|
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such architectures. A CST consists of processing elements (PEs) and switches. PEs communicate among themselves using the links of the tree. A key component for successful communication is scheduling individual communications and the configuration of the CST switches. This paper presents a scheduling and configuration algorithm for communications on a CST where conflicts force multiple rounds of routing to perform all communications. The paper also explains how to apply the algorithm to two important classes of communications, well-nested and monotonic, for which the algorithm is optimal and efficient. The algorithm is distributed and requires only local knowledge, yet it captures the global picture to ensure proper communication. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/IPDPS.2005.149 | IPDPS |
Keywords | Field | DocType |
configuration algorithm,circuit switched tree,multiple width communications,global picture,proper communication,fast solution,successful communication,individual communication,dynamically reconfigurable architecture,important class,key component,computer architecture,circuit switched,local knowledge,configuration management,routing,scheduling algorithm,field programmable gate arrays,switches,scheduling | Monotonic function,Circuit switching,Computer science,Scheduling (computing),Parallel computing,Multicast communication,Configuration management,Processor scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2312-9 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishnendu Roy | 1 | 28 | 4.94 |
| Ramachandran Vaidyanathan | 2 | 252 | 28.72 |
| Jerry L. Trahan | 3 | 206 | 22.64 |