IP Library Granted Patent US 9,519,426
Granted Patent B2
US 9,519,426 · App. 14/924,813 · Granted Dec 13, 2016

Intelligent computer memory management

Inventor: Arun Iyengar (Yorktown Heights, NY)
Assignee: International Business Machines Corporation
G06F3/0604G06F3/0631G06F3/0632G06F3/0683G06F9/5016G06F12/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,519,426
App. No.
14/924,813
Granted
Dec 13, 2016
Kind
B2
Abstract

A plurality of memory allocators are initialized within a computing system. At least a first memory allocator and a second memory allocator in the plurality of memory allocators are each customizable to efficiently handle a set of different memory request size distributions. The first memory allocator is configured to handle a first memory request size distribution. The second memory allocator is configured to handle a second memory request size distribution. The second memory request size distribution is different than the first memory request size distribution. At least the first memory allocator and the second memory allocator that have been configured are deployed within the computing system in support of at least one application. Deploying at least the first memory allocator and the second memory allocator within the computing system improves at least one of performance and memory utilization of the at least one application.

Claims (23)

1. A method for managing computer memory, the method comprising:

initializing a plurality of memory allocators within a computing system, wherein at least a first memory allocator and a second memory allocator in the plurality of memory allocators are each customizable to efficiently handle a set of different memory request size distributions, wherein to efficiently handle memory request size distributions comprises special free lists tailored to store free blocks of a plurality of particular sizes of the memory request size distributions, the free blocks are allocated from the special free lists to handle memory requests;

customizing the first memory allocator to efficiently handle a first memory request size distribution determined by the computing system;

customizing the second memory allocator to efficiently handle a second memory request size distribution determined by the computing system, the second memory request size distribution being different than the first memory request size distribution; and

deploying at least the first memory allocator and the second memory allocator in support of at least one application, the deploying improving at least one of performance and memory utilization of the at least one application.

2. The method of claim 1 , further comprising:

storing a plurality of memory objects by at least one memory allocator in the plurality of memory allocators.

3. The method of claim 2 , further comprising:

determining that the plurality of memory objects that have been stored are no longer required; and

de-allocating, in response to the determining, memory corresponding to the memory allocator.

4. The method of claim 1 , further comprising:

backing up a main memory object in a persistent storage.

5. The method of claim 4 , wherein the backing up is performed after a value associated with the main memory object has changed.

6. The method of claim 4 , wherein the backing up is performed in response to determining that a version of the main memory object stored within the persistent storage has been obsolete for a time period exceeding a threshold.

7. The method of claim 4 , wherein the backing up is performed in response to a number of updates to the main memory object, since a most recent version of the main memory object was stored in the persistent storage, exceeding a threshold.

8. The method of claim 4 , wherein the persistent storage comprises one of a file system and database management system.

9. The method of claim 1 , wherein at least one memory allocator in the plurality of memory allocators utilizes at least one of:

a first fit memory management method;

a best fit management method;

a multiple free list fit I management method;

a multiple free list fit II management method;

a quick fit management method; and

a buddy system management method.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 28, 2015
From: IYENGAR, ARUN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 036898/0989 →
Continuity (3)
Division 13612238 · Sep 12, 2012
Continuation 12887964 · Sep 22, 2010
Related Publication 20160048339A1 · Feb 18, 2016