Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1997-07-10
2001-08-07
Oberley, Alvin E. (Department: 2151)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
Reexamination Certificate
active
06272515
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the invention
The invention concerns a method of scheduling distributed transactions for a transactional monitor.
2. Description of the prior art
A distributed transaction is a partially ordered set of operations to be executed remotely and distributed between a number of processes. These operations can be instantiated methods in objects potentially replicated in more than one process.
A transactional monitor serializes the activation (or invocation) of the operations of the transactions in conformance with the chronological order in which the transactions are initiated.
At the level of the monitor, each transaction is initiated on the reception of an event. During the execution of a transaction the termination of a given operation leads to the reception of an event enabling activation of a subsequent operation of the transaction.
In industrial control/command applications there is a need to maintain a coherent image of the monitored process so that its behavior can be controlled. Data reflecting the image of the process is managed by means of an application and interaction between the application and the process is assured by events sent and received by sensors distributed across the process. The process being of a distributed nature, the application uses distributed transactions to maintain a coherent image of the process in a database. These industrial control/command applications run in flexible real time and it is therefore important to initiate several transactions in parallel, but this possibility of parallel initiation of transactions causes a problem at the level of operation activation scheduling. The transactions include identical or analogous operations, known as conflicting operations, since they cannot be executed at the same time because they interact with the same data.
The aim of the invention is to propose a method of scheduling distributed transactions for a transactional monitor with the possibility of parallel initiation of transactions in order to serialize activation of the operations of the transactions in accordance with the chronological order in which the transactions are initiated and allowing for conflicts of execution between operations of different transactions or of the same transaction.
Another aim of the invention is to propose a scheduling method of this kind that is suitable for complex transactions including recovery sequences if necessary.
SUMMARY OF THE INVENTION
To this end, the scheduling method of the invention comprises the steps of:
on each initiation of a current transaction, identifying, among older transactions in process of execution, operations activated or waiting to be activated of the transactions that conflict with a particular operation of the current transaction, and
for each particular operation of the current transaction for which a particular number of conflicting operations have been identified, associating with the particular operation a counter the value of which is indicative of the number of operations conflicting with the particular operation and decrementing the value of the counter as and when operations conflicting with the particular operation terminate so as to activate the particular operation only when the counter of the particular operation indicates that there are no longer any operations conflicting with the latter.
One embodiment of the invention is described in more detail hereinafter with reference to the drawings.
REFERENCES:
patent: 5377352 (1994-12-01), Tanaka et al.
patent: 5504900 (1996-04-01), Raz
patent: 5530851 (1996-06-01), Fortier
patent: 2256514 (1992-12-01), None
Georgakopoulos et al. “Chronological Scheduling of Transactions with Temporal Dependencies”, 1993.*
Orji et al. “A Performance Analysis of an Optimistic and A Basic Timestamp-Ordering Concurrency Control Algorithms for Centralized Database systems”, Feb. 1988.*
Aybay et al. “EE442 Operating Systems Lecture Notes”, 1992.*
(Coulouris, et al) Coulouris, George et al. “Distributed Systems Concepts and Design” Second Edition. Ch. 13, p. 377-404, May 1994.*
Yi Lin et al, “Concurrency Control in Real-Time Databases by Dynamic Adjustment of Serialization Order”, Proceedings of the Real Time Shystems Symposium, Lake Buena Vista, Dec. 5-7, 1990, No. Symp. 11, Dec. 5, 1990, Institute of Electrical and Electronics Engineers, pp. 104-112, XP000214341.
IBM Technical Disclosure Bulletin, vol. 37, No. 8, Aug. 1, 1994, pp. 609-614, XP000456543, “Method for Performance Enhancement in the Parallel Execution of Static Database Transactions”.
Alstom
Bullock, Jr. Lewis A.
Oberley Alvin E.
Sughrue Mion Zinn Macpeak & Seas, PLLC
LandOfFree
Method of scheduling distributed transactions does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of scheduling distributed transactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of scheduling distributed transactions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2492625