Loading...
Please wait, while we are loading the content...
Similar Documents
Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Varavithya, Vara Mohapatra, Prasant |
| Description | In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks. We first analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asynchronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The serialization is done using a technique based on grouping of the switching elements. The preliminary simulation results are encouraging as it lowers the latency by almost a factor of 4 when compared with the software multicasting approach proposed earlier. 1 Introduction Multistage Interconnection Networks (MINs) have been extensively studied and adopted as an interconnection fabric for multiprocessor systems. Multiprocessor systems increase their computing speed by performing several computations concurrently. These activities often require coordination and synchronization between processing el... |
| File Format | |
| Language | English |
| Publisher Date | 1997-01-01 |
| Publisher Institution | in Proceedings of the 1997 International Conference on Parallel Processing |
| Access Restriction | Open |
| Subject Keyword | Necessary Condition Wormhole Routed Multistage Interconnection Network Switching Element Several Computation Tree-based Multicasting Algorithm Preliminary Simulation Result Tree-based Multicasting Introduction Multistage Interconnection Network Interconnection Fabric Multiprocessor System Asynchronous Tree-based Multicasting Algorithm Multistage Interconnection Network |
| Content Type | Text |
| Resource Type | Article |
