EXECUTION OF PROGRAM REGION WITH TRANSACTIONAL MEMORY

• US 20170052726A1
• Filed: 08/21/2015
• Published: 02/23/2017
• Est. Priority Date: 08/21/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Nakaike, Takuya
• Granted Patent: US 10,241,700 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 3/0622 in relation to access
• CPC Class Codes: G06F 3/0653 Monitoring storage devices or systems
• CPC Class Codes: G06F 3/0683 Plurality of storage devices
• CPC Class Codes: G06F 9/467 Transactional memory G06F9/528 takes precedence
• CPC Class Codes: H04L 12/413 with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]

Abstract

A method for executing a program region by a computer system with transactional memory support is disclosed. The computer system uses hierarchical locks for executing the program region. Determination is conducted whether a first condition related to a transaction abort is satisfied in beginning a transaction for the program region. If the first condition is satisfied, a bottom level lock corresponding to a bottom level resource among available resources is acquired to execute the program region in the transaction. If a second condition is determined to be satisfied, a next level lock corresponding to next level resource is acquired. If the acquired lock is a top level lock corresponding to a top level resource, the program region is executed without using the transaction.

Claims

1. A method for executing a program region by a computer system using hierarchical locks with transactional memory support, each lock being associated with a shared resource among available resources, the method comprising;

in beginning a transaction for the program region, determining whether a first condition related to a transaction abort is satisfied;

acquiring a bottom level lock corresponding to a bottom level resource among the available resources to execute the program region in the transaction if the first condition is satisfied;

acquiring a next level lock corresponding to next level resource if a second condition is determined to be satisfied; and

executing the program region without using the transaction if the acquired lock is a top level lock corresponding to a top level resource.

2. The method of claim 1, wherein the method further comprises:

ending the transaction and releasing the acquired lock if the top level lock is released; and

releasing the top level lock upon ending the executing of the program region if the top level lock is acquired.

3. The method of claim 2, wherein the determining of the first condition and the beginning of the transaction are performed by a hardware logic in response to a transaction begin instruction and the ending of the transaction and the releasing of the acquired lock, or the releasing of the top level lock are performed by a hardware logic in response to a transaction end instruction.

4. The method of claim 1, wherein the hierarchical locks have one or more intermediate level locks between the top level lock and the bottom level lock, the method further comprising:

escalating a current level until reaching the top level where the top level lock is acquired.

5. The method of claim 1, wherein the transaction is rolled back in response to aborting the transaction by the transactional memory support.

6. The method of claim 1, wherein the method further comprises:

in response to determining that the second condition is not satisfied, retrying the transaction.

7. The method of claim 1, wherein the method further comprises:

prior to the acquiring of the next level lock, releasing the previously acquired lock.

8. The method of claim 1, wherein the method further comprises:

measuring a transaction abort ratio, wherein the first condition is determined to be satisfied if the transaction abort ratio exceeds a predetermined threshold.

9. The method of claim 8, wherein the transaction abort ratio is measured for each program region.

10. The method of claim 8, wherein the predetermined threshold is varied over program regions.

11. The method of claim 8, the transaction abort ratio is measured by a reason.

12. The method of claim 8, wherein the predetermined threshold is optimized by an online machine learning algorithm.

13. The method of claim 1, wherein the acquired lock is stored in the thread local storage or each thread is bound to a specific physical core in the beginning of the transaction.

14. The method of claim 1, wherein the computer system has one or more processors with simultaneous multi-threading support, each processor including one or more physical cores where one or more threads run concurrently.

15. A computer system for executing a program region by executing program instructions, the computer system comprising:

a memory tangibly storing the program instructions; and

at least a processor in communications with the memory, wherein the computer system has transactional memory support and uses hierarchical locks, each lock being associated with a shared resource among available resources, the computer system being configured to;

determine whether a first condition related to a transaction abort is satisfied in beginning a transaction for the program region;

acquire a bottom level lock corresponding to a bottom level resource among the available resources to execute the program region in the transaction if the first condition is satisfied;

acquire a next level lock corresponding to next level resource if a second condition is determined to be satisfied; and

execute the program region without using the transaction if the acquired lock is a top level lock corresponding to a top level resource.

16. The computer system of claim 15, wherein the computer system is further configured to:

end the transaction and release the acquired lock if the top level lock is released; and

release the top level lock upon ending the executing of the program region if the top level lock is acquired.

17. The computer system of claim 16, wherein the hierarchical locks have one or more intermediate level locks between the top level lock and the bottom level lock, the computer system being further configured to:

escalating a current level until reaching the top level where the top level lock is acquired.

18. A computer system for executing a program region with transactional memory support, the computer system comprising:

hierarchical locks, each lock being associated with a shared resource among available resources; and

a transaction begin module configured to determine whether a first condition related to a transaction abort is satisfied in beginning a transaction for the program region;

acquire a bottom level lock corresponding to a bottom level resource to execute the program region in the transaction if the first condition is satisfied; and

acquire a next level lock corresponding to next level resource if a second condition is determined to be satisfied;

wherein the program region is executed without using the transaction if the acquired lock is a top level lock corresponding to a top level resource.

19. The computer system of claim 18, wherein the computer system further comprises:

a transaction end module configured to end the transaction and release the acquired lock if the top level lock is released; and

release the top level lock upon ending the executing of the program region if the top level lock is acquired.

20. The computer system of claim 19, wherein the hierarchical locks have one or more intermediate level locks between the top level lock and the bottom level lock, the transaction begin module being configured to escalate a current level until reaching the top level where the top level lock is acquired.

21. The computer system of claim 19, wherein the transaction begin module is implemented by a hardware logic for responding to a transaction begin instruction and the transaction end module is implemented by a hardware logic for responding to a transaction end instruction.

22. A computer program product for executing a program region, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions comprising:

computer-executable program code to define hierarchical locks, each lock being associated with a shared resource among available resources;

computer-executable program code to determine whether a first condition related to a transaction abort is satisfied in beginning a transaction for the program region;

computer-executable program code to acquire a bottom level lock corresponding to a bottom level resource to execute the program region in the transaction if the first condition is satisfied;

computer-executable program code to acquire a next level lock corresponding to next level resource if a second condition is determined to be satisfied; and

computer-executable program code to execute the program region without using the transaction if the acquired lock is a top level lock corresponding to a top level resource.

23. The computer program product of claim 22, wherein the program instructions further comprise;

computer-executable program code to end the transaction and release the acquired lock if the top level lock is released; and

computer-executable program code to release the top level lock upon ending the executing of the program region if the top level lock is acquired.

24. The computer program product of claim 23, wherein the hierarchical locks have one or more intermediate level locks between the top level lock and the bottom level lock, the program instructions comprising:

computer-executable program code to escalate a current level until reaching the top level where the top level lock is acquired.