[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Baker et al., 2006 - Google Patents

An approach to buffer management in Java HPC messaging

Baker et al., 2006

View PDF
Document ID
6310082781164984746
Author
Baker M
Carpenter B
Shafi A
Publication year
Publication venue
International Conference on Computational Science

External Links

Snippet

One of the most challenging aspects to designing a Java messaging system for HPC is the intermediate buffering layer. The lower and higher levels of the messaging software use this buffering layer to write and read messages. The Java New I/O package adds the concept of …
Continue reading at www.researchgate.net (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
    • 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
    • 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/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0875—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with dedicated cache, e.g. instruction or stack
    • 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
    • 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/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Brun et al. ROOT—An object oriented data analysis framework
US6480862B1 (en) Relation-based ordering of objects in an object heap
US6526422B1 (en) Striding-type generation scanning for parallel garbage collection
US7640544B2 (en) Work stealing queues for parallel garbage collection
US6826583B1 (en) Local allocation buffers for parallel garbage collection
US8543782B2 (en) Content-based, compression-enhancing routing in distributed, differential electronic-data storage systems
US8521790B2 (en) Increasing efficiency of data storage in a file system
US7664927B2 (en) Hash tables
US6189069B1 (en) Optimized logging of data elements to a data storage device
US7092978B2 (en) Space-efficient, depth-first parallel copying collection technique making use of work—stealing on the same structures that maintain the stack of items to be scanned
US6728852B1 (en) Method and apparatus for reducing heap size through adaptive object representation
Seltzer et al. A New Hashing Package for UNIX.
WO2009156556A1 (en) Garbage collection via multiobjects
US20150058381A1 (en) System and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions
US7406684B2 (en) Compiler, dynamic compiler, and replay compiler
US20030097536A1 (en) System and method for physical memory allocation in advanced operating systems
Breg et al. Java virtual machine support for object serialization
US6711595B1 (en) Method and apparatus for sharing standard template library objects among processes
US8447793B2 (en) Efficient remembered set for region-based garbage collectors
Baker et al. An approach to buffer management in Java HPC messaging
JP2002534737A (en) Apparatus for executing program code with reduced memory requirements
Yang et al. Efficient communication and collection with compact normal forms
WO2008082760A1 (en) Method for dynamic memory allocation on reconfigurable logic
US9697210B1 (en) Data storage testing
Fontana et al. WebGraph: The Next Generation (Is in Rust)