3 citations found. Retrieving documents...
K.M. Chew, J. Reddy, T. H. Romer, and A. Silberschatz. Kernel support for recoverablepersistent virtual memory.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Recoverable Distributed Shared Memory.. - Kermarrec.. (1995)   (29 citations)  (Correct)

....cases, the replication required to ensure the persistency of data is used to avoid page faults during the normal execution. This phenomenon depends on the applications behaviour. 5 Related Work Many recoverable DSM systems that have been proposed [Wu Fuchs 90, Tam Hsu 90, Elnozahy et al. 92, Chew et al. 93] are usually based either on the implementation of stable storage which requires specific hardwares, or on the use of disks to store recovery data. Our approach is similar to Wu and Fuchs one by integrating fault tolerance and memory management. A key difference with their work is that we store ....

K-M. Chew, A. J. Reddy, T. H. Romer, and A. Silberschatz. Kernel Support for Recoverable-Persistent Virtual Memory. In USENIX Mach III Symposium, pp 215--234, April 1993.


A Recoverable Distributed Shared Memory.. - Kermarrec.. (1995)   (29 citations)  (Correct)

....overhead has been measured for two applications with small problem sizes. Larger sets of data may induce swapping on disks and then the performance degradation due to the fault tolerance mechanisms would be more important. 5 Related Work Many recoverable DSM systems that have been proposed [23, 21, 8, 7, 19] are usually based either on the implementation of stable storages which require specific hardware, or on the use of disks to store recovery data. Our approach is similar to Wu and Fuchs one by integrating fault tolerance and memory management. A key difference with their work is that we store ....

K-M. Chew, A. J. Reddy, T. H. Romer, and A. Silberschatz. Kernel Support for Recoverable-Persistent Virtual Memory. In USENIX Mach III Symposium, pages 215--234, April 1993.


Buffer Replacement Algorithms for Multimedia Storage Systems - Özden, Rastogi.. (1996)   (19 citations)  Self-citation (Silberschatz)   (Correct)

....are sufficiently long. Moreover, we show that the overhead of DISTANCE is comparable to that of LRU and MRU, which makes DISTANCE a prime candidate for being used as a buffer replacement scheme in multimedia storage systems. There have been many studies on buffer caching in storage system systems [15, 5, 10, 4]. However, these studies do not address the issue of caching in storage systems that support continuous media data. In [7] the effects of various buffer replacement algorithms on the number of glitches that will be experienced by clients are studied. In this comprehensive study, no guarantees are ....

K.M. Chew, J. Reddy, T. H. Romer, and A. Silberschatz. Kernel support for recoverablepersistent virtual memory.

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