Preemptive memory-block splitting

Details Preemptive memory-block splitting Preemptive memory-block splitting

2005-01-11

2005-01-11

Vital, Pierre M. (Department: 2188)

Electrical computers and digital processing systems: memory

Storage accessing and control

Memory configuring

C711S159000, C707S793000

Reexamination Certificate

active

06842838

ABSTRACT:
A computer system (10) implements a memory allocator that employs a data structure (FIG.3) to maintain an inventory of dynamically allocated memory available to receive new data. It receives from one or more programs requests that it allocate memory from a dynamically allocable memory “heap.” It responds to such requests by performing the requested allocation and removing the thus-allocated memory block from the inventory. Conversely, it adds to the inventory memory blocks that the supported program or programs request be freed. In the process, it monitors the frequencies with which memory blocks of various sizes are allocated, and it projects from those frequencies future-demand values for memory blocks of those sizes. It then splits larger blocks into smaller ones preemptively, i.e., before a request for the result of the splitting. To split a relatively large block preemptively in order to meet an expected request for a smaller block, it bases its selection of the larger block to be split on whether the supply of free blocks of that size is great enough to meet the expected demand for such blocks. It also splits blocks reactively, i.e., in response to a previously made request for a block that will result from the splitting operation.

REFERENCES:
patent: 5978893 (1999-11-01), Bakshi et al.
patent: 6490670 (2002-12-01), Collins et al.
Paul R. Wilson et al., Dynamic Storage Allocation: A Survey and Critical Review, Department of Computer Science, University of Texas at Austin, USA. pp. 1-78.
B. H. Margolin et al., Analysis of Free-Storage Algorithms, Free-Storage Algorithms, No. 4, pp. 283-304, 1971.
Dirk Grunwald et al., CustoMalloc: Efficient Synthesized Memory Allocators, Department of Computer Science, University of Colorado at Boulder, Technical Report CU-CS-602-92, pp. 1-22, 1992.

Affiliated with

Also associated with

Rating

Preemptive memory-block splitting does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Preemptive memory-block splitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preemptive memory-block splitting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3427473