Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
The Sprite Network Operating System
Computer
Node autonomy in distributed systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
The auction algorithm for the transportation problem
Annals of Operations Research
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Munin: distributed shared memory based on type-specific memory coherence
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Distributed Shared Memory: A Survey of Issues and Algorithms
Computer - Distributed computing systems: separate resources acting as one
Performance analysis of coherency control policies through lock retention
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Experiences in integrating distributed shared memory with virtual memory management
ACM SIGOPS Operating Systems Review
A quantitative analysis of cache policies for scalable network file systems
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The directory-based cache coherence protocol for the DASH multiprocessor
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Global Memory Management in Client-Server Database Architectures
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Design issues of a cooperative cache with no coherence problems
Proceedings of the fifth workshop on I/O in parallel and distributed systems
Studies on striping and buffer caching issues for the software RAID file system
Journal of Systems Architecture: the EUROMICRO Journal
An Efficient Caching Scheme for Software RAID File System in Workstation Clusters
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
GEMA: An Object Replacement Algorithm for Cooperative Web Proxy Systems
Multimedia Tools and Applications
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of a variable bit rate caching algorithm for continuous media data
Multimedia Tools and Applications
Cooperation in Multiorganization Matching
Approximation and Online Algorithms
| Hi-index | 0.00 |
The possibility of fast access to the main memory of remote sites has been advanced as a potential performance improvement in distributed systems. Even if a page is not available in local memory, sites need not do a disk access. Instead, the sites can use efficient mechanisms that support rapid request/response exchanges in order to access pages that are currently buffered at a remote site. Hardware and software support in such a remote caching architecture must also include algorithms that determine which pages should be buffered at what sites. When each site uses the classic LRU replacement algorithm, performance can be much worse than optimal in many system configurations. Because sites do not coordinate individual decisions, overall system buffering/caching decisions yield very inefficient global configurations. This paper proposes an easily implementable modification of the LRU replacement algorithm for LAN environments that reduces replication. The algorithm substantially improves hit-ratios驴and thus performance驴over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions compared to general network topologies. Two implications of two variations of the algorithm are explored. In an environment where the network is not a performance bottleneck, and where performance is memory-limited, performance of the proposed replacement algorithm is shown to be close to optimal.