By Topic

PCBN: a high-performance partitionable circular bus network for distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tai-Kuo Woo ; Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA ; S. Y. W. Su

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

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:4 ,  Issue: 12 )