Enhancing the performance of a dynamically partitionable bus network using a graph coloring algorithm

  • Authors:

  • Tai-Kuo Woo;Stanley Y. W. Su;Richard Newman-Wolfe

  • Affiliations:

  • Database Systems Research and Development Center and Department of Computer and Information Sciences, University of Florida, Gainesville, FL;Database Systems Research and Development Center and Department of Computer and Information Sciences, University of Florida, Gainesville, FL;Database Systems Research and Development Center and Department of Computer and Information Sciences, University of Florida, Gainesville, FL

  • Venue:
  • CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient dynamic graph traversal algorithm is used to identify non-conflicting requests and to allocate network resources in a dynamically partitionable bus network (DPBN). A special processor receives from the control computer of a partitionable bus network an adjacency matrix which indicates conflicts among requests. It applies the dynamic graph traversal algorithm and returns the identified non-conflicting requests to the control computer. The control computer then physically partitions the network into a number of subnetworks for processing non-conflicting requests in parallel. The results of performance evaluation show a forty percent decrease of network delay as compared with a fully utilized, but unpartitioned local area network.