MECHANISM FOR CREATING FRIENDLY TRANSACTIONS WITH CREDENTIALS

• US 20170126683A1
• Filed: 05/03/2016
• Published: 05/04/2017
• Est. Priority Date: 11/04/2015
• Status: Active Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bradbury, Jonathan D., Busaba, Fadi Y., Gschwind, Michael Karl, Salapura, Valentina, Schwarz, Eric M., Shum, Chung-Lung K.
• Granted Patent: US 10,270,775 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 11/14 Error detection or correction of the data by redundancy in operation G06F11/16 takes precedence
• CPC Class Codes: G06F 11/1471 involving logging of persistent data for recovery
• CPC Class Codes: G06F 11/1474 in transactions G06F16/20 takes precedence
• CPC Class Codes: G06F 12/0828 with concurrent directory accessing, i.e. handling multiple concurrent coherency transactions
• CPC Class Codes: G06F 12/0877 Cache access modes
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 21/00 Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
• CPC Class Codes: G06F 9/467 Transactional memory G06F9/528 takes precedence
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources

Abstract

One or more transactions may request or be assigned tokens within a transactional memory environment. A transaction may be created by at least one thread. A first transaction that includes a first token type may be received. A request may be received for a for a potential conflict check between the first transaction and a second transaction. In response to receiving the transaction potential conflict check, the first transaction and the second transaction are determined to be conflicting or not conflicting. The second transaction is assigned a token type in response to the determination of the transaction potential conflict check between the first transaction and the second transaction.

Claims

1. A computer-implemented method for assigning tokens to transactions in a transactional memory environment, wherein a transaction is created by at least one thread, the method comprising:

receiving a first transaction having a first token type associated with the first transaction;

receiving a request for a transaction potential conflict check between the first transaction and a second transaction;

determining, in response to receiving the request for the transaction potential conflict check, whether the first transaction and the second transaction are conflicting; and

assigning the second transaction a second token type based on the transaction potential conflict check between the second transaction and the first transaction.

2. The method of claim 1, further comprising:

determining a completion of the first transaction;

reclaiming, in response to the completion of the first transaction, the first token type from the first transaction; and

returning the reclaimed first token type to a token pool which stores unused tokens.

3. The method of claim 1, wherein the second transaction is assigned a second token type that is identical to the first token type.

4. The method of claim 3, wherein the second transaction is assigned a second token type that is identical to the first token type based on determining that the first transaction and the second transaction share credentials.

5. The method of claim 3, wherein the second transaction is assigned a second token type that is identical to the first token type based on determining that a first memory partition used in the first transaction does not overlap with a second memory partition used in the second transaction.

6. The method of claim 1, wherein the second transaction is assigned a second token type that is different from the first token type.

7. The method of claim 6, wherein the second transaction is assigned a second token type that is different from the first token type based on determining that a first memory partition of the first transaction overlaps with a second memory partition of the second transaction.