[go: up one dir, main page]

Casper, 2024 - Google Patents

Adapting and Evaluating Buddy Allocators for Use Within ZGC: ZGC's New Best Friend

Casper, 2024

View PDF
Document ID
9592724786451053725
Author
Casper N
Publication year

External Links

Snippet

In the current software development environment, Java remains one of the major languages, powering numerous applications. Central to Java's effectiveness is the Java Virtual Machine (JVM), with HotSpot being a key implementation. Within HotSpot, garbage collection (GC) is …
Continue reading at www.diva-portal.org (PDF) (other versions)

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
    • 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/0238—Free address space management in non-volatile memory
    • G06F12/0246—Free address space management in non-volatile memory in block erasable memory, e.g. flash memory
    • 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
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G06F12/126—Replacement control using replacement algorithms with special data handling, e.g. priority of data or instructions, handling errors or pinning
    • 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/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
US6330556B1 (en) Data structure partitioning to optimize cache utilization
US6321240B1 (en) Data structure partitioning with garbage collection to optimize cache utilization
Winter et al. faimGraph: High performance management of fully-dynamic graphs under tight memory constraints on the GPU
Flood et al. Parallel garbage collection for shared memory multiprocessors
US9740716B2 (en) System and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions
US7596569B2 (en) Method and program for space-efficient representation of objects in a garbage-collected system
WO2022093381A1 (en) Tracking garbage collection states of references
EP4341818A1 (en) Write barrier for remembered set maintenance in generational z garbage collector
CN1271887A (en) Method and equipment for distributing stack channel
US20090150465A1 (en) Object Deallocation System and Method
Krylov et al. The evolution of garbage collection in v8: google's javascript engine
US7533228B1 (en) Two-pass sliding compaction
US20090228537A1 (en) Object Allocation System and Method
Onozawa et al. Fusuma: double-ended threaded compaction
Casper Adapting and Evaluating Buddy Allocators for Use Within ZGC: ZGC's New Best Friend
Gärds Partial Compaction in ZGC Using Free-Lists
Degenbaev et al. Concurrent marking of shape-changing objects
Sikström Addressing Fragmentation in ZGC through Custom Allocators: Leveraging a Lean, Mean, Free-List Machine
Shivkumar et al. Real-time MLton: A Standard ML runtime for real-time functional programs
Cuoq et al. Hashconsing in an incrementally garbage-collected system: a story of weak pointers and hashconsing in OCaml 3.10. 2
Lam et al. Being lazy when it counts: Practical constant-time memory management for functional programming
Onozawa et al. Fusuma: Double-Ended Threaded Compaction (Full Version)
Patrício et al. Locality-aware GC optimisations for big data workloads
US7272695B1 (en) Hot-card caching to avoid excessive remembered-set updating
Bruno et al. NG2C: Pretenuring N-Generational GC for HotSpot Big Data Applications