The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Dec. 31, 2024
Filed:
Feb. 28, 2023
Gravic, Inc., Malvern, PA (US);
Bruce D. Holenstein, Media, PA (US);
Dylan R. Holenstein, Newtown Square, PA (US);
Paul J. Holenstein, Downingtown, PA (US);
GRAVIC, INC., Malvern, PA (US);
Abstract
A method is provided for performing transaction processing in a system. The system includes a plurality of nodes. Each node in the system includes a processor, an application executing in the processor, and a local queue. Each node executes multiple user transactions. Each transaction includes a BEGIN step, and one or more data manipulation language (DML) or data definition language (DDL) operations. In operation, two of the nodes are selected to receive the same user request to process the transaction. The processor at each of the two nodes executes in the application the same user request to process the transaction. Local indicia is created at each of the two nodes from the outcome of the transaction steps and operations of the transaction and is then exchanged with the other of the two nodes. The processor at each of the two nodes puts on their respective local queues the local indicia created at the same node as the processor, and the local indicia received from the other of the two nodes. One of the local queues of one of the nodes detects whether the two local indicia match each other. A COMMIT is executed in the processor at the one node for the transaction when a match occurs. As a result of this process, multiple user requests are processed on the two nodes even when they occur out of order on the two nodes.