Method, apparatus and computer programs providing cluster-wide page management

• US 9,170,950 B2
• Filed: 01/16/2013
• Issued: 10/27/2015
• Est. Priority Date: 01/16/2013
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dube, Parijat, Guerin, Xavier R., Seelam, Seetharami R.
• Primary Examiner(s): Cheema, Umar
• Assistant Examiner(s): MCLEOD, MARSHALL M
• Application Number:
  US13/742,530
• Publication Number:
  US 20140201302A1
• Time in Patent Office: 1,014 Days
• Field of Search: 709/212, 709/213, 709/217
• US Class Current: 1/1
• CPC Class Codes: G06F 12/08 in hierarchically structured memory systems, e.g. virtual memory systems
• CPC Class Codes: G06F 12/084 with a shared cache
• CPC Class Codes: G06F 12/0864 using pseudo-associative means, e.g. set-associative or hashing
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 2009/45583 Memory management, e.g. access or allocation
• CPC Class Codes: G06F 2212/152 Virtualized environment, e.g. logically partitioned system
• CPC Class Codes: G06F 2212/163 Server or database system
• CPC Class Codes: G06F 2212/62 Details of cache specific to multiprocessor cache arrangements
• CPC Class Codes: G06F 9/45558 Hypervisor-specific management and integration aspects

Abstract

An exemplary method in accordance with embodiments of this invention includes, at a virtual machine that forms a part of a cluster of virtual machines, computing a key for an instance of a memory page that is to be swapped out to a shared memory cache that is accessible by all virtual machines of the cluster of virtual machines; determining if the computed key is already present in a global hash map that is accessible by all virtual machines of the cluster of virtual machines; and only if it is determined that the computed key is not already present in the global hash map, storing the computed key in the global hash map and the instance of the memory page in the shared memory cache.

Claims

1. A method comprising:

at a virtual machine that forms a part of a cluster of virtual machines, computing a key for an instance of a memory page that is to be swapped out to a shared memory cache that is accessible by all virtual machines of the cluster of virtual machines;

determining if the computed key is already present in a global hash map that is accessible by all virtual machines of the cluster of virtual machines; and

only if it is determined that the computed key is not already present in the global hash map, storing the computed key in the global hash map and the instance of the memory page in the shared memory cache.

2. The method as in claim 1, where computing the key comprises at least in part processing the instance of the memory page using a hashing algorithm.

3. The method of claim 1, where the shared memory cache is comprised of an in-memory shared memory cache and where access to the in-memory shared memory cache is via remote direct memory access (RDMA) interconnects.

4. The method of claim 1, where prior to migrating the virtual machine from a first instance of a virtual machine to a second instance of a virtual machine, sending information relating to a plurality of the keys to the second instance of the virtual machine enabling the second instance of the virtual machine to retrieve a corresponding plurality of memory pages from the shared memory cache.

5. The method as in claim 4, where the information comprises a pointer to a location where the plurality of keys are stored.

6. The method as in claim 5, where the plurality of keys are stored with the memory pages in the shared memory cache.

7. The method as in claim 1, where for a memory page that is identical to a memory page associated with another virtual machine of the cluster of virtual machines there is a single key identifying the memory page in the global hash map.

8. A non-transitory computer-readable storage medium containing data representing computer-executable program code, where execution of the program code results in operations that comprise:

at a virtual machine that forms a part of a cluster of virtual machines, computing a key for an instance of a memory page that is to be swapped out to a shared memory cache that is accessible by all virtual machines of the cluster of virtual machines;

determining if the computed key is already present in a global hash map that is accessible by all virtual machines of the cluster of virtual machines; and

only if it is determined that the computed key is not already present in the global hash map, storing the computed key in the global hash map and the instance of the memory page in the shared memory cache.

9. The non-transitory computer-readable storage medium as in claim 8, where computing the key comprises at least in part processing the instance of the memory page using a hashing algorithm.

10. The non-transitory computer-readable storage medium as in claim 8, where the shared memory cache is comprised of an in-memory shared memory cache and where access to the in-memory shared memory cache is via remote direct memory access (RDMA) interconnects.

11. The non-transitory computer-readable storage medium as in claim 8, where prior to migrating the virtual machine from a first instance of a virtual machine to a second instance of a virtual machine, sending information relating to a plurality of the keys to the second instance of the virtual machine enabling the second instance of the virtual machine to retrieve a corresponding plurality of memory pages from the shared memory cache.

12. The non-transitory computer-readable storage medium as in claim 11, where the information comprises a pointer to a location where the plurality of keys are stored.

13. The non-transitory computer-readable storage medium as in claim 12, where the plurality of keys are stored with the memory pages in the shared memory cache.

14. The non-transitory computer-readable storage medium as in claim 8, where for a memory page that is identical to a memory page associated with another virtual machine of the cluster of virtual machines there is a single key identifying the memory page in the global hash map.