International Business Machines Corporation

Xiao Jun Dai

Zhi Gan

Rui Han

Subhendu Das

Zhang Yue

Wei Liu

Zhi Da Luo

Xian Liu

Yao Dong Qi

Mo Jiong Qiu

Managing access to a cache memory includes dividing said cache memory into multiple of cache areas, each cache area having multiple entries; and providing at least one separate lock attribute for each cache area such that only a processor thread having possession of the lock attribute corresponding to a particular cache area can update that cache area.

Locks to enable updating data and a data replacement order in cache areas

A cache memory device includes a plurality of cache areas, each the cache area comprising a plurality of entries. The cache memory device is configured to maintain a separate lock attribute for each the cache area and temporarily assign possession of a lock attribute for a particular the cache area to a processor thread attempting to update the particular the cache area, the processor thread being unable to update the particular the cache area without possession of the lock attribute for the particular the cache area.

Managing processor thread access to cache memory using lock attributes

Global heap allocation technologies in a multi-thread environment, and particularly a method for dynamically adjusting global heap allocation in the multi-thread environment, and more particularly to a method and system for dynamically adjusting global heap allocation by monitoring conflict parameters of the global heap allocation method. Specifically, a method of dynamically adjusting global heap allocation in multi-thread environment, comprising: identifying a global heap allocation method in an application program; judging whether the global heap allocation method is a multi-thread conflict hot point; and using a local stack to allocate memory space requested by the global heap allocation method in response to a 'yes' judging result. The method is adapted to purposefully dynamically adjust the intrinsic global heap allocation method in the program according to a real-time running state, reduce the lock contention on the global heap, and effectively improve a resource allocating efficiency and a resource utilization rate.

Dynamically adjusting global heap allocation in multi-thread environment

Global heap allocation technologies in a multi-thread environment, and particularly to a system for dynamically adjusting global heap allocation in the multi-thread environment, and more particularly to a method and system for dynamically adjusting global heap allocation by monitoring conflict parameters of the global heap allocation method. The present invention provides a system for dynamically adjusting global heap allocation in multi-thread environment, comprising: identifying a global heap allocation method in an application program; judging whether the global heap allocation method is a multi-thread conflict hot point; and using a local stack to allocate memory space requested by the global heap allocation method in response to a 'yes' judging result. The system according to the present invention is adapted to purposefully dynamically adjust the intrinsic global heap allocation method in the program according to a real-time running state, reduce the lock contention on the global heap, and effectively improve a resource allocating efficiency and a resource utilization rate.

Virtual machines are managed by obtaining software hierarchy information of a current virtual machine to be installed. Then logical memory assigned to the current virtual machine is divided into a private part and a shared part based at least in part upon existing software hierarchy information of at least one virtual machine already installed and the software hierarchy information of the current virtual machine. Then, the shared part of the logical memory is mapped to shared segments of a physical memory, wherein the shared segments are used by at least one installed virtual machine.

Managing memory in multiple virtual machines

A method of accessing a shared data structure in parallel by multiple threads in a parallel application program is disclosed. A lock of the shared data structure is granted to one thread of the multiple threads, an operation of the thread which acquires the lock is performed on the shared data structure, an operation of each thread of the multiple threads which does not acquire the lock is buffered, and the buffered operations are performed on the shared data structure when another thread of the multiple threads subsequently acquires the lock. A corresponding apparatus and program product are also disclosed.

Growing community of inventors

Beijing, China

Xiao Jun Dai