System and method for dynamic memory allocation

Details System and method for dynamic memory allocation System and method for dynamic memory allocation

2010-02-04

2011-12-06

Song, Jasmine (Department: 2189)

Electrical computers and digital processing systems: memory

Storage accessing and control

Memory configuring

C711S154000, C711S156000, C711S170000, C711S172000

Reexamination Certificate

active

08074044

ABSTRACT:
A method for managing the allocation of memory to one or more applications. The method includes allocating a variety of fixed size memory blocks to a requesting application, each of the fixed size memory blocks being free of header information to maximize memory usage. Free, or unused blocks of data of the same fixed size are maintained in a freelist having a number of block roots corresponding to the number of differently fixed size memory blocks. Each block root stores a root pointer to an unused memory block previously allocated to the application. To conserve memory, each unused memory block will store branch pointers to other identically sized unused memory blocks, thereby forming a sequential chain of unused memory blocks with the block root. Therefore, applications requesting the same sized memory block can re-use previously allocated fixed size memory blocks.

REFERENCES:
patent: 2005/0055526 (2005-03-01), Challenger et al.
Wilson et al., “Dynamic Storage Allocation: A Survey and Critical Review”, Memory Management International Workshop IWMM Proceedings, Sep. 1995, pp. 1-78, XP002262845.
Rezaei et al., A New Implementation Technique for Memory Management, Internet Article, Online, Apr. 9, 2000, URL: http://ieeexplore.ieee.org/ie15/6808/18269/00845587.pdf, XP002431173.
Rezaei et al., “Utilization of Separate Caches to Eliminate Cache Pollution Caused by Memory Management Functions”, Internet Article, Online, 2003, URL: http://csrl.unt.edu/lkavi/Research/pdcs2003-110.pdf, XP002431174, retrieved from the Internet on Apr. 26, 2007.
Comfort et al. IBM Corporation, “Multiword list items”, Communication of the ACM, vol. 7, No. 6, Jun. 1964, p. 357-361, XP002431277.
Chang et al., “Measuring dynamic memory invocation in object-oriented programs”, Performance, Computing and Communications Conference, 1999 IEEE International, Feb. 10-12, 1999, pp. 268-274, XP010323644.
Jones, “Chapter 14, Dynamic Storage Allocation Heap management for linked data structures”, Internet Article, 2004, URL: http://www.cs.uiowa.edu/ljones/syssoft
otes/14alloc.html, 002431199, retrieved from the Internet on Apr. 26, 2007.
Garner, “JMTk: A portable memory management toolkit”, Internet Article, Dec. 2003, URL: http://dspace.anu. edu.au/bitstream/1885/39952/4/thesis,ps, XP002431244.
Donald Knuth, “Fundamental Algorithms Section 2.5: Dynamic Storage Allocation”, Third Edition, Addison-Wesley, 1997, ISBN 0-201-89683-4, pp. 435-456.
U.S. Appl. No. 11/681,838, Notice of Allowance dated Nov. 4, 2009.
European Patent Application No. 07103524.0, Search Report dated May 10, 2007.

Affiliated with

Also associated with

Rating

System and method for dynamic memory allocation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for dynamic memory allocation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for dynamic memory allocation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4306549