More Web Proxy on the site http://driver.im/

Article

Free access

Real-time transaction scheduling: a cost conscious approach

Authors:

S. ChakravarthyAuthors Info & Claims

SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data

Pages 197 - 206

https://doi.org/10.1145/170035.170071

Published: 01 June 1993 Publication History

Abstract

Real-time databases are an important component of embedded real-time systems. In a real-time database context, transactions must not only maintain the consistency constraints of the database but must also satisfy the timing constraints specified for each transaction. Although several approaches have been proposed to integrate real-time scheduling and database concurrency control methods, none of them take into account the dynamic cost of scheduling a transaction. In this paper, we propose a new cost conscious real-time transaction scheduling algorithm which considers dynamic costs associated with a transaction. Our dynamic priority assignment algorithm adapts to changes in the system load without causing excessive numbers of transaction restarts. Our simulations show its superiority over EDF-HP algorithm.

References

[1]

Robert Abbot and Hector Garcia-Molina. Schedufing real-time transactions. SIGMOD RECORD, 17(1):71-81, 1988.

Digital Library

[2]

Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions: a performance evaluation. In Proceedings of the 14th VLDB, pages 1-12. ACM, 1988.

Digital Library

[3]

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

Digital Library

[4]

A. Buchmann, D.R. McCarthy, and M. Hsu. Time-critical database scheduling: A framework for integrating real-time scheduling and concurrency control. In Proceedings of the Fifth Conference on Data Engineering, pages 470-480, Feb 1989.

Digital Library

[5]

S. Chakravarthy et al. HiPAC: A Research Project in Active, Time-Constrained Database Management, Final Report. Technical Report XAIT-89-02, Xerox Advanced Information Technology, Cambridge, MA, Aug. 1989.

[6]

Paul A. Fishwick. SIMPACK:C.based Stmu. lat,on Tool Package Versson 2.University of Florida, 1992.

[7]

Jayant Ramaswamy Haritsa.Transaction scheduling in firm real-time database systems. Technical Report TR1036, University of Wisconsin-Madison, 1991.

[8]

Jayant R. Haritsa, Michael J. Carey, and Miron Livny. On being optimistic about real-time constraints. A CM SIGMOD, 1990.

Digital Library

[9]

Jiandong Hyang, John A. St#nkovic, Krithi Ramamritham, and Don Towsley. Experimental evaluation of real-time optimistic concurrency control schemes. In Proceedings of the 17th VLDB, pages 35-46. ACM, 1991.

Digital Library

[10]

C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. JACM, pages 46-61, 1973.

Digital Library

[11]

Lui Sha. Concurrency control for distributed real-time databases. SIGMOD RECORD, 17(1 ):82-98, 1988.

Digital Library

[12]

Lui Sha, Ragunathan Rajkumar, Sang Hyuk Son, and Chun-Hyun Chang. A real-time locking protocol IEEE Transact,ons on Computers, 40(7):793-800, 1991.

Digital Library

[13]

John A. Stankovic and Wei Zhao. On real-time transactions. SIGMOD RECORD, 17(1):4-18, 1988.

Digital Library

[14]

Jia Xu and David R. Parnas. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Transactions on Software Engineering, 16(3):360-369, 1990.

Digital Library

[15]

Wei Zhao, Krithi Ramamritham, and John A. Stankovic. Preemptive scheduling under time and resource constraints. 1EEE Transactions on Computers, 36(8):949-960, 1987.

Digital Library

[16]

Wei Zhao, Krithi Ramamritham, and John A. Stankovic. Scheduling tasks with requirement in hard real-time systems. IEEE Transactions on Software Engzneering, 13(5):225-236, 1987.

Digital Library

Cited By

Lohmann STutsch D(2023)The Doubly Linked Tree of Singly Linked Rings: Providing Hard Real-Time Database Operations on an FPGAComputers10.3390/computers1301000813:1(8)Online publication date: 24-Dec-2023
https://doi.org/10.3390/computers13010008
Moon HChi YHacigümüş HKosar TRaicu IBarga R(2011)Performance evaluation of scheduling algorithms for database services with soft and hard SLAsProceedings of the second international workshop on Data intensive computing in the clouds10.1145/2087522.2087536(81-90)Online publication date: 14-Nov-2011
https://dl.acm.org/doi/10.1145/2087522.2087536
Thiele MLehner W(2010)Evaluation of Load Scheduling Strategies for Real-Time Data Warehouse EnvironmentsEnabling Real-Time Business Intelligence10.1007/978-3-642-14559-9_6(84-99)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14559-9_6
Show More Cited By

Recommendations

Real-Time Transaction Scheduling: A Framework for SynthesizingStatic and Dynamic Factors

Real-time databases are poised to be an important component of complex embedded real-time systems. In real-time databases (as opposed to real-time systems), transactions must satisfy the ACID properties in addition to satisfying the timing constraints ...
Transaction scheduling in firm real-time database systems
Real-time transaction scheduling: a cost conscious approach

Real-time databases are an important component of embedded real-time systems. In a real-time database context, transactions must not only maintain the consistency constraints of the database but must also satisfy the timing constraints specified for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data

June 1993

566 pages

ISBN:0897915925

DOI:10.1145/170035

Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia

ACM SIGMOD Record Volume 22, Issue 2
June 1, 1993
558 pages
ISSN:0163-5808
DOI:10.1145/170036
Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia,
Won Kim
UniSQL, Inc., Austin, TX
Issue’s Table of Contents

Copyright © 1993 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS93

Sponsor:

SIGMOD/PODS93: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD

May 25 - 28, 1993

D.C., Washington, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
744
Total Downloads

Downloads (Last 12 months)120
Downloads (Last 6 weeks)21

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lohmann STutsch D(2023)The Doubly Linked Tree of Singly Linked Rings: Providing Hard Real-Time Database Operations on an FPGAComputers10.3390/computers1301000813:1(8)Online publication date: 24-Dec-2023
https://doi.org/10.3390/computers13010008
Moon HChi YHacigümüş HKosar TRaicu IBarga R(2011)Performance evaluation of scheduling algorithms for database services with soft and hard SLAsProceedings of the second international workshop on Data intensive computing in the clouds10.1145/2087522.2087536(81-90)Online publication date: 14-Nov-2011
https://dl.acm.org/doi/10.1145/2087522.2087536
Thiele MLehner W(2010)Evaluation of Load Scheduling Strategies for Real-Time Data Warehouse EnvironmentsEnabling Real-Time Business Intelligence10.1007/978-3-642-14559-9_6(84-99)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14559-9_6
Wu HLuo QLi JLabrinidis ADiao YJensen CNascimento MTatbul N(2009)Quality aware query scheduling in wireless sensor networksProceedings of the Sixth International Workshop on Data Management for Sensor Networks10.1145/1594187.1594197(1-6)Online publication date: 24-Aug-2009
https://dl.acm.org/doi/10.1145/1594187.1594197
Thiele MBader ALehner W(2009)Multi-objective scheduling for real-time data warehousesComputer Science - Research and Development10.1007/s00450-009-0062-z24:3(137-151)Online publication date: 2-Apr-2009
https://doi.org/10.1007/s00450-009-0062-z
Tseng SChin YYang W(2005)Dynamic multiprocessor scheduling for supporting real-time constraintsAdvances in Computing Science — ASIAN'9710.1007/3-540-63875-X_45(83-97)Online publication date: 1-Aug-2005
https://doi.org/10.1007/3-540-63875-X_45
Chen HChin Y(2004)Scheduling Value-Based Nested Transactions in Distributed Real-Time Database SystemsReal-Time Systems10.1023/B:TIME.0000029050.47538.2527:3(237-269)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1023/B%3ATIME.0000029050.47538.25
Wette CPierre SConan J(2004)A comparative study of some concurrency control algorithms for cluster-based communication networksComputers and Electrical Engineering10.1016/j.compeleceng.2004.08.00330:8(615-636)Online publication date: 1-Nov-2004
https://dl.acm.org/doi/10.1016/j.compeleceng.2004.08.003
Hong-Ren Chen Chin Y(2002)An efficient real-time scheduler for nested transaction modelsNinth International Conference on Parallel and Distributed Systems, 2002. Proceedings.10.1109/ICPADS.2002.1183421(335-340)Online publication date: 2002
https://doi.org/10.1109/ICPADS.2002.1183421
Hong-Ren Chen Chin YShin-Mu Tseng (2001)Scheduling value-based transactions in distributed real-time database systemsProceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 200110.1109/IPDPS.2001.925053(978-984)Online publication date: 2001
https://doi.org/10.1109/IPDPS.2001.925053
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents