Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th International Conference on Very Large Data Bases, Amsterdam, Holland, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... First) LBSATF (Leaky Batched Shortest Access Time First) ASATF (Aged Shortest Access Time First) Jacobson91] and Shortest Response Time [Bates91] In addition to the above scheduling algorithms, there has been much research in scheduling algorithms for real time applications: priority FCFS [Abbott89], EDF (Earliest Deadline First) P SCAN (Priority SCAN) FDSCAN (Feasible Deadline SCAN) SSEDO (Shortest Seek and Earliest Deadline by Ordering) SSEDV (Shortest Seek and Earliest Deadline by Value) Chen90] Greedy Priority Inversion [Li95] and Preempted Missed Only (PMO) Chen94] There has ....

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. Proceedings of 15th International Conference on Very Large Data Bases (Amsterdam), pages 385--96, 1989.

....prove that its worst case response time is within a factor of 32 of the optimal. They assume that the number of processors required for each task and corresponding execution times are known. It is not clear how we can adapt the shelf packing algorithm for preemptive dynamic scheduling of tasks. In [1], Abbot and GarciaMolina consider the problem of scheduling real time transactions, which involve minimizing the makespan. Their scheduling model deals with the problems of concurrency control and I O scheduling while scheduling the transactions. In general, considerable work has been done on the ....

Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceeding of the Fifteenth International Conference on Very Large Data Bases, pages 385--395, 1989.

....soft real time class uses mean tardiness and non real time class uses throughput and response time to measure performance. Additionally, optimistic protocols have been shown to work well for firm real time transactions [HCL90, LS93, HSRT91] whereas blocking protocols suit the needs of soft [AGM89] and non real time jobs [AD85, ACL87, CS84] Consider a stock market environment [Voe87] where real time transactions are submitted by brokers who are buying and selling shares and need their transactions to complete before the current share prices change. In contrast, standard transactions are ....

.... most operating circumstances, locking algorithms outperform optimistic algorithms for non real time transactions [AD85, ACL87, CS84] ffl For soft RTDBS, 2PL HP adopted priority based High Priority (HP) conflict resolution method in locking algorithm and showed better performance than 2PL Wait [AGM89]. 2PL HP has been compared to OCC variants and 2PL HP showed better performance than OCC for soft deadline systems with finite resources [HCL90] ffl For firm RTDBS, OCC always outperforms 2PL HP in the simulation study of [HCL90, LS93] while OCC performs better than 2PL HP only when data ....

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th VLDB, pages 385--396. ACM, 1989.

....[Gra92] on RTDBS of which the most active is developing transaction scheduling algorithms for soft and firm real time transactions. The scheduler of a RTDBS is responsible for assigning priorities [HJC93, HSRT91, LL73, SZ88] and resolving access conflicts among transactions based on priorities [AGM89, BMH89, HCL90b, KS91, KM92, KM93, LS93, LS90, Sha88]. Among them several approaches [AGM88, HCL90b, HSRT91, LS93, LLH95] are specifically studied for firm RTDBS and several OCC variants have been proposed, and showed the problems of 2PL HP for firm deadline transactions. However, 2PL and 2PL HP yield better performance than OCC or OCC variants for ....

....superiority of locking over OCC comes from its early stage blocking validation policy which does not waste valuable system resources. ffl For soft RTDBS, 2PL HP adopted priority based High Priority (HP) conflict resolution method in locking algorithm and showed better performance than 2PL Wait [AGM89]. 2PLHP has been compared to OCC variants and 2PL HP showed better performance than OCC for soft deadline systems with finite resources [HCL90a] ffl For firm RTDBS, OCC always outperforms 2PL HP in the simulation study of [HCL90a, LS93] while OCC performs better than 2PL HP only when data ....

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th VLDB, pages 385--396. ACM, 1989.

....meet the requirements of transaction executions in real time databases. 2 Previous Work In addition to the approaches taken for real time systems, there is a large body of work on RTDBS that can be summarized as follows: ffl Priority scheduling and concurrency control 1. 2PL HP, 2PL WP, 2PL CR [AGM89] 2. Optimistic concurrency control (OCC) HCL90b] 3. Multiversion [KS91] 4. Mixed Integrated concurrency control [LS90] 5. Semantics and correctness [KM92] ffl Buffer management [CJL89, RMM90] ffl IO scheduling [AGM89, KS91] In this paper, we focus on priority assignment of concurrent ....

....ffl Priority scheduling and concurrency control 1. 2PL HP, 2PL WP, 2PL CR [AGM89] 2. Optimistic concurrency control (OCC) HCL90b] 3. Multiversion [KS91] 4. Mixed Integrated concurrency control [LS90] 5. Semantics and correctness [KM92] ffl Buffer management [CJL89, RMM90] ffl IO scheduling [AGM89, KS91] In this paper, we focus on priority assignment of concurrent transactions. Concurrency control based real time database (time critical database) scheduling algorithms combine various properties of time critical schedulers with properties of concurrency control algorithms [AGM92, BMH89, ....

[Article contains additional citation context not shown here]

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th VLDB, pages 385--396. ACM, 1989.

....distributed, there is no proof that the weighted SEPT rule will give an optimal result. In this paper, to concentrate on the problem of locality, we make the simplifying assumption that all queries have equal priorities and all of them have exponential processing time distributions. In [1], Abbot and Garcia Molina consider the problem of scheduling real time transactions, which involves minimizing the makespan. Their scheduling model deals with the problems of concurrency control and I O scheduling while scheduling the transactions. More recently, equivalent problems relevant to ....

Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceeding of the Fifteenth International Conference on Very Large Data Bases, pages 385--395, Amsterdam, 1989.

....prove that its worst case response time is within a factor of 32 of the optimal. They assume that the number of processors required for each task and corresponding execution times are known. It is not clear how we can adapt the shelf packing algorithm for preemptive dynamic scheduling of tasks. In [1], Abbot and Garcia Molina consider the problem of scheduling real time transactions, which involve minimizing the makespan. Their scheduling model deals with the problems of concurrency control and I O scheduling while scheduling the transactions. In general, considerable work has been done on the ....

Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceeding of the Fifteenth International Conference on Very Large Data Bases, pages 385--395, 1989.

.... variants of the traditional SCAN disk scheduling algorithm by Abbott and Garcia Molina [5] and by Carey, Jauhari, and Livny [19] the development of time cognizant broadcast disk organizations by Bestavros [11] the development of priority based buffer managers by Abbott and GarciaMolina [4] and by Kim and Srivastava [35] and the development of page replacement strategies for real time memory managers by Carey, Jauhari, and Livny [19, 33] and by Abbott and Garcia Molina [5] In [51] Pang, Carey and Livny consider memory management at a higher level. They propose an admission ....

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th International Conference on Very Large Data Bases, Amsterdam, Holland, 1989.

....protocol, we reduce worst case blocking and context switches and improve system schedulability. There have been many previous attempts to adapt concurrency control techniques to soft or firm real time systems (RTS) scheduling, in which guarantees of schedulability are not required 2 [AGM88, AGM89, CJL89, HCL90a, HCL90b, 1 The term semantic is used in this sense in the database concurrency control literature. Syntactic concurrency control techniques are those that make use of no information beyond the sequence of read and write operations on database elements. 2 Terminology in ....

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proc. 15th Intl Conf on Very Large Data Bases, August 1989.

....that miss their deadlines and mean lateness. 2 Previous work There are several classes of real time database (time critical database) scheduling algorithms in which various properties of time critical schedulers are combined with properties of concurrency control algorithms [AGM88a, AGM88b, AGM89, BMH89, CBB 89, Har91, Sha88, SRSC91, SZ88, HSRT91] Priority scheduling without knowing the data access pattern is presented as a representative of algorithms with incomplete knowledge of resource requirements. The works in [AGM88a, AGM88b, AGM89, HSRT91, Har91, SZ88] fall into this ....

....control algorithms [AGM88a, AGM88b, AGM89, BMH89, CBB 89, Har91, Sha88, SRSC91, SZ88, HSRT91] Priority scheduling without knowing the data access pattern is presented as a representative of algorithms with incomplete knowledge of resource requirements. The works in [AGM88a, AGM88b, AGM89, HSRT91, Har91, SZ88] fall into this category. Earliest Deadline First (EDF) Least Slack First (LSF) priority assignment policy with High Priority (HP) concurrency control method and Conditional Restart with estimated execution time on the main memory resident databases were proposed in [AGM88a, ....

[Article contains additional citation context not shown here]

Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th Very Large DataBase Conference, pages 385-- 396. ACM, 1989.

No context found.

Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceedings of the 15th International Conference on Very Large Data Bases, Amsterdam, Holland, 1989.

No context found.

R. Abbot and H. Garcia-Molina, "Scheduling Real-Time Transactions with Disk Resident Data", Proceedings of the Fifteenth International Conference on Very Large Databases, pp. 385-396, 1989.

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