A. Datta and et al. Multiclass transaction scheduling and overload management in firm real-time database systems. Information Systems, 21(1):29--54, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....performed. The locks of a transaction will be released upon its commitment. 6.2. Model Parameters and Performance Measures Similar to many previous studies on single site and distributed RTDBS, the deadline of a transaction, T, is defined according to the expected execution time of a transaction [1, 4, 8, 17, 18]: Deadline = ar(T) pex(T) 1 SF) where SF : the slack factor which is a random variable uniformly chosen from a slack range; ar(T) the arrival time of transaction T; pex(T) the predicted execution time of T. It is defined as: pex(T) T lock T process T update ) N oper where N ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Information Systems, 21(1):29-54 (1996).

....shown the superiority of the optimistic concurrency control protocols over the lockbased protocols, due to more fruitful restarts. 2. 2 Concurrency Control for Mixed Real time Database Systems The study of concurrency control protocols for MSRTDBS has received growing interests in recent years [DMKV96, KS96, LKTL00, TSH96]. One of the pioneer studies is [TSH96] in which a two level concurrency control architecture is proposed for MSRTDBS. The upper level is a master concurrency controller (MCC) which is used to detect data conflicts between transactions belonging to different classes. The MCC also forwards data ....

....For light computation, a CPU time of 2 to 4 ms is assumed. For heavy computation, a CPU time of 5 ms to 15 ms is assumed. Similar to many previous studies for RTDBS, the deadline of a soft real time transaction, T, is defined according to the expected execution time of the transaction [AGM92, DMKV96, HCL92, U95, U98] such as: Deadline = ar(T) slack time where slack time : pex(T) 1 SF) SF : the slack factor which is a random variable uniformly chosen from a slack range; ar(T) the arrival time of transaction T; pex(T) the predicted execution time of T. 21 Although the deadlines of soft real time ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, A. Bajaj, "Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems", Information Systems, vol.21, no. 1, 1996, pp. 29-54.

....time, we will also focus the mixed scheduling of transactions under a more realistic system model. 3 The MRTDBS Model A simple but typical RTDBS model is adopted in this work. The model consists of a transaction manager (TM) a scheduler (S) and a resource manager (RM) as shown in Figure 1 [3, 4, 8, 16]. The TM is responsible for transaction initialization, abort, commit, and restart. It is also responsible for assigning priorities to transactions according to their deadlines and criticality levels. The scheduler is responsible for concurrency control and scheduling of transactions in using the ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, A. Bajaj, "Multiclass Transaction Scheduling and Overload Management in Firm Real-time Database Systems", Information Systems, vol.21, no. 1, 1996, pp. 29-54.

....40 60 80 100 0 0.5 1 1.5 2 2.5 Figure 8c: Level Restart Ratio Restart Ratio Arrival Rate Overall OPT WAIT Public 2PL HP Secret LEGEND Figure 8. Restricted Write Model 7.5. Experiment 5: SRTDBS versus MULTI CLASS RTDBS There have been quite a few studies of RTDBS systems (e.g. [9]) where the input is composed of a set of disjoint prioritized transaction classes. An SRTDBS is similar to such a generic multi class RTDBS with the security levels in the SRTDBS corresponding to the transaction classes in the multi class environment. A major difference, however, is that the ....

A. Datta et al, "Multiclass Transaction Scheduling and Overload Management in Firm Realtime Database Systems", Information Systems, 21(1), March 1996.

....protocols for concurrency control, commit processing, transaction scheduling, and logging and recovery. There now exists ample evidence that such protocols are considerably better at supporting real time transaction and data correctness than standard database protocols which simply go fast [1, 6, 7, 10, 12]. Real time computing is equivalent to fast computing. The objective of fast computing is to minimize the average response time of a set of transactions. However, the objectives of real time databases are to meet the timing constraints and the data timing validity requirements of individual ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj, Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Databases, Information Systems, Vol. 21, No. 1, pp. 29-54, March 1996.

....critical or firm) ffl b i the maximum amount of time that transaction i can block another transaction of higher priority. 2. 2 Description of the Research Problem Current state of the art scheduling algorithms featuring overload tolerance either reject transactions upon arrival (e.g. [5, 7]) or carry out only partial execution of transactions (e.g. imprecise computation tasks and incremental algorithms [17, 18, 13] The rejection method is only applicable for real time systems where non critical (soft and firm) transactions are rejected at run time, and where critical periodic ....

A. Datta, S. Mukherjee, P. Konana, I. R. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Information Systems, 21(1):29--54, 1996.

....are chosen to have the highest priority values (hit group) Using a feedback mechanism, the capacity of the hit group is adjusted dynamically to improve the performance. AED is later improved [PLC92] to Adaptive Earliest Virtual Deadline (AEVD) policy using a similar technique. Datta et al. [Dat96] addresses some of the weaknesses in AEVD, and proposes the Adaptive Access Parameter (AAP) method for the explicit admission control. In this paper, we propose admission and load control techniques for scheduling repeating transactions based on execution histories. Admission control algorithms we ....

A. Datta, S. Mukherjee, P. Konana, I. R. Viguier, A. Bajaj, "Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems", Information Systems, v.21(1): 29-54, 1996.

....of our ongoing research that explores transaction execution in RTADBs. We are currently looking at various aspects of transaction management, including CPU scheduling, overload management, concurrency control, buffer management etc. For our study on scheduling and overload management, refer to [14]. In this document we report PAPER, a buffer management algorithm developed for active, real time transactions. Our preliminary results indicate PAPER outperforms other buffer management algorithms under a wide range of system loading and resource availability conditions. 1.1 Motivation and ....

....considers a real time context. The pioneering work in RTDBS performance evaluation was reported in [1, 2, 3] where the authors simulated a number of CC protocols based on the two phase locking algorithm. However, this work was not examined in an active context. A subset of notable RTDBS work [23, 22, 25, 29, 44, 5, 14]. Again, all this work has been performed without considering the effects of triggering. Having identified some important work in ADBSs as well as RTDBSs, let us reiterate that not much exists in the synthesis of the two areas. An exciting and very recent development was the International ....

[Article contains additional citation context not shown here]

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Forthcoming in Information Systems, 1996.

....verify how this measure overcomes the drawbacks of the standard OCC algorithm. Scheduling: As mentioned earlier, overload management becomes very critical in scheduling in ARCS environments. Recently, we have done some work on overload management through admission control, which is reported in [7]. The overload management mechanism attempts to optimize resource usage under highly loaded conditions by checking the existing load in the system before admitting a transaction. The basic goal is to admit a transactions only if enough free resources exist to service its computational requirement. ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Forthcoming in Information Systems, Scheduled to appear in late 1996, 1996.

....on temporal query processing, and [15] which is one of the very few papers that we are aware of, on temporal transaction processing. RTDBSs have seen substantial research effort as well in recent years. Much of this effort has been focussed towards developing high performance scheduling algorithms [1, 2, 14, 21, 25, 31, 37] as well as concurrency control algorithms [6, 22, 24, 26, 27, 33] Typically, performance has been characterized as the ability to reduce transaction tardiness. None of this work has been performed with temporal consistency in mind. Even though not much is reported on the confluence of temporal ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems. Information Systems, 21(1):29--54, March 1996.

....of our ongoing research that explores transaction execution in RTADBs. We are currently looking at various aspects of transaction management, including CPU scheduling, overload management, concurrency control, buffer management etc. For our study on scheduling and overload management, refer to [14]. In this document we report PAPER, a buffer management algorithm developed for active, realtime transactions. Our preliminary results indicate PAPER outperforms other buffer management algorithms under a wide range of workload conditions. 1.1 Motivation and Related Work Data buffering is an ....

....Active Real time Database System Model In this section, we present a synopsis of our RTADB model to aid the readers in better understanding the performance analysis results. This model was simulated in SIMPACK [20] a C based simulation toolkit. This model is an extension of the model we used in [14]. The model, shown in figure 4, has six components: a Source that generates the non triggered, or external workload of the system; a Transaction Manager that models the execution details of the transactions; a Concurrency Controller that implements the OPT BC [32] protocol for managing ....

A. Datta, S. Mukherjee, I. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Technical Report RTRG-TR-95-01, Real Time Research Group, MIS Dept., University of Arizona, 1995.

....work considers a real time context. The pioneering work in RTDBS performance evaluation was reported in [1, 2, 3] where the authors simulated a number of CC protocols based on the two phase locking algorithm. However, this work was not examined in an active context. A subset of notable RTDBS work [24, 23, 26, 29, 42, 4, 13]. Again, all this work has been performed without considering the effects of triggering. Having identified some important work in ADBSs as well as RTDBSs, let us reiterate that not much exists in the synthsis of the two areas. An exciting and very recent development was the International ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass transaction scheduling and overload management in firm real-time database systems. Forthcoming in Information Systems, Scheduled to appear in late 1996, 1996.

....is not much work at all on the synthesis of these fields, which is what this paper proposes. There has been substantial research efforts devoted to Real Time database Systems (RTDBSs) in recent years. Much of this effort has been focussed towards developing high performance scheduling algorithms [1, 2, 22, 25, 31, 12, 34] as well as concurrency control algorithms [21, 26, 27, 24, 23, 32] For a nice discussion on the requirements of RTDBSs see [20] and for a nice survey of recent work see [48] Typically, performance has been characterized as the ability to reduce transaction tardiness. None of this work has been ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems. Information Systems, 21(1):29--54, March 1996.

....temporal transaction processing, is a very open problem which has been recognized as being important. Real Time database Systems (RTDBSs) have seen substantial research effort as well in recent years. Much of this effort has been focussed towards developing high performance scheduling algorithms [1, 2, 35, 38, 44, 21, 50] as well as concurrency control algorithms [8, 34, 39, 40, 37, 36, 46] For a nice discussion on the requirements of RTDBSs see [33] and for a nice survey of recent work see [73] Typically, performance has been characterized as the ability to reduce transaction tardiness. None of this work has ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems. Information Systems, 21(1):29--54, March 1996.

....on temporal query processing, and [15] which is one of the very few papers that we are aware of, on temporal transaction processing. RTDBSs have seen substantial research effort as well in recent years. Much of this effort has been focussed towards developing high performance scheduling algorithms [1, 2, 21, 25, 31, 14, 37] as well as concurrency control algorithms [26, 27, 24, 22, 6, 33] Typically, performance has been characterized as the ability to reduce transaction tardiness. None of this work has been performed with temporal consistency in mind. Even though not much is reported on the confluence of temporal ....

A. Datta, S. Mukherjee, P. Konana, I. Viguier, and A. Bajaj. Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems. Information Systems, 21(1):29--54, March 1996.

No context found.

A. Datta and et al. Multiclass transaction scheduling and overload management in firm real-time database systems. Information Systems, 21(1):29--54, 1996.

No context found.

Datta , A., Mukherjee, S., Konana , P., Viguier, I., Bajaj, A. 1996. Multiclass Transaction Scheduling and Overload Management in Firm Real-time Database Systems. Information Systems, 21(1), 29-54.

No context found.

S. Datta et al., "Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Databases," Information Systems, Mar. 1996, pp. 29-54.

No context found.

A. Datta, S. Mukherjee, P. Konana, I.R. Viguier, and A. Bajaja, "Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems", Information Systems, Vol. 21, No. 1, pp. 29-54, 1996.

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