Free Address Space Management (epo) Patents (Class 711/E12.006)
  • Patent number: 7516291
    Abstract: System, method and computer program product for allocating physical memory to processes. The method includes enabling a kernel to free memory in a physical memory space corresponding to arbitrarily sized memory allocations released by processes or applications in a virtual memory space. After freeing the memory, the system determines whether freed physical memory in the physical memory space spans one or more fixed size memory units (e.g., page frames). The method further includes designating a status of the one or more page frames as available for reuse; the freed page frames marked as available for reuse being available for backing a new process without requiring the kernel to delete data included in the freed memory released by the process.
    Type: Grant
    Filed: November 21, 2005
    Date of Patent: April 7, 2009
    Assignee: Red Hat, Inc.
    Inventors: Henri Han van Riel, Adriaan D M van de Ven
  • Publication number: 20090089519
    Abstract: A method for the processor controlled administering of a memory of a chip card. Initially, available free memory capacity is determined. Then, the memory is released for storing data. The data in the memory can be deleted. The memory can also be used by new data. A stored indication of the actual amount of free memory space is adapted to the current free memory space. The free memory space is reorganized and allocated. Furthermore, the invention relates to a chip card. The chip card comprises a chip with a memory wherein the memory is managed by a processor-controlled memory management system. Means for identifying used and unused memory are provided. The actual free memory space is displayed by means for displaying.
    Type: Application
    Filed: September 26, 2008
    Publication date: April 2, 2009
    Inventors: Dierk Dohmann, Frank Muller
  • Publication number: 20090063768
    Abstract: A plurality of storage devices of a plurality of types is provided. A plurality of criteria is associated for each of the plurality of storage devices, based on characteristics of the plurality of storage devices, wherein the plurality of criteria can be used to determine whether a selected storage device is a compatibility spare for a storage device in a storage device array, and whether the selected storage device is an availability spare for the storage device in the storage device array. A determination is made by a spare management application, based on at least the plurality of criteria and at least one optimality condition, of a first set of storage devices selected from the plurality of storage devices to be allocated to a plurality of storage device arrays, and of a second set of storage devices selected from the plurality of storage devices to be allocated as spares for the plurality of storage device arrays.
    Type: Application
    Filed: September 4, 2007
    Publication date: March 5, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Matthew Joseph Kalos, Robert Akira Kubo, Richard Anthony Ripberger
  • Publication number: 20090055571
    Abstract: One embodiment of the present invention includes a method for: (a) executing guest computations in a virtual machine of the virtualization system; and (b) forcing execution of registered code into an execution context of the guest, wherein the forcing is performed from the virtualization system based on an execution trigger monitored without reliance on functionality of the guest software.
    Type: Application
    Filed: August 8, 2008
    Publication date: February 26, 2009
    Inventors: Dmitriy Budko, Xiaoxin Chen, Oded Horovitz, Pratap Subrahmanyam, Carl Waldspurger
  • Publication number: 20090006799
    Abstract: Techniques are disclosed for optimizing volume allocation on storage controllers that may have varying degrees of control over directing storage on ranks of pools attached storage components. A performance-based volume allocation algorithm can optimize allocation for such various controllers in a smooth, uniform manner allowing changes from one degree of control to another without incurring costly code changes and re-architecting costs. Where control is not available a surrogate set of possible ranks where the allocation could be made is developed and employed to calculate an adjusted utilization cost. In turn, the adjusted utilization cost is used to calculate a space limit value limited by a target performance threshold.
    Type: Application
    Filed: June 26, 2007
    Publication date: January 1, 2009
    Applicant: International Business Machines Corporation
    Inventors: Madhukar R. Korupolu, Konstantinos Magoutis, Kaladhar Voruganti
  • Publication number: 20080276062
    Abstract: Certain embodiments of the invention may be found in a method for memory management for a mobile multimedia processor. The method may comprise receiving within a mobile multimedia processor chip a plurality of memory requests. The plurality of memory requests may be handled by allocating memory from at least one on-chip memory block and/or at least one off-chip memory block. The memory may be allocated based on a priority level of each of the plurality of memory requests and at least one dynamically settable global memory allocation priority threshold. A new dynamically settable memory allocation priority threshold may be dynamically determined based on a new application and/or by monitoring at least one software process in at least one present application. Additionally, new memory request priority level may be dynamically determined for each memory request in at least one software process in a new application.
    Type: Application
    Filed: June 10, 2008
    Publication date: November 6, 2008
    Inventor: Dominic R. Cobley
  • Publication number: 20080229057
    Abstract: A system/method for profiling a sequence of values from a range to determine a frequency of occurrence of a subrange includes, for a current block, determining whether cells of the current block include a count cell or a pointer cell. If the cell includes a pointer cell, follow an address that the pointer makes reference to and designate a new block as the current block and repeat the determining step for the new block. If the cell includes a count cell, increment the count cell and compare the incremented count cell to a threshold. If the count exceeds the threshold, convert the count cell to a pointer cell, which points to a newly allocated block. The newly allocated block is made the current block, and the steps are repeated until count cells do not exceed the threshold or a limit resolution is achieved.
    Type: Application
    Filed: June 3, 2008
    Publication date: September 18, 2008
    Inventor: Michel Henri Theodore Hack
  • Publication number: 20080016289
    Abstract: A configurable device interface enhances the ability of a processor to communicate with other devices. The configurable device interface provides programmers with an efficient mechanism for communicating with a wide variety of external memories, each of which may have their own unique interface requirements. As a result, the configurable device interface permits a data processor to operate without hard coded dedicated state machines, and without waiting for an external memory to complete an instruction before the data processor may perform its next instruction.
    Type: Application
    Filed: June 29, 2007
    Publication date: January 17, 2008
    Inventors: James D. Pennock, Ronald Baker, Brian R. Parker, Christopher Belcher