L. Sha, R. Rajkumar, S.H. Son and C.H. Chang. A RealTime Locking Protocol. IEEE Transactions on Computers, 40(7): 793-800, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Research Issues In Real-Time Database - Ulusoy (Correct)
....have a priority strictly higher than the highest priority ceiling of data items locked by the transactions other than T . Otherwise transaction T is blocked by the transaction which holds the lock on the data item of the highest priority ceiling. The performance of the protocol was examined in [53] using simulation. The results obtained revealed that the protocol performs poorly when the database is not memory resident. However, a significant improvement was observed in the performance when intention IO was used to prefetch data items accessed by transactions. A variant of the priority ....
L. Sha, R. Rajkumar, S.H. Son, C.H. Chang `A Real-Time Locking Protocol', IEEE Transactions on Computers, vol.40, no.7, 1991, pp.793-800.
Processing Real-Time Transactions In A Replicated Database System - Ulusoy (1994) (13 citations) (Correct)
....IO requests with deadlines. Carey et al. 11] and Chen et al. 13] also discussed some new approaches to priority based IO scheduling. In [35] and [36] Sha et al. presented a new priority based concurrency control protocol called priority ceiling. The performance of this protocol was examined in [37] by using simulations. In [23] Huang et al. developed and evaluated several real time policies for handling CPU scheduling, concurrency control, deadlock resolution, transaction wakeup, and transaction restart in RTDBSs. Later, their work was extended to the optimistic concurrency control method ....
L.Sha, R.Rajkumar, S.H.Son, C.H.Chang, "A Real-Time Locking Protocol", IEEE Transactions on Computers, vol.40, pp.793-800, 1991.
Real-Time in Plan 9: a short Overview - Jansen, Mullender (2003) (Correct)
....and or Earliest Deadline First (EDF) 5] protocols. In the current context we confine ourselves to an adapted EDF protocol that can handle the use of shared resources on basis of static deadline inheritance, similar to the static priority inheritance used in the Priority Ceiling (PC) protocol [7]. We call our adapted version the EDF Inheritance (EDFI) protocol. EDFI allows for the a simple specification on application level of a RT task. Feasibility analyses of the task set and admission control can be done automatically. Scheduling and synchronisation of task is completely handled at ....
L. Sha, R. Rajkumar, S. H. Son, and C. H. Chang. A real-time locking protocol. IEEE Transactions on computers, 40(7), July 1991. 3
Concurrency Control In Mobile Distributed Real-Time.. - Lam, Kuo, Tsang, Law (2000) (Correct)
....concurrency control method [6] often schedule transactions on an equal basis. Higher priority transactions may suffer from an unlimited amount of priority inversion time, where priority inversion is a situation in which a higher priority transaction is blocked by a lower priority transaction [28]. In the past decade, researchers have proposed various real time concurrency control protocols, e.g. 1, 8, 24, 29, 28, 30, 36] for single site as well as distributed RTDBS. In particular, 8, 28] proposed the idea of priority inheritance, which lets a lower priority transaction inherit the ....
.... may suffer from an unlimited amount of priority inversion time, where priority inversion is a situation in which a higher priority transaction is blocked by a lower priority transaction [28] In the past decade, researchers have proposed various real time concurrency control protocols, e.g. [1, 8, 24, 29, 28, 30, 36], for single site as well as distributed RTDBS. In particular, 8, 28] proposed the idea of priority inheritance, which lets a lower priority transaction inherit the priority of a higher priority transaction which is blocked by the lower priority transaction, to reduce the number of priority ....
[Article contains additional citation context not shown here]
L. Sha, R. Rajkumar, S.H. Son and C.H. Chang. A Real-time Locking Protocol. IEEE Transactions on Computers, 40(7):793- 800 (1991).
Evaluation of Concurrency Control Strategies for Mixed.. - Lam, Kuo, Kao, Lee.. (Correct)
.... [AG89, HCL92, ORP96, YWLS92] In the past two decades, researchers have proposed various efficient real time concurrency control techniques to either reduce the number of deadline violations for soft (and firm 1 ) real time transactions or guarantee the deadlines of hard real time transactions [AG92, BN96, HCL90, HS99, HSR92, KWL99, SLC91, SRSC91, UB93, UB98]. Some of the potential applications of RTDBS are programmed stock trading systems [AGK95, KR99] air traffic management systems, air navigation systems, and critical patient monitoring systems [KS96] An important performance index of these systems is to handle events and requests in a ....
....Future Works. 5 2 Concurrency Control Protocols and Priority Scheduling 2. 1 Concurre ncy Control Protocols for Systems with Single Type of Real time Transactions The most serious problem of conventional non real time concurrency control protocols when applied to a RTDBS is priority inversion [SRL87, SRSC91]. It is a situation in which a higher priority transaction is blocked by a lower priority transaction. When this happens, the higher priority transaction will have a high probability of missing its deadline. In order to alleviate this situation, various priority cognitive conflict resolution ....
Sha, L., Rajkumar, R., Son S.H. & Chang, C.H., "A Real-time Locking Protocol", IEEE Transactions on Computers, vol. 40, no. 7, pp. 793-800, 1991.
Concurrency Control Algorithms for Real-Time Database Systems - Lee (1994) (9 citations) (Correct)
....policies through simulation experiments. A group of concurrency control protocols for RTDBSs using two phase locking as the underlying mechanism was also proposed and evaluated. However, it was not their intention to do a comparative study of different concurrency control mechanisms. The work in [Sha88, Sha91] assumed a transaction model in which transaction priorities and resource requirements are known a priori, and presents algorithms for scheduling a fixed set of periodic transactions with hard deadlines. The rate monotonic algorithm [Liu73] is used for determining transaction priority, and a ....
Sha, L., R. Rajkumar, S. Son, and C. Chang, "A Real-Time Locking Protocol, " IEEE Transactions on Computers, Vol. 40, No. 7, July 1991, pp. 793-800.
Designing Inter-Class Concurrency Control Strategies for.. - Kam-Yiu Lam Tei-Wei (2000) (Correct)
....to guarantee no deadline violations or to minimize the number of missed deadlines, respectively. In the last decade, researchers had proposed various efficient concurrency control protocols to meet transaction deadlines, and, at the same time, to maintain database consistency for RTDBS, e.g. [3, 8, 9, 12, 16]. However, most of the previous work were focused on the concurrency control of a single type of transactions and at the same time, they always assumed the system is running in an ideal environment, where an unlimited number of priority levels are available, and data items are all memory resident. ....
....especially when a more realistic system model is considered. Concurrency control protocols designed for RTDBS with a single type of transactions may not fit the performance requirements of other types of real time transactions. For example, the well known priority ceiling protocol (PCP) [8, 12] (designed for HRT) requires a static system that is usually not true for a system with SRT. The Higher Priority Two Phases Locking Protocol (HP 2PL) 9] which is designed for SRT, cannot guarantee the deadlines of HRT or even be suitable to a RTDBS that consists of mixed SRT and NRT. The ....
[Article contains additional citation context not shown here]
Sha, L., Rajkumar, R., Son S.H. and Chang, C.H., "A Realtime Locking Protocol", IEEE Transactions on Computers, vol. 40, no. 7, pp. 793-800, 1991.
Strategies for Resolving Inter-Class Data Conflicts in Mixed.. - Lam, Kuo, Lee (Correct)
....A preliminary version of the paper will appear in the Euromicro Conference on Real time Systems, Sweden, June 2000. The work described in this paper was partially supported by a grant from the Research Grants Council of the 2 on the consequences of missing their deadlines (Bestavros, 1996; Sha et al. 1991; Yu et al. 1994) Any deadline violation of a hard real time transaction (HRT) may be catastrophic, whereas the deadline violation of a soft real time transaction (SRT) may result in a serious degradation in system performance. Firm real time transactions (FRT) are SRT except that the deadline ....
....of different types of real time transactions. On the other hand, different types of real time transactions may not satisfy the specific constraints of the protocols designed for a single type of transactions. For example, the well known priority ceiling protocol (PCP) Sha et al. 1990; Sha et al. 1991) (designed for HRT) requires a static system that is usually not true for a system with SRT. The Higher Priority Two Phase Locking Protocol (HP 2PL) Abbott and Garcia Molina, 1989; Abbott and Garcia Molina, 1992) which is designed for SRT, cannot guarantee the deadlines of HRT or even be ....
[Article contains additional citation context not shown here]
Sha, L., Rajkumar, R., Son S.H. and Chang, C.H. 1991. A Real-time Locking Protocol. IEEE Transactions on Computers, 40(7), 793-800.
The Reduced Ceiling Protocol for Concurrency Control in.. - Lam, Kuo, Tsang, Law (2000) (Correct)
....[7] and optimistic concurrency control (OCC) 7] were used to guarantee database consistency. In particular, the well known priority ceiling protocol (PCP) which is for the scheduling of tasks in hard realtime systems [6,8] has been extended for the scheduling of hard real time transactions [9]. Sha, Rajkumar, and Lehoczky [10] proposed the PCP in which processes can inherit the higher priority of a process they block. The priority ceiling of a 2 resource is the priority of the highest priority process which may use the resource. A process s resource request is blocked if its priority ....
....for soft real time transactions. We will consider different strategies for resolving different types of conflicts among hard and soft real time transactions. The performance of the RCP is demonstrated by a series of simulation experiments. An important variant of the PCP is the read write PCP [9]. The read write PCP and the PCP use the same principles for the concurrency control, except that the PCP only provides exclusive locks, and the read write PCP provides read and write locks for read and write operations, respectively. Since the focus of the paper is not to study the PCP, we choose ....
[Article contains additional citation context not shown here]
Sha, L., Rajkumar, R., Son S.H. and Chang, C.H. (1991) A Real-time Locking Protocol. IEEE Transactions on Computers, 40(7), 793-800.
On Real-Time Databases: Concurrency Control and Scheduling - Philip Yu And (1994) (44 citations) Self-citation (Son) (Correct)
No context found.
L. Sha, R. Rajkumar, S. H. Son, and C.-H. Chang. A real-time locking protocol. IEEE Trans. on Computers, 40(7):793--800, July 1991.
A Priority-Based Scheduling Algorithm for Real-Time Databases - Sang Son Department Self-citation (Son) (Correct)
No context found.
Sha, L., R. Rajkumar, S. H. Son, and C. Chang, "A Real-Time Locking Protocol," IEEE Transactions on Computers, vol. 40, no. 7, July 1991, pp 793-800.
Combined Locking Approach for Scheduling Hard Real-Time - Transactions In Real-Time (Correct)
No context found.
L. Sha, R. Rajkumar, S.H. Son and C.H. Chang. A RealTime Locking Protocol. IEEE Transactions on Computers, 40(7): 793-800, 1991.
Timeliness via Speculation for Real-Time Databases - Azer Bestavros Best (1994) (18 citations) (Correct)
No context found.
Lui Sha, R. Rajkumar, Sang Son, and Chun-Hyon Chang. "A real-time locking protocol." IEEE Transactions on Computers, 40(7):793--800, 1991.
Performance Evaluation of Two-Shadow Speculative.. - Bestavros.. (1993) (Correct)
No context found.
Lui Sha, R. Rajkumar, Sang Son, and Chun-Hyon Chang. "A real-time locking protocol. " IEEE Transactions on Computers, 40(7):793--800, 1991.
Towards Aspectual Component-Based Development of.. - Tesanovic, Nyström, .. (2003) (Correct)
No context found.
Sha, L., Rajkumar, R., Son, S.H., Chang, C.H.: A real-time locking protocol. IEEE Transactions on Computers 40 (1991) 793--800
Speculative Concurrency Control - Azer Bestavros Best (1993) (1 citation) (Correct)
No context found.
Lui Sha, R. Rajkumar, Sang Son, and Chun-Hyon Chang. "A real-time locking protocol." IEEE Transactions on Computers, 40(7):793--800, 1991.
Multi-version Speculative Concurrency Control - With Delayed Commit (1993) (Correct)
No context found.
Lui Sha, R. Rajkumar, Sang Son, and Chun-Hyon Chang. "A real-time locking protocol." IEEE Transactions on Computers, 40(7):793--800, 1991.
The Theory of Task Scheduling in Real-Time Systems: Compilation.. - Koch (1999) (Correct)
No context found.
Lui Sha, Ragunathan Rajkumar, Sang Hyuk Son, Chun-Hyon Chang. A real-time locking protocol. IEEE Transactions on Computers, 40(7):793-800, 1991.
Towards Aspectual Component-Based Development of.. - Tesanovic, Nyström, .. (2003) (Correct)
No context found.
Sha, L., Rajkumar, R., Son, S.H., Chang, C.H.: A real-time locking protocol. IEEE Transactions on Computers 40 (1991) 793--800
Combined Locking Approach for Scheduling Hard Real-Time.. - Wang, Wang, Dai (Correct)
No context found.
L. Sha, R. Rajkumar, S.H. Son and C.H. Chang. A RealTime Locking Protocol. IEEE Transactions on Computers, 40(7): 793-800, 1991.
Aspects and Components in Real-Time System.. - Tesanovic.. (2004) (Correct)
No context found.
L. Sha, R. Rajkumar, S. H. Son, and C.-H. Chang, "A real-time locking protocol," IEEE Transactions on Computers, vol. 40, no. 7, pp. 793--800, September 1991.
A Performance Evaluation Model for Distributed Real-Time.. - Ulusoy, Belford (1995) (2 citations) (Correct)
No context found.
Sha L., Rajkumar R., Son S.H., Chang C.H. `A Real-Time Locking Protocol' IEEE Transactions on Computers, vol.40, no.7, 1991, pp.793-800.
Issues in Active Real-Time Databases - Berndtsson, Hansson (1995) (5 citations) (Correct)
No context found.
L. Sha, R. Rajkumar, S. H. Son, and H-C. Chang. A real-time locking protocol. IEEE Transactions on Computers, 40(7):793--800, March 1991.
Analysis Of Concurrency Control Protocols For Real-Time Database.. - Ulusoy (1995) (3 citations) (Correct)
No context found.
L. Sha, R. Rajkumar, S. H. Son, C. H. Chang `A Real-Time Locking Protocol', IEEE Transactions on Computers, vol.40, pp.793-800, 1991.
A Simplified Concurrency Control Algorithm For Real .. - Patricia.. (Correct)
No context found.
S.H.S. Lui Sha, Rangunathan Rajkumar and C.-H. Chang. A real-time locking protocol. Transactions on Computer, 40(7), July 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC