DYNAMIC PREDICTOR FOR COALESCING MEMORY TRANSACTIONS

• US 20150378907A1
• Filed: 09/04/2015
• Published: 12/31/2015
• Est. Priority Date: 12/12/2013
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Busaba, Fadi Y., Cain, Harold W. III, Gschwind, Michael Karl, Michael, Maged M., Schwarz, Eric M.
• Granted Patent: US 9,619,383 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 12/0815 Cache consistency protocols
• CPC Class Codes: G06F 12/0831 using a bus scheme, e.g. with bus monitoring or watching means
• CPC Class Codes: G06F 12/084 with a shared cache
• CPC Class Codes: G06F 2212/1008 Correctness of operation, e.g. memory ordering
• CPC Class Codes: G06F 2212/1016 Performance improvement
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 9/467 Transactional memory G06F9/528 takes precedence

Abstract

A transactional memory system predicts the outcome of coalescing outermost memory transactions, the coalescing causing committing of memory store data to memory for a first transaction to be done at transaction execution (TX) end of a second transaction, the method comprising. A processor of the transactional memory system determines whether a first plurality of outermost transactions from an associated program that were coalesced experienced an abort, the first plurality of outermost transactions including a first instance of a first transaction. The processor updates a history of the associated program to reflect the results of the determination. The processor coalesces a second plurality of outermost transactions from the associated program, based, at least in part, on the updated history.

Claims

1. A computer system for predicting an outcome of coalescing outermost memory transactions, a coalescing causing committing of memory store data to memory for a first transaction to be done at transaction execution (TX) end of a second transaction, the computer system comprising:

a memory; and

a processor in communication with the memory, wherein the computer system is configured to perform a method, said method comprising;

determining, by a processor, whether a first plurality of outermost transactions from an associated program that were coalesced experienced an abort, the first plurality of outermost transactions including a first instance of a first outermost transaction.

2. The computer system of claim 1, the method further comprising:

coalescing, by the processor, a second plurality of outermost transactions from the associated program, based, at least in part, on whether the first plurality of outermost transactions experienced the abort.

3. The computer system of claim 1, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

based on the determining indicating that the first plurality of outermost transactions did-not experience an abort, updating, by the processor, the history of the associated program to indicate that the first plurality of outermost transactions did-not experience an abort.

4. The computer system of claim 1, the method further comprising:

based on the determining indicating that the plurality of outermost transactions did-not experience an abort, flagging, by the processor, the first outermost transaction to reflect the determining indicating that the plurality of outermost transactions did-not experience an abort.

5. The computer system of claim 1, the method further comprising:

based on the determining indicating that the first plurality of outermost transactions did experience an abort, flagging, by the processor, the first outermost transaction based, at least in part, on a cause of the abort.

6. The computer system of claim 1, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination;

determining whether to add instructions to coalesce a second instance of the first outermost transaction based, at least in part, on the updated history of the associated program; and

based on the determining indicating that instructions to coalesce the second instance of the first outermost transaction are to-be added, executing the associated program which adds to a second plurality of outermost transactions one or more instructions to coalesce a second instance of the first outermost transaction.

7. The computer system of claim 1, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

predicting a result of coalescing a third outermost transaction, at least in part, on the updated history of the associated program.

8. A computer program product for predicting an outcome of coalescing outermost memory transactions, a coalescing causing committing of memory store data to memory for a first transaction to be done at transaction execution (TX) end of a second transaction, the computer program product comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

determining, by a processor, whether a first plurality of outermost transactions from an associated program that were coalesced experienced an abort, the first plurality of outermost transactions including a first instance of a first outermost transaction.

9. The computer program product of claim 8, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

coalescing, by the processor, a second plurality of outermost transactions from the associated program, based, at least in part, on the updated history.

10. The computer program product of claim 8, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

based on the determining indicating that the first plurality of outermost transactions did-not experience an abort, updating, by the processor, the history of the associated program to indicate that the first plurality of outermost transactions did-not experience an abort.

11. The computer program product of claim 8, the method further comprising:

based on the determining indicating that the plurality of outermost transactions did-not experience an abort, flagging the first outermost transaction to reflect the determining indicating that the plurality of outermost transactions did-not experience an abort.

12. The computer program product of claim 8, the method further comprising:

based on the determining indicating that the first plurality of outermost transactions did experience an abort, flagging the first outermost transaction based, at least in part, on a cause of the abort.

13. The computer program product of claim 8, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination;

determining whether to add instructions to coalesce a second instance of the first outermost transaction based, at least in part, on the updated history of the associated program; and

based on the determining indicating that instructions to coalesce the second instance of the first outermost transaction are to-be added, executing the associated program which adds to a second plurality of outermost transactions one or more instructions to coalesce a second instance of the first outermost transaction.

14. The computer program product of claim 8, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

predicting a result of coalescing a third outermost transaction, at least in part, on the updated history of the associated program.

15. A method of predicting an outcome of coalescing outermost memory transactions, a coalescing causing committing of memory store data to memory for a first transaction to be done at transaction execution (TX) end of a second transaction, the method comprising:

determining, by a processor, whether a first plurality of outermost transactions from an associated program that were coalesced experienced an abort, the first plurality of outermost transactions including a first instance of a first outermost transaction.

16. The method according to claim 15, the method further comprising:

coalescing, by the processor, a second plurality of outermost transactions from the associated program, based, at least in part, on the updated history.

17. The method according to claim 15, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination; and

based on the determining indicating that the first plurality of outermost transactions did-not experience an abort, updating, by the processor, the history of the associated program to indicate that the first plurality of outermost transactions did-not experience an abort.

18. The method according to claim 15, the method further comprising:

based on the determining indicating that the plurality of outermost transactions did-not experience an abort, flagging, by the processor, the first outermost transaction to reflect the determining indicating that the plurality of outermost transactions did-not experience an abort.

19. The method according to claim 15, the method further comprising:

based on the determining indicating that the first plurality of outermost transactions did experience an abort, flagging, by the processor, the first outermost transaction based, at least in part, on a cause of the abort.

20. The method according to claim 15, the method further comprising:

updating, by the processor, a history of the associated program to reflect a result of the determination;

determining, by the processor, whether to add instructions to coalesce a second instance of the first outermost transaction based, at least in part, on the updated history of the associated program; and

based on the determining indicating that instructions to coalesce the second instance of the first outermost transaction are to-be added, executing, by the processor, the associated program which adds to a second plurality of outermost transactions one or more instructions to coalesce a second instance of the first outermost transaction.