The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Garbage collection in an uncooperative environment
Abstract
We describe a technique for storage allocation and garbage collection in the absence of significant co‐operation from the code using the allocator. This limits garbage collection overhead to the time actually required for garbage collection. In particular, application programs that rarely or never make use of the collector no longer encounter a substantial performance penalty. This approach greatly simplifies the implementation of languages supporting garbage collection. It further allows conventional compilers to be used with a garbage collector, either as the primary means of storage reclamation, or as a debugging tool. Our approach has two potential disadvantages. First, some garbage may fail to be reclaimed. Secondly, we use a ‘stop and collect’ approach, thus making the strategy unsuitable for applications with severe real‐time constraints. We argue that the first problem is, to some extent, inherent in any garbage collection system. Furthermore, based on our experience, it is usually not significant in practice. In spite of the second problem, we have had favourable experiences with interactive applications, including some that use a heap of several megabytes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
The TimberWolf placement and routing package
Sechen, C., & Sangiovanni-Vincentelli, A. (1985) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1985.1052337 · Cited by 532
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
Ungar, D. (1984) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/390010.808261 · Cited by 484
A method for overlapping and erasure of lists
Collins, G. E. (1960) · Communications of the ACM · doi:10.1145/367487.367501 · Cited by 310
An efficient machine-independent procedure for garbage collection in various list structures
Schorr, H., & Waite, W. M. (1967) · Communications of the ACM · doi:10.1145/363534.363554 · Cited by 228
Garbage Collection of Linked Data Structures
Cohen, J. (1981) · ACM Computing Surveys · doi:10.1145/356850.356854 · Cited by 218
TimberWolf3.2: A New Standard Cell Placement and Global Routing Package
Sechen, C., & Sangiovanni-Vincentelli, A. L. (1986) · doi:10.5555/318013.318083 · Cited by 186
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Mnemosyne: lightweight persistent memory
Volos, H., Tack, A. J., & Swift, M. M. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950379 · Cited by 711
Dynamic storage allocation: A survey and critical review
Wilson, P. R., Johnstone, M. S., Neely, M., & Boles, D. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60368-9_19 · Cited by 594
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Efficient detection of all pointer and array access errors
Austin, T. M., Breach, S. E., & Sohi, G. S. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178446 · Cited by 427
DieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134000 · Cited by 405
CCured: type-safe retrofitting of legacy software
Necula, G. C., Condit, J., Harren, M., McPeak, S., & Weimer, W. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1065887.1065892 · Cited by 365
Consistent and durable data structures for non-volatile byte-addressable memory
Venkataraman, S., Tolia, N. H., Ranganathan, P., & Campbell, R. H. (2011) · doi:10.5555/1960475.1960480 · Cited by 356
The execution algorithm of mercury, an efficient purely declarative logic programming language
Somogyi, Z., Henderson, F., & Conway, T. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00068-4 · Cited by 324
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268954 · Cited by 282
DieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134000 · Cited by 272
Metadata
- Authors
- Boehm, H., & Weiser, M.
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 1988-09
- Volume
- 18
- Issue
- 9
- Pages
- 807-820
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W2005907808
- Cited by
- 627
- References
- 13
- FWCI
- 6.63
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.