Wang, 1989 - Google Patents
The MM garbage collector for C++Wang, 1989
- Document ID
- 8662411140331329624
- Author
- Wang T
- Publication year
External Links
Snippet
The" MM" garbage collector is a class library that gives programmers the ability to write garbage collected classes in C++. Two styles of garbage collection are available; they are reference counting, and" fake copying” garbage collection. Reference counting is more …
- 230000002452 interceptive 0 abstract description 7
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
- G06F12/0269—Incremental or concurrent garbage collection, e.g. in real-time systems
- G06F12/0276—Generational garbage collection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/3636—Software debugging by tracing the execution of the program
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/42—Syntactic analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/43—Checking; Contextual analysis
- G06F8/436—Semantic checking
- G06F8/437—Type checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
- G06F8/443—Optimisation
- G06F8/4441—Reducing the execution time required by the program code
- G06F8/4442—Reducing the number of cache misses; Data prefetching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/44—Arrangements for executing specific programmes
- G06F9/4421—Execution paradigms
- G06F9/4428—Object-oriented
- G06F9/443—Object-oriented method invocation or resolution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
- G06F8/315—Object-oriented languages
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99951—File or database maintenance
- Y10S707/99956—File allocation
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Appel et al. | A standard ML compiler | |
Steffen | Adding run‐time checking to the portable C compiler | |
Stefanović et al. | Age-based garbage collection | |
Jones et al. | C-—: A portable assembly language that supports garbage collection | |
Doligez et al. | A concurrent, generational garbage collector for a multithreaded implementation of ML | |
Ho et al. | An approach to genuine dynamic linking | |
Detlefs | Concurrent garbage collection for C++ | |
Clinger et al. | Implementation strategies for first-class continuations | |
Stichnoth et al. | Support for garbage collection at every instruction in a Java compiler | |
Yasumatsu et al. | SPiCE: a system for translating Smalltalk programs into a C environment | |
Degenbaev et al. | Cross-component garbage collection | |
Wang | The MM garbage collector for C++ | |
Hosking et al. | Towards compile-time optimisations for persistence | |
Wilson et al. | Real-time non-copying garbage collection | |
Gay et al. | Stack allocating objects in Java | |
Yuasa | The design and implementation of Kyoto Common Lisp | |
Boehm et al. | 13. A Proposal for Garbage-Collector-Safe C Compilation | |
Siebert et al. | Deterministic execution of Java's primitive bytecode operations | |
Britton | Heap storage management for the programming language Pascal | |
Sansom | Dual-mode garbage collection | |
Samples | GC-cooperative C++ | |
Giallorenzo et al. | Breadth-first Cycle Collection Reference Counting: Theory and a Rust Smart Pointer Implementation | |
Munch-Maccagnoni et al. | Boxroot, fast movable GC roots for a better FFI | |
Attardi et al. | Customising object allocation | |
Qiu | Programming language translation |