More Web Proxy on the site http://driver.im/

article

Free access

Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware

Author:

Paul R. WilsonAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 19, Issue 4

Pages 6 - 13

https://doi.org/10.1145/122576.122577

Published: 01 July 1991 Publication History

Abstract

We describe a scheme for supporting huge address spaces without the need for long addresses implemented in hardware. Pointers are translated ("swizzled") from a long format to a shorter format (directly supported by normal hardware) at page fault time. No extra hardware is required beyond that normally used by virtual memory systems, and no continual software cost is incurred by presence checks or indirection of pointers.This scheme could be used to fault pages into a normal memory from a persistent store, or simply to avoid extra hardware requirements when supporting large address spaces. It exploits temporal and spatial locality in much the same way as a normal virtual memory, so its performance should be quite good.

References

[1]

ApEL88 Appel, Andrew W., John R. Ellis, and Kai Li "Realtime concurrent garbage collection on stock multiprocessors," Proc. SIGPLAN PLDI '88, pp. 11- 20.

Digital Library

[2]

ABCC83 Atkinson, M.P., P.J. Bailey, K.J. Chisholm, P. W. Cockshott, and R. Morrison, "An approach to persistent programming," The Computer Journal, vol. 26, no. 4, December 1983, pp. 360-365.

[3]

Bart88 Bartlett, Joel F. "Compacting garbage collection with ambiguous roots," Technical Report 88/2, Digital Equipment Corp., Western Research Laboratory, February 88.

[4]

BaSa76 Baer, J.-L., and Sager, G.R. "Dynamic improvement of Locality in virtual memory systems," IEEE TSWE, vol. SE-2, no. 1 (March 1976).

[5]

BoWe88 Boehm, Hans-Juergen, and Mark Weiser. "Garbage collection in an uncooperative environment," Software: Practice and Experience, 1988, pp. 495-508.

Digital Library

[6]

CACB84 Cockshott, W., M. Atkinson, K. Chisholm, P. Bailey, and R. Morrison, "Persistent Object Management System," Software Practice and Experience, vol. 14, 1984, pp. 49-71.

[7]

DWHB90 Demers, Alan, Mark Weiser, Barry Hayes Hans Boehm, Daniel Bobrow, and Scott Shenker, "Combining generational and conservative garbage collection: framework and implementations," ACM Symposium on Principles of Programming Languages, January 1990, pp. 261-269.

Digital Library

[8]

DeBr76 Deutsch, L. Peter, and Daniel G. Bobrow, "An efficient incremental automatic garbage collector," Communications of the ACM 19(9), September 1976, pp. 522-526.

Digital Library

[9]

LiHe83 Lieberman, Henry, and Carl Hewitt, "A real-time garbage collector based on the lifetimes of objects," CACM 26, 6 (June 1983), pp. 419-429.

Digital Library

[10]

HeK185 Heering, J., and P. Klint, "Towards monolingual programming environments," ACM Trans Prog. Lang. Syst., 7, 2 (April 1985), pp. 183- 213.

Digital Library

[11]

Kaeh81 Kaehler, T. "Virtual memory for an object-oriented language," Byte 6, 8 (August 1981), pp. 378-387.

[12]

Moss89 Moss, J. Eliot B. "Addressing large distributed collections of persistent objects: the Mneme project's approach," in Second International Workshop on Database Programming Languages, pp. 269-285. Also available as University of Massachusetts Dept. of Computer and Information Science Technical Report 89-68.

Digital Library

[13]

Moon84 Moon, David "Garbage collection in a large lisp system," ACM Symp. on Lisp and Functional Programming 1984, pp. 235-246.

Digital Library

[14]

Moss90 Moss, Eliot "Working with objects: to swizzle or not to swizzle?," Unpublished technical report, University of Massachusetts 1990.

[15]

Stam82 Stamos, James William, "A large object-oriented virtual memory: grouping strategies, measurements, and performance," Xerox Palo Alto Research Centers Technical Report SCG-82-2, May 1982.

[16]

Unga84 Ungar, David M., "Generation Scavenging: a non-disruptive high-performance storage reclamation algorithm," ACM SIGPLAN Notices, 19,5 (May 1984), pp. 157-167.

Digital Library

[17]

Wils89 Wilson, Paul R. "Heap management and hierarchical memories," Unpublished working paper, May 1989.

[18]

Wils90 Wilson, Paul R. "Issues and strategies in heap management and hierarchical memories." Position paper, OOPSLA/ECOOP '90 Workshop on Garbage Collection in Object-Oriented Systems. Also forthcoming in SIGPLAN Notices.

Digital Library

[19]

WiLM90 Wilson, Paul R., Michael S. Lain, and Thomas G. Moher, "Effective static-graph reorganization to improve locality in garbage-collected Systems," Proc. SIGPLAN '91, to appear.

Digital Library

[20]

WiMo89 Wilson, Paul R. and Thomas G. Moher, "Design of the Opportunistic Garbage Collector," Proc. OOPSLA '89.

Digital Library

[21]

WiWH87 Williams, Ifor, Mario Wolkzko, and Trevor Hopkins, "Dynamic grouping in an object-oriented virtual memory hierarchy," In European Conference on Object-Oriented Programming, pages 87-96, 1987.

Digital Library

[22]

WiWH90 Williams, Ifor, Mario Wolkzko, and Trevor Hopkins, "Realization of a dynamically grouped object-oriented memory hierarchy," technical report, University of Manchester Dept. of Computer Science, 1990.

Cited By

Mahar SShen MSmith TIzraelevitz JSwanson S(2024)Puddles: Application-Independent Recovery and Location-Independent Data for Persistent MemoryProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629555(575-589)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629555
Wang ZShao Z(2023)ForestTI: A Scalable Inverted-Index-Oriented Timeseries Management System with Flexible Memory EfficiencyProceedings of the ACM on Management of Data10.1145/35892601:2(1-25)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589260
Oukid IBooss DLespinasse ALehner WWillhalm TGomes G(2017)Memory management techniques for large-scale persistent-main-memory systemsProceedings of the VLDB Endowment10.14778/3137628.313762910:11(1166-1177)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.14778/3137628.3137629
Show More Cited By

Index Terms

Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware

Recommendations

Pointer swizzling techniques for object-oriented database systems
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Adaptable pointer swizzling strategies in object bases: design, realization, and quantitative analysis
Persistent object systems

In this article, different techniques for "pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects. To speed up the access along inter-object references, the persistent pointers in the form of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 19, Issue 4

June 1991

184 pages

ISSN:0163-5964

DOI:10.1145/122576

Editor:
Doug DeGroot
Texas Instruments, Inc., Dallas, TX

Issue’s Table of Contents

Copyright © 1991 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1991

Published in SIGARCH Volume 19, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
770
Total Downloads

Downloads (Last 12 months)94
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mahar SShen MSmith TIzraelevitz JSwanson S(2024)Puddles: Application-Independent Recovery and Location-Independent Data for Persistent MemoryProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629555(575-589)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629555
Wang ZShao Z(2023)ForestTI: A Scalable Inverted-Index-Oriented Timeseries Management System with Flexible Memory EfficiencyProceedings of the ACM on Management of Data10.1145/35892601:2(1-25)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589260
Oukid IBooss DLespinasse ALehner WWillhalm TGomes G(2017)Memory management techniques for large-scale persistent-main-memory systemsProceedings of the VLDB Endowment10.14778/3137628.313762910:11(1166-1177)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.14778/3137628.3137629
Tarkkanen KKoskinen JHarkke V(2016)Distorted usability design in IT tenderingACM SIGCAS Computers and Society10.1145/2874239.287428745:3(326-331)Online publication date: 5-Jan-2016
https://dl.acm.org/doi/10.1145/2874239.2874287
Vistisen PJensen TPoulsen S(2016)Animating the ethical demandACM SIGCAS Computers and Society10.1145/2874239.287428645:3(318-325)Online publication date: 5-Jan-2016
https://dl.acm.org/doi/10.1145/2874239.2874286
Gerdes A(2016)The issue of moral consideration in robot ethicsACM SIGCAS Computers and Society10.1145/2874239.287427845:3(274-279)Online publication date: 5-Jan-2016
https://dl.acm.org/doi/10.1145/2874239.2874278
Scantamburlo T(2016)Machine learning in decisional processACM SIGCAS Computers and Society10.1145/2874239.287427045:3(218-224)Online publication date: 5-Jan-2016
https://dl.acm.org/doi/10.1145/2874239.2874270
Zhou YLiu LLee KZhang Q(2015)GraphTwistProceedings of the VLDB Endowment10.14778/2809974.28099878:11(1262-1273)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.14778/2809974.2809987
Li BDiao YShenoy P(2015)Supporting scalable analytics with latency constraintsProceedings of the VLDB Endowment10.14778/2809974.28099798:11(1166-1177)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.14778/2809974.2809979
Tang YCai YMamoulis N(2015)Scaling similarity joins over tree-structured dataProceedings of the VLDB Endowment10.14778/2809974.28099768:11(1130-1141)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.14778/2809974.2809976
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents