Loading...

Perfect load balancing on the star interconnection network

Imani, N ; Sharif University of Technology | 2007

256 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11227-007-0128-2
  3. Publisher: 2007
  4. Abstract:
  5. In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n+1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n 2-3n+0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms. © 2007 Springer Science+Business Media, LLC
  6. Keywords:
  7. Computer resource management ; Hierarchical systems ; Resource allocation ; Scheduling algorithms ; Arbitrary spanning tree ; Hierarchical algorithm ; Multicomputers ; Star graph ; Tree embedding ; Interconnection networks
  8. Source: Journal of Supercomputing ; Volume 41, Issue 3 , 2007 , Pages 269-286 ; 09208542 (ISSN)
  9. URL: https://link.springer.com/article/10.1007%2Fs11227-007-0128-2