Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of a Distributed Question/Answering System
IEEE Transactions on Parallel and Distributed Systems
Dynamic Load Sharing With Unknown Memory Demands in Clusters
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Adaptive Memory Allocations in Clusters to Handle Unexpectedly Large Data-Intensive Jobs
IEEE Transactions on Parallel and Distributed Systems
Memory latency consideration for load sharing on heterogeneous network of workstations
Journal of Systems Architecture: the EUROMICRO Journal
Scheduling Security-Critical Real-Time Applications on Clusters
IEEE Transactions on Computers
A hybrid load balancing policy underlying grid computing environment
Computer Standards & Interfaces
Design and analysis of a load balancing strategy in data grids
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Journal of Network and Computer Applications
Real-time scheduling with quality of security constraints
International Journal of High Performance Computing and Networking
Generalized load sharing for homogeneous networks of distributed environment
Journal of Computer Systems, Networks, and Communications
Dynamic load balancing for I/O-intensive applications on clusters
ACM Transactions on Storage (TOS)
Generalized load sharing for distributed operating systems
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
Energy optimization schemes in cluster with virtual machines
Cluster Computing
Towards a green cluster through dynamic remapping of virtual machines
Future Generation Computer Systems
A novel approach to enhance distributed virtual memory
Computers and Electrical Engineering
Efficient dynamic itinerary and memory allocation for mobile agents
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
| Hi-index | 0.00 |
We develop and examine 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, a CPU-based load sharing policy will schedule the jobs. 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 jobs.