Sciweavers

Share
IPPS
1997
IEEE

On the Dynamic Initialization of Parallel Computers

12 years 4 months ago
On the Dynamic Initialization of Parallel Computers
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 ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where IPPS
Authors Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
Comments (0)
books