skip to main content
10.1145/170035.170071acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

Real-time transaction scheduling: a cost conscious approach

Authors Info & Claims
Published:01 June 1993Publication 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. AGM88a.Robert Abbot and Hector Garcia-Molina. Schedufing real-time transactions. SIGMOD RECORD, 17(1):71-81, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. AGM88b.Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions: a performance evaluation. In Proceedings of the 14th VLDB, pages 1-12. ACM, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. AGM89.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BMH89.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C+89.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.Google ScholarGoogle Scholar
  6. Fis92.Paul A. Fishwick. SIMPACK:C.based Stmu. lat,on Tool Package Versson 2.University of Florida, 1992.Google ScholarGoogle Scholar
  7. Har91.Jayant Ramaswamy Haritsa.Transaction scheduling in firm real-time database systems. Technical Report TR1036, University of Wisconsin-Madison, 1991.Google ScholarGoogle Scholar
  8. HCL90.Jayant R. Haritsa, Michael J. Carey, and Miron Livny. On being optimistic about real-time constraints. A CM SIGMOD, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. HSRT91.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. LL73.C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. JACM, pages 46-61, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Sha88.Lui Sha. Concurrency control for distributed real-time databases. SIGMOD RECORD, 17(1 ):82-98, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. SRSC91.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. SZ88.John A. Stankovic and Wei Zhao. On real-time transactions. SIGMOD RECORD, 17(1):4-18, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. XP90.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. ZRS87a.Wei Zhao, Krithi Ramamritham, and John A. Stankovic. Preemptive scheduling under time and resource constraints. 1EEE Transactions on Computers, 36(8):949-960, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. ZRS87b.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. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Real-time transaction scheduling: a cost conscious approach

              Recommendations

              Comments

              Login options

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

              Sign in
              • 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

                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]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 June 1993

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                Overall Acceptance Rate785of4,003submissions,20%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader