Abstract: The illustrative embodiments provide a computer implemented method, apparatus, and computer usable program code for managing a heap. The heap is partitioned into at least one sub heap based on a relationship to at least one memory class of a plurality of memory classes. A memory allocation request comprising a memory class is received from a requester. A unique heap handle based on the memory class and associated with a specific sub heap is generated. The unique heap handle is then returned to the requester.

Abstract: Methods, systems, and products are disclosed for implementing a generic kernel extension framework that operate generally to allow one kernel extension to register a function callable by other kernel extensions. A kernel extension can be loaded even if a function it potentially could need is not available. If in fact the running kernel extension does eventually request a function that no other kernel extension has registered to provide, it is failed gracefully with a return error code. The client kernel extension can still function normally, assuming the desired service is non-critical. Example services in the non-critical category may include, for example, advanced error handling functions, statistical functions, reporting functions, and so on, including many others as will occur to those of skill in the art.

Abstract: The illustrative embodiments provide a computer implemented method, apparatus, and computer usable program code for managing a heap. The heap is partitioned into at least one sub heap based on a relationship to at least one memory class of a plurality of memory classes. A memory allocation request comprising a memory class is received from a requester. A unique heap handle based on the memory class and associated with a specific sub heap is generated. The unique heap handle is then returned to the requester.

Abstract: A data processing system for storing and identifying footprint data in a data processing system enabling automated collection, identification and formatting recovery of footprint data executing on a mainline routine. A footprint area is allocated onto a failure recovery routine stack for use by the mainline routine for storing footprint data. The mainline routine stores footprint data within the first footprint area. The data processing system can then receive a request from a diagnostic tool, where the request includes at least one search parameter. The data processing system can output any footprint data to a diagnostic tool corresponding to the search parameters in the request.

Abstract: A method and system for choosing an optimal PCI adapter burst length is disclosed. The optimal burst length is automatically determined by the adapter configuration feature of AIX software using a cache-line size of a PCI bridge and the latency timer value of the target PCI adapter as inputs. The method also provides for a user to be able to override the software-calculated setting.

Abstract: A method and system are disclosed for managing multiple requests issued by a requester to a number of peripheral devices coupled to a peripheral bus within a data processing system. A request issued by the requestor which specifies a particular operation to be performed is transmitted to a selected peripheral device vice the peripheral bus. In response to performance of the particular operation by the selected peripheral device within a first predetermined time period, successful completion of the request is reported to the requestor. In response to a failure of the selected peripheral device to perform the particular operation within the first predetermined time period, access to the peripheral bus by the multiple requests is limited. Thereafter, in response to a failure of the selected peripheral device to perform the particular operation within a second predetermined time period, a request timeout error is reported to the requester.