Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Implementing global memory management in a workstation cluster
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Reducing network latency using subpages in a global memory environment
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Efficient cooperative caching using hints
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
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
Global Memory Management in Client-Server Database Architectures
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
The Architecture of an Integrated Local Network
IEEE Journal on Selected Areas in Communications
Implementing cooperative prefetching and caching in a globally-managed memory system
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Techniques for energy minimization of communication pipelines
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
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
AMVA techniques for high service time variability
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hint-based cooperative caching
ACM Transactions on Computer Systems (TOCS)
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
Mean Value Analysis: a Personal Account
Performance Evaluation: Origins and Directions
User-level communication based cooperative caching
ACM SIGOPS Operating Systems Review
Performance Analysis of Server Sharing Collectives for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
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
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)
A peer-to-peer IO buffering service based on RAM-grid
International Journal of Autonomous and Adaptive Communications Systems
Performance analysis of server sharing collectives for content distribution
IWQoS'03 Proceedings of the 11th international conference on Quality of service
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
A distributed paging RAM grid system for wide-area memory sharing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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 |
New high-speed switched networks have reduced the latency of network page transfers significantly below that of local disk. This trend has led to the development of systems that use network-wide memory, or global memory, as a cache for virtual memory pages or file blocks. A crucial issue in the implementation of these global memory systems is the selection of the target nodes to receive replaced pages. Current systems use various forms of an approximate global LRU algorithm for making these selections. However, using age information alone can lead to suboptimal performance in two ways. First, workload characteristics can lead to uneven distributions of old pages across servers, causing increased contention delays. Second, the global memory traffic imposed on a node can degrade the performance of local jobs on that node.This paper studies the potential benefit and the potential harm of using load information, in addition to age information, in global memory replacement policies. Using an analytic queueing network model, we show the extent to which server load can degrade remote memory latency and how load balancing solves this problem. Load balancing requests can cause the system to deviate from the global LRU replacement policy, however. Using trace-driven simulation, we study the impact on application performance of deviating from the LRU replacement policy. We find that deviating from strict LRU, even significantly for some applications, does not affect application performance. Based upon these results, we conclude that global memory systems can gain substantial benefit from load balancing requests with little harm from suboptimal replacement decisions. Finally, we illustrate the use of the intuition gained from the model and simulation experiments by proposing a new family of algorithms that incorporate load considerations as well as age information in global memory replacement decisions.