Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

On-the-fly garbage collection: an exercise in cooperation

Published: 01 November 1978 Publication History

Abstract

As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted to the computation proper. Exclusion and synchronization constraints have been kept as weak as could be achieved; the severe complexities engendered by doing so are illustrated.

References

[1]
Dijkstra, E.W. Guarded commands, nondeterminacy and formal derivation of programs. Comm. A CM 18, 8 (Aug. 1975), 453~;57.
[2]
Gries, D. An exercise in proving parallel programs correct. Comm. ACM. 20, 12 (Dec. 1977), 921-930.
[3]
Lamport, L. Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. SE-3, 2 (March 1977), 125-143.
[4]
Steele, Jr., G.L. Multiprocessing compactifying garbage collection. Comm. ACM 18, 9 (Sep. 1975), 495-508.
[5]
Woodger, M. Private communications.

Cited By

View all
  • (2024)Reducing Write Barrier Overheads for Orthogonal PersistenceProceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3687997.3695646(210-223)Online publication date: 17-Oct-2024
  • (2024)What Is a Garbage Collector? An Exercise in Compositional RefinementThe Practice of Formal Methods10.1007/978-3-031-66676-6_10(195-215)Online publication date: 4-Sep-2024
  • (2022)The Garbage Collection Cost For Meta-Tracing JIT-based Dynamic LanguagesProceedings of the 32nd Annual International Conference on Computer Science and Software Engineering10.5555/3566055.3566071(140-149)Online publication date: 15-Nov-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 21, Issue 11
Nov. 1978
95 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/359642
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1978
Published in CACM Volume 21, Issue 11

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cooperation bet. sequential processes w/ minimized mutual ex
  2. fine-grained interleaving
  3. garbage collection
  4. multiprocessing
  5. program correctness for multiprogramming tasks

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)344
  • Downloads (Last 6 weeks)42
Reflects downloads up to 30 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Reducing Write Barrier Overheads for Orthogonal PersistenceProceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3687997.3695646(210-223)Online publication date: 17-Oct-2024
  • (2024)What Is a Garbage Collector? An Exercise in Compositional RefinementThe Practice of Formal Methods10.1007/978-3-031-66676-6_10(195-215)Online publication date: 4-Sep-2024
  • (2022)The Garbage Collection Cost For Meta-Tracing JIT-based Dynamic LanguagesProceedings of the 32nd Annual International Conference on Computer Science and Software Engineering10.5555/3566055.3566071(140-149)Online publication date: 15-Nov-2022
  • (2022)On a possible embedding of Lisp into the C languageKeldysh Institute Preprints10.20948/prepr-2022-30(1-35)Online publication date: 2022
  • (2022)Evoking Whitehead’s DictumEdsger Wybe Dijkstra10.1145/3544585.3544614(445-454)Online publication date: 12-Jul-2022
  • (2022)Edsger Dijkstra—Some ReminiscencesEdsger Wybe Dijkstra10.1145/3544585.3544613(423-444)Online publication date: 12-Jul-2022
  • (2022)A Personal View of Edsger W. Dijkstra and His Stance on Software ConstructionEdsger Wybe Dijkstra10.1145/3544585.3544596(205-214)Online publication date: 12-Jul-2022
  • (2022)Concurrent AlgorithmsEdsger Wybe Dijkstra10.1145/3544585.3544591(47-80)Online publication date: 12-Jul-2022
  • (2022)Programming Concurrent SystemsEdsger Wybe Dijkstra10.1145/3544585.3544590(27-46)Online publication date: 12-Jul-2022
  • (2022)Deep Dive into ZGC: A Modern Garbage Collector in OpenJDKACM Transactions on Programming Languages and Systems10.1145/353853244:4(1-34)Online publication date: 21-Sep-2022
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media