This Article 
 Bibliographic References 
 Add to: 
PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems
December 1993 (vol. 4 no. 12)
pp. 1298-1307

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.

[1] B. W. Arden and R. Ginosar, "MP/C: A multiprocessor computer architecture,"IEEE Trans. Comput., vol. C-31, pp. 455-473, May 1982.
[2] C. K. Baru and S. Y. W. Su, "The architecture of SM3: A dynamically partitionable multicomputer system,"IEEE Trans. Comput., vol. C-35, pp. 790-801, Sept. 1986.
[3] S. K. Chang and A. Gill, "Algorithmic solution of the change-making problem,"J. Ass. Comput. Mach., vol. 17, pp. 113-122, Jan. 1970.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[5] R. M. Karp, "Reducibility among combinatorial problems," in R. E. Miller and J. W. Thatcher, Eds.,Complexity of Computer Computations. New York: Plenum, 1972.
[6] S. Kartashev and S. Kartashev, "Dynamic architecture: Problems and solutions,"Computer, vol. 11, pp. 7-15, July 1978.
[7] D. Matula, "On the complete subgraphs of a random graph," inProc. 2nd Chapel Hill Conf. Combinatorial Math. Appl., Univ. North Carolina, Chapel Hill, 1970, pp. 356-369.
[8] J. L. Mott, A. Kandel, and T. P. Baker,Discrete Mathematics for Computer Scientists. Reston, VA: Reston Publishing, a Prentice-Hall Co., 1983.
[9] S. Y. W. Su and C. K. Baru, "Dynamically partitionable multicomputers with switchable memory,"J. Parallel Distributed Comput., vol. 1, pp. 152-184, Nov. 1984.
[10] C. C. Wang, "An algorithm for the chromatic number of a graph,"J. Ass. Comput. Mach., vol. 21, pp. 385-391, July 1974.
[11] T. K. Woo, "Improving resource utilization in a partitionable bus network using graph coloring and coin-changing algorithms," Ph.D. dissertation, Dep. Comput. Inform. Sci., Univ. Florida, Gainesville, May 1989.
[12] T. K. Woo, "Achieving parallel communication in distributed systems," inProc. Phoenix Conf. Comput. Commun., Scottsdale, AZ, Mar. 1991, pp. 160-166.
[13] T. K. Woo, S. Y. W. Su, and R. Newman-Wolfe, "Resource allocation in a partitionable bus network using a graph coloring algorithm,"IEEE Trans. Commun., vol. 39, pp. 1794-1801, Dec. 1991.

Index Terms:
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.K. Woo, S.Y.W. Su, T.Y. Feng, "PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1298-1307, Dec. 1993, doi:10.1109/71.250112
Usage of this product signifies your acceptance of the Terms of Use.