SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR MOVEABLE DISTRIBUTED SYNCHRONIZATION OBJECTS

• US 20180198731A1
• Filed: 01/11/2017
• Published: 07/12/2018
• Est. Priority Date: 01/11/2017
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Krauss, Kirk J.
• Granted Patent: US 10,623,487 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

A resource sharing method, system, and computer program product in a distributed computing environment, includes in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest, storing the synchronization object on the first node for use in synchronizing access to a resource, and in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest, and relocating the synchronization object from a storage on the first node to a storage on the second node.

Claims

1. A computer-implemented resource sharing method in a distributed computing environment, the method comprising:

in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest;

storing the synchronization object on the first node, for use in synchronizing access to a resource;

in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest; and

relocating the synchronization object from a storage on the first node to a storage on the second node.

2. The computer-implemented method of claim 1, wherein the node on which the access rate of the synchronization object is greatest is determined by an analysis of profiling results.

3. The computer-implemented method of claim 1, wherein the node on which the access rate of the synchronization object is greatest is determined by a speculative code analysis or execution.

4. The computer-implemented method of claim 1, wherein the first condition comprises a beginning of a run and a second condition comprises an entry of a routine, and wherein the second condition comprises a relocation of a resource from the first node to the second node.

5. The computer-implemented method of claim 4, wherein the routine is resident on the second node and the relocating of the synchronization object from the first node to the second node is performed in response to entering the routine.

6. The computer-implemented method of claim 1, wherein the relocating the synchronization object from the storage on the first node to the storage on the second node comprises invalidating an instance of the synchronization object on the first node and validating a pre-existing instance of the synchronization object on the second node.

7. The computer-implemented method of claim 1, embodied in a cloud-computing environment.

8. A computer program product for resource sharing, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform:

in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest;

storing the synchronization object on the first node, for use in synchronizing access to a resource;

in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest; and

relocating the synchronization object from a storage on the first node to a storage on the second node.

9. The computer program product of claim 8, wherein the node on which the access rate of the synchronization object is greatest is determined by an analysis of profiling results.

10. The computer program product of claim 8, wherein the node on which the access rate of the synchronization object is greatest is determined by a speculative code analysis or execution.

11. The computer program product of claim 8, wherein the first condition comprises a beginning of a run and a second condition comprises an entry of a routine.

12. The computer program product of claim 11, wherein the routine is resident on the second node and the relocating of the synchronization object from the first node to the second node is performed in response to entering the routine.

13. The computer program product of claim 8, wherein the relocating the synchronization object from the storage on the first node to the storage on the second node comprises invalidating an instance of the synchronization object on the first node and validating a pre-existing instance of the synchronization object on the second node.

14. A resource sharing system, said system comprising:

a processor; and

a memory, the memory storing instructions to cause the processor to perform;

in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest;

storing the synchronization object on the first node, for use in synchronizing access to a resource;

in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest; and

relocating the synchronization object from a storage on the first node to a storage on the second node.

15. The system of claim 14, wherein the node on which the access rate of the synchronization object is greatest is determined by an analysis of profiling results.

16. The system of claim 14, wherein the node on which the access rate of the synchronization object is greatest is determined by a speculative code analysis or execution.

17. The system of claim 14, wherein the first condition comprises a beginning of a run and a second condition comprises an entry of a routine.

18. The system of claim 17, wherein the routine is resident on the second node and the relocating of the synchronization object from the first node to the second node is performed in response to entering the routine.

19. The system of claim 14, wherein the relocating the synchronization object from the storage on the first node to the storage on the second node comprises invalidating an instance of the synchronization object on the first node and validating a pre-existing instance of the synchronization object on the second node.

20. The system of claim 14, embodied in a cloud-computing environment.