LEFF, A., WOLF, J. L., AND YU, P. S. 1996. Efficient lru-based buffering in a lan remote caching architecture. IEEE Transactions on Parallel and Distributed Systems 7, 2 (February), 191--206. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Self-Tuning Memory Management for Data Servers - Weikum, König, Kraiss.. (1999) (8 citations) (Correct)
....faster than performing the disk access. Exploiting this option in a systematic manner amounts to a distributed caching algorithm, which essentially controls the dynamic replication of data objects (i.e. fixed size pages or variable size documents) in the caches of the underlying computers [6, 9, 14]. Two simple heuristics for this purpose are egoistic caching, where each server simply runs a local cache replacement algorithm such as LRU or LRU k, and the other extreme, called altruistic caching. Egoistic caching views remotely cached data that is not locally cached as an opportunity, but ....
Leff, A., Wolf, J.L., Yu, P.S., Efficient LRU-based Buffering in a LAN Remote Caching Architecture, IEEE Transactions on Parallel and Distributed Systems 7(2), 1996.
Global Memory Management for Workstation Networks - Feeley (1996) (2 citations) (Correct)
....complex because there are three possible costs for each access (i.e. local, remote, and disk) and (3) the execution streams of all nodes must be considered because the changes in the memory of one node can change the performance of others. One approach to optimality has been taken by Leff et al. [48, 47]. They assume a static access probability for every data page and thereby reduce the problem to that of finding an optimal initial placement of these data pages in workstation memories. This assignment of data to memories does not change over time because the access probabilities are static; as a ....
Avraham Leff, Joel L. Wolf, and Philip S. Yu. Efficient LRU-based buffering in a LAN remote caching architecture. IEEE Transactions on Parallel and Distributed Systems, 7(2), February 1996.
Striping and Buffer Caching for Software RAID File Systems.. - Kim, Eom, Noh, Won (1999) (1 citation) (Correct)
....flexible nature and use a hybrid method that combines the RAID 1 and RAID 5 distribution methods to enhance performance. The second issue concerns buffer caching. Buffer caching is imperative for hiding the I O bottleneck of file systems and has received considerable attention in the literature [3, 9, 12] (and references within) In this paper, we show that caching schemes developed to date for conventional distributed systems are not adequate for software RAID file systems due to the small write problem apparent in RAID systems. To reckon with this problem, we introduce the ExODP caching scheme ....
....for redundancy. 4. Buffer Caching: the ExODP scheme In this section, we consider the ExODP (Exclusively Old Data and Parity) caching scheme that is effective when using a RAID 5 striping method. Existing caching schemes that have been proposed and or used for conventional distributed systems [9, 12] inherently involve a read modifywrite activity which is required for small writes [4] when writing data. That is, caching schemes that do not explicitly consider the parity distribution of RAID 5 striping methods require four disk accesses to maintain the fault tolerant feature of software RAID ....
[Article contains additional citation context not shown here]
A. Leff, J. L. Wolf, , and P. S. Yu. Efficient LRU-Based Buffering in a LAN Remote Caching Architecture. IEEE Transactions on Parallel and Distributed Systems, 7(2):191-- 206, February 1996.
Design Issues of a Cooperative Cache with no Coherence Problems - Labarta (1997) (1 citation) (Correct)
....[24] In their work, clients are allowed to make local decisions about the location of a block based on hints. These local decisions decrease the number of times clients request information from managers. Leff et al. have theoretically analyzed the effects of remote memory on cache activities [17, 18]. In their latest work, they also propose a mechanism which avoids the cachecoherence problem. The main difference with our proposal is that our servers do not need to communicate among themselves to know the placement of a given block. Furthermore, only a cooperative replacement algorithm was ....
Leff, A., Wolf, J. L., and Yu, P. S. Efficient LRU-based buffering in a LAN remote caching architecture. IEEE Transactions on Parallel and Distributed Systems 7, 2 (February 1996), 191--206.
Cash: Distributed Cooperative Buffer Caching - Decoro, Langston, Weinberger (2003) (Correct)
No context found.
LEFF, A., WOLF, J. L., AND YU, P. S. 1996. Efficient lru-based buffering in a lan remote caching architecture. IEEE Transactions on Parallel and Distributed Systems 7, 2 (February), 191--206.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC