Configuring the circuit switched tree for well- nested and multicast communication
Document Type
Conference Proceeding
Publication Date
12-1-2004
Abstract
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 information local to the processing elements.
Publication Source (Journal or Book title)
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
First Page
392
Last Page
397
Recommended Citation
Roy, K., Trahan, J., & Vaidyanathan, R. (2004). Configuring the circuit switched tree for well- nested and multicast communication. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, 16, 392-397. Retrieved from https://repository.lsu.edu/eecs_pubs/1739