Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Systems, Networks, and Communications
Volume 2008 (2008), Article ID 294106, 9 pages
http://dx.doi.org/10.1155/2008/294106
Research Article

Generalized Load Sharing for Homogeneous Networks of Distributed Environment

1Department of Computer Science and Engineering, Periyar Maniammai University, Vallam Thanjavur 613403, India
2Department of Computer Science and Engineering, SRM Institute of Management and Technology, New Delhi 201204, India
3Department of Computer Applications, Periyar Maniammai University, Vallam Thanjavur 613403, India

Received 16 January 2008; Revised 9 March 2008; Accepted 11 April 2008

Academic Editor: Chadi Assi

Copyright © 2008 A. Satheesh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We propose a method for job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified for lacking sufficient memory space to serve jobs, one or more jobs of the node will be migrated to remote nodes with low memory allocations. If the memory space is sufficiently large, the jobs will be scheduled by a CPU-based load sharing policy. Following the principle of sharing both CPU and memory resources, we present several load sharing alternatives. Our objective is to reduce the number of page faults caused by unbalanced memory allocations for jobs among distributed nodes, so that overall performance of a distributed system can be significantly improved. We have conducted trace-driven simulations to compare CPU-based load sharing policies with our policies. We show that our load sharing policies not only improve performance of memory bound jobs, but also maintain the same load sharing quality as the CPU-based policies for CPU-bound jobs. Regarding remote execution and preemptive migration strategies, our experiments indicate that a strategy selection in load sharing is dependent on the amount of memory demand of jobs, remote execution is more effective for memory-bound jobs, and preemptive migration is more effective for CPU-bound jobs. Our CPU-memory-based policy using either high performance or high throughput approach and using the remote execution strategy performs the best for both CPU-bound and memory-bound job in homogeneous networks of distributed environment.