ACM Home Page
Please provide us with feedback. Feedback
Lightweight recoverable virtual memory
Full text PdfPdf (1.73 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 12 ,  Issue 1  (February 1994) table of contents
Special issue on operating systems principles
Pages: 33 - 57  
Year of Publication: 1994
ISSN:0734-2071
Authors
M. Satyanarayanan  Carnegie Mellon Univ., Pittsburgh, PA
Henry H. Mashburn  Carnegie Mellon Univ., Pittsburgh, PA
Puneet Kumar  Carnegie Mellon Univ., Pittsburgh, PA
David C. Steere  Carnegie Mellon Univ., Pittsburgh, PA
James J. Kistler  Carnegie Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 78,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/174613.174615
What is a DOI?

ABSTRACT

Recoverable virtual memoryrefers to regions of a virtual address space on which transactional guarantees are offered. This article describes RVM, an efficient, portable, and easily used implementation of recoverable virtual memory for Unix environments. A unique characteristic of RVM is that it allows independent control over the transactional properties of atomicity, permanence, and serializability. This leads to considerable flexibility in the use of RVM, potentially enlarging the range of applications that can benefit from transactions. It also simplifies the layering of functionality such as nesting and distribution. The article shows that RVM performs well over its intended range of usage even though it does not benefit from specialized operating system support. It also demonstrates the importance of intra- and inter-transaction optimizations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ANDRADE, J. M., CARGES, M. T., AND KOVACH, K.R. 1989. Building a transaction processing system on UNIX systems. In UnlForum Conference Proceedings
 
2
BARON, R. V, BLACK, D. L, BOLOSK'Y, W., CHEW, J., GOLUB, D. B., RASHID, R. F., TEVANIAN, A., JR. AND YOUNG, M. W. 1987. Mach Kernel Interface Monual. School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
 
3
4
5
6
 
7
 
8
COOPER, E C. AND DRAVES, R. P. 1988. C threads. Tech. Rep. CMU-CS-88-154, Dept. of Computer Science, Carneg-ie Mellon Umv., Pittsburgh, Pa.
 
9
 
10
EPPINGER, J. L., MUMMERT, L. B., AND SPECTOR, A. Z. 1991. Camelot and Avalon. Morgan Kaufmann, San Mateo, Calif.
11
 
12
GOOD, B.~ HOMAN, P. W., GAWLICK, D. E., AND gAMMER, H. 1985. One thousand transactions per second. In Proceedtngs oflEEE Compcon. IEEE, New York.
 
13
 
14
15
16
 
17
 
18
19
 
20
LEFFLER, S. L., McKusmK, M. K., KARELS, M. J., AND QUARTERMAN, J.S. 1989. The Design and Implementatmn of the 4.3BSD Unix Operating System. Addison-Wesley, Reading, Mass.
21
 
22
MASHBURN, H. AND SATYANARAYANAN, M. 1992. RVM User Manual. School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
 
23
 
24
NETTLES, S. M. AND WING, J.M. 1992. Persistence + Undoability Transactions. In Proceedings ofHICSS-25. IEEE Computer Society Press, Los Alamitos, Calif.
25
 
26
OUSTERHOUT, J.K. 1990. Why aren't operating systems getting faster as fast as hardware? In Proceedings of the USENIX Summer Conference. USENIX Assomation, Berkeley, Calif.
27
28
 
29
SATYANARAYANAN, M. 1991. RPC2 User Guide and Reference Manual. School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
 
30
31
 
32
SERLIN, O. 1991. The history of DebitCredit and the TPC. In The Benchmark Handbook. Morgan Kaufman, San Mateo, Calif.
 
33
SPECTOB, A.Z. 1991. The design of Camelot. In Camelot and Avalon. Morgan Kaufmann, San Mateo, Calif.
 
34
STOUT, P. n., JAFFE, E. n., AND SPECTOR, A.g. 1991. Performance of select Camelot functions. In Camelot and Avalon. Morgan Kaufmann, San Mateo, Calif.
 
35
TRANSARC CORP. 1991. Encina Product Overview. Transarc Corp., Pittsburgh, Pa.
 
36
UNIX SYSTEM LABS. 1993. TUXEDO System Product Overvtew. Unix System Laboratories, Summit, N.J.
 
37
WING, J. M. 1991. The Avalon language. In Camelot and Avalon. Morgan Kaufmann, San Mateo, Calif.
 
38
WING, J. M., FAEHNDRICH, M., MORRISETT, G., AND NETTLES, S.M. 1992. Extensions to standard ML to support transactions. In ACM SIGPLAN Workshop on ML and its Applications. ACM, New York.
 
39
 
40
YOUNG, M. W., THOMPSON, D. S., AND JAFFE, E. 1991. A modular architecture for distributed transaction processing. In Proceedings of the USENIX Winter Conference. USENIX Association, Berkeley, Calif.

CITED BY  26
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 


REVIEW

"Clement R. Attanasio : Reviewer"

Camelot is a traditionally designed, comprehensive, and generalized system component, specifically a distributed and nested transaction manager. Recoverable Virtual Memory (RVM) is a minimalist approach, valuing simplicity over generality. Thi  more...

Collaborative Colleagues:
M. Satyanarayanan: colleagues
Henry H. Mashburn: colleagues
Puneet Kumar: colleagues
David C. Steere: colleagues
James J. Kistler: colleagues

Peer to Peer - Readers of this Article have also read: