×

Memory-block coalescing based on run-time demand monitoring

  • US 6,839,822 B2
  • Filed: 10/29/2001
  • Issued: 01/04/2005
  • Est. Priority Date: 10/29/2001
  • Status: Active Grant
First Claim
Patent Images

1. For satisfying requests for dynamic allocation of blocks of a computer system'"'"'s computer memory, a method that includes:

  • A) maintaining an inventory of memory blocks available for dynamic allocation;

    B) for each of a plurality of size ranges, deriving a demand indicator by monitoring run-time allocations of memory blocks whose sizes belong to that range;

    C) in response to each of at least one release request that specifies a respective memory block, adding the memory block thereby specified to the inventory, whereby a memory-block run occurs if the release requests specify memory blocks adjacent to memory blocks already in the inventory, and, if such a run occurs;

    i) for each of at least one group of memory blocks within that memory-block run, making a coalescing decision that depends on the value of at least one said demand indicator and the number of inventory memory blocks that are in the size range with which the demand indicator is associated; and

    ii) coalescing that group of memory blocks into a composite memory block only upon a positive outcome of the coalescing decision made for that group; and

    D) in response to each of at least one allocation request, allocating such a composite memory block.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×