| Title: | PROBABILISTIC LOAD BALANCING WITH OPTIMAL RESOURCES SET OF NODES IN CLUSTERS |
| DOI No: | 10.1142/9781860948534_0005 |
| Source: | INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 45-49)
|
| Author(s): | N. P. GOPALAN
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamilnadu, India
K. NAGARAJAN
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli – 620 015, Tamilnadu, India
|
| Abstract: | A probability model for task allocation to nodes in a cluster for better CPU utilization and reduces I/O and communication overhead is presented in this paper. For the NP-hard problem of task assignment, load balancing is done with a local and global scheduler (LS and GS). A newly arriving task need not wait at the home node (HN) for the want of resources as GS takes care of it. Using three different queues for the processes, GS assigns the best set of optimal resources at a foreign node (FN) with a minimal transfer cost to the processes. The experimentally simulated results show that the model compares well with the existing models and well suited for time and space sharing systems with minimal I/O overhead and excellent resource utilization. |
| Full Text: | View full text in PDF format (286KB) |
| TOC: | Back to Table of Contents |
|
|
