On the Dynamic Initialization of Parallel Computers

  • Authors:

  • Stephan Olariu;Ivan Stojmenović;Albert Zomaya

  • Affiliations:

  • Department of Computer Science, Old Dominion University, Norfolk, VA 23529, U.S.A.;Department of Computer Science, University of Ottawa, Ottawa, Ontario, K1N 9B4, Canada;Department of Electrical and Electronic Engineering, University of Western Australia, Perth, WA 6007, Australia

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to be contended with at power-up time. The problem is fundamental, for virtually all parallel algorithms known to the authors assume that the processors know their global coordinates within the newly created entity. We refer to this problem as the initialization problem. Rather surprisingly, the initialization problem has not received much attention in the literature. Our main contribution is to present parallel algorithms for the initialization problem on a number of network topologies, including complete binary trees, meshes of trees, pyramids, linear arrays, rings, meshes, tori, higher dimensional meshes and tori, hypercubes, butterflies, linear arrays with a global bus, rings with a global bus and meshes with multiple broadcasting, under various assumptions about edge labels, leader existence, and a priori knowledge of the number of nodes in the network. With two exceptions, the proposed algorithms are optimal.