Cache Operations by MRU Change
IEEE Transactions on Computers
Sheaved memory: architectural support for state saving and restoration in pages systems
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Computer programming and architecture: The VAX
Computer programming and architecture: The VAX
A Checkpointing Page Store for Write-Once Optical Disk
IEEE Transactions on Computers
Recoverable Distributed Shared Virtual Memory
IEEE Transactions on Computers
Real-time, concurrent checkpoint for parallel programs
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Virtual Checkpoints: Architecture and Performance
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Persistent memory: a storage architecture for object-oriented database systems
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
Dynamic space-sharing in computer systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Ensuring Data Security and Integrity with a Fast Stable Storage
Proceedings of the Fourth International Conference on Data Engineering
| Hi-index | 14.98 |
This paper proposes a cost effective fault tolerant memory structure. It uses the modified status of virtual memory pages as the basis to propose a system with two classes of memory. One class is for modified pages, and the other is for pages not modified. The term hybrid memory system is used to describe this system. Results show the cost savings for a hybrid system over a traditional fault tolerant system. Hybrid virtual memory algorithms are proposed for the system. The traditional lifetime and space-time measures of virtual memory algorithms are extended for the hybrid algorithms. This includes 驴cost-weighted驴 measures to reflect the fact that the two classes of memory may have different resource allocation constraints. A theoretical result is presented for the effect of combining the hybrid lifetime functions. Finally, a framework for developing hybrid algorithms is presented with experimental results illustrating the analysis. It is shown that the lifetime measure for the hybrid policies can show improvements over traditional algorithms.