The Community for Technology Leaders
Green Image
<p>The authors present a dynamically partitionable circular bus network (PCBN) and efficient algorithms for maximizing its utilization. In their approach, a distributed network is transformed into a graph, in which a vertex represents a communication request and an edge denotes the conflict between a pair of communication requests. A graph traversal algorithm is applied to the graph to identify some maximal independent sets of vertices. The communication requests corresponding to the vertices of a maximum independent set call proceed in parallel. By computing the expected size of the maximal independent sets of a graph, the improvement ratio of the network can be obtained. The network control and synchronization techniques of PCBN are described in detail. The idling problem in the execution of nonconflicting requests is also discussed.</p>
Index Termshigh-performance partitionable circular bus network; distributed systems; distributednetwork; graph traversal algorithm; maximal independent sets; synchronization; idlingproblem; nonconflicting requests; distributed processing; graph colouring; synchronisation

T. Woo, T. Feng and S. Su, "PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1298-1307, 1993.
93 ms
(Ver 3.3 (11022016))