Exactly-once semantics in a tp queuing system

Details Exactly-once semantics in a tp queuing system Exactly-once semantics in a tp queuing system

G - Physics

06

F

354/33

G06F 17/30 (2006.01) G06F 11/14 (2006.01)

Patent

CA 1315400

EXACTLY-ONCE SEMANTICS IN A TP QUEUING SYSTEM ABSTRACT Exactly-once semantics in a transaction processing system are provided by queuing requests for data base transactions on a "task queue" and assigning a unique identification number to each request or "task" placed on the queue. When a requested transaction is performed, the task identification number is written into the data base when the data base is updated at the end of the transaction. To ensure that the updates are made exactly once in the event of a partial system failure or "crash", the data base is read to obtain any preexisting task identification number before any updates are made. If a match occurs between the identification number of the current task and any preexisting task identification number, the requested transaction is terminated without performing any current updates. Automatic recovery with exactly-once semantics therefore occurs as the result of resumed servicing of the task queue. A task which is initiated is not removed from the task queue until after its requested transaction is completed. When servicing of the task queue resumes during recovery from a partial system error, the data base has stored on it all of the identification numbers.

604070

Affiliated with

Also associated with

Rating

Exactly-once semantics in a tp queuing system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Exactly-once semantics in a tp queuing system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exactly-once semantics in a tp queuing system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1280380