Patent ID: 9245054
Filing Date: 2016-01-26
CPC Classification: G06F

Claim Text:
1. A computer-implemented method for maintaining serialization between separate transactions, comprising: searching, by a processing device, a queue using a transaction; retrieving a first sequence number from a queue header; retrieving a second sequence number in local storage for the transaction; comparing the first sequence number with the second sequence number; resuming a search of the queue using an address of a next element saved from a previous transaction responsive to the first sequence number matching the second sequence number; and starting a search of the queue at a first element responsive to the first sequence number not matching the second sequence number, wherein the transaction is aborted due to a selected one of a group comprising a defined maximum number of elements searchable by the transaction is reached, the first sequence number is incremented by another processing device, a lock is acquired by another processing device, and a fetch and store overflow condition occurs, wherein the defined maximum number of elements searchable by the transaction is lowered each time the transaction restarts due to an abort.