Generalized load sharing for distributed operating systems

Authors:
A. Satheesh;S. Bama
Affiliations:
Department of Information Technology, Periyar Maniammai University, Vallam, Thanjavur, India;Department of Computer Science and Engineering, College of Engineering, Anna University, Guindy, Chennai, India
Venue:
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Year:
2007

Citing 12
Cited 0

A Trace-Driven Simulation Study of Dynamic Load Balancing

IEEE Transactions on Software Engineering
The limited performance benefits of migrating active processes for load sharing

SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme

IEEE Transactions on Software Engineering
Utopia: a load sharing facility for large, heterogeneous distributed computer systems

Software—Practice & Experience
Implementing global memory management in a workstation cluster

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Adaptive page replacement based on memory reference behavior

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Managing server load in global memory systems

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Availability and utility of idle memory in workstation clusters

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improved Strategies for Dynamic Load Balancing

IEEE Concurrency
Improving Distributed Workload Performance by Sharing Both CPU and Memory Resources

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm

IEEE Transactions on Parallel and Distributed Systems
Hashing based traffic partitioning in a multicast-multipath MPLS network model

LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a method for job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. The objective of this paper is to reduce the number of page faults caused by unbalanced memory allocations for jobs among distributed nodes, which improves the overall performance of a distributed system. The proposed method, which uses the high performance and high throughput approach with remote execution strategy performs the best for both CPU-bound and memory-bound jobs in homogeneous as well as in the heterogeneous networks in a distributed system.