Pre-Grant Publication Number: 20070118712
Filing Date: November 21, 2005
Inventors: Henri van Riel, Adriaan van de Ven
Assignee: RED HAT, INC.
Current U.S. Classification: 711, 711/170000
View Prior Art for Claim 00001
A method for allocating memory freed by applications in a computer system having an operating system (O/S), said method comprising:
a) designating a status of said one or more freed memory units previously associated with an application as available for reuse;
b) organizing one or more freed memory units having said available for reuse status into one or more free memory pools, wherein freed memory units in a pool are directly allocated to an application requiring backing physical memory store without the O/S deleting data in the freed memory units.
Submitted by: Paul McKenneyCreated: about 1 year ago
Title TXSeries for Multiplatforms: Application Programming interface
Description
IBM Mainframe software environment, with "getmain" and "freemain" on pages 106-109 of the physical PDF. Likely available in print as well. Prior edition published 1999 (doc ID SC09-4461-05).
1 thumb up 0 thumbs down
Annotations(0)
Submitted by: Daniel BerlinCreated: about 1 year ago
Name/Title Linux 0.11 malloc.c
System Type Operating System
Description
Kernel based memory allocator using pools and avoiding initializing memory on free.
1 thumb up 1 thumb down
Annotations(3)
Submitted by: Steve BokmaCreated: about 1 year ago
Title The Art of Computer Programing
ISBN 0-201-03809-9
Description
Method for dynamic storage allocation
0 thumbs up 0 thumbs down
Annotations(3)
Title disclaim subrutine
Description
AIX base technical reference for the disclaim subroutine which allows one to mark memory for reuse without freeing the memory.
1 thumb up 0 thumbs down
Annotations(0)
Submitted by: Curt RoseCreated: about 1 year ago
Patent/Application # 5159678
Description
A parallel memory scheduler for execution on a high speed highly parallel multiprocessor architecture. The operating system software provides intelligence and efficiency in swapping out process images to facilitate swapping in another process. The splitting and coalescing of data segments are used to fit segments in to current free memory even though a single contiguous space of sufficient size does not exist. Mapping these splits through data control register sets retains the user's contiguous view of the address space. The existence of dual images and partial swapping allows efficient, high speed swapping
0 thumbs up 0 thumbs down
Annotations(0)
Submitted by: Anthony PhillipsLast updated: about 1 year ago
Title Hoard: A Scalable Memory Allocator
Description
This research paper describes an advanced memory allocator that exhibits many of the novel claims made by the disclosure.
2 thumbs up 0 thumbs down
Annotations(1)
Submitted by: Anthony PhillipsLast updated: about 1 year ago
Title The Design and Implementation of the UVM Virtual Memory System
ISBN
Description
Enhancements made to the NewBSD Operating System to improve system performance by sharing memory between processes.
0 thumbs up 0 thumbs down
Annotations(0)