K. Roy, J.L. Trahan, and R. Vaidyanathan (USA)
Reconfigurable architecture, Circuit Switched Tree, config uration algorithm, multicasting, parallel algorithm
The Circuit Switched Tree CST has been shown to be an important interconnect for dynamically reconfigurable ar chitectures, on which several problems have extremely fast solutions. A vital component of communicating through the CST is the configuration of its switches. In this pa per, we present configuration algorithms for two classes of CST communications: oriented, well-nested sets and mul ticasting. Our algorithms are fast requiring at most a few clock cycles and work without any centralized control, us ing only information local to the processing elements.
Important Links:
Go Back
