''Configuring the Circuit Switched Tree for Point-to-Point and Multicast Communication''
Jerry L. Trahan
Proc. IASTED Conference on Parallel and Distributed Computing and Systems (PDCS 2004), pp. 392-397
The Circuit Switched Tree (CST) has been shown to be an important
interconnect for dynamically reconfigurable architectures,
on which several problems have extremely fast solutions. A vital component
of communicating through the CST is the configuration of its switches.
In this paper, we present configuration algorithms for two classes of
CST communications: oriented, well-nested sets and multicasting.
Our algorithms are fast (requiring at most a few clock cycles) and work
without any centralized control, using only local information of the
This work was supported in part by
the National Science Foundation under grant numbers CCR-0310916 and CCR-0073429.