CWHP algorithm for Scheduling Real-Time Transactions

International Journal of Computer Trends and Technology (IJCTT)          
© 2017 by IJCTT Journal
Volume-54 Number-2
Year of Publication : 2017
Authors : Fadia A. Elbagir, Ahmed Khalid, Khalid Khanfar
DOI :  10.14445/22312803/IJCTT-V54P116


Fadia A. Elbagir, Ahmed Khalid, Khalid Khanfar "CWHP algorithm for Scheduling Real-Time Transactions". International Journal of Computer Trends and Technology (IJCTT) V54(2):105-111, December 2017. ISSN:2231-2803. Published by Seventh Sense Research Group.

Scheduling is an important issue in the designof real time database systems; Transactions in real time systems must be scheduled in such a way that they can be completed before their deadlines, the scheduler assigns a priority to each transaction based on its deadline, we are particularly interested in conflicts that can lead to priority inversions.Priority inversion problem may occur due to the sharing of resources among transactions,which can cause unbound delay to high priority transaction; this delaying may result in the higher priority transactions missing their deadline.In this paper we proposed a new scheduling algorithm Conditional Waiting High Priority (CWHP), we used simulation model tocompare the performance results of our algorithm with other existing algorithms using of the most popular priority assignment schemes Earliest Deadline First (EDF) policy, focusing in “firm deadline” real time applicationsand timing information about firm transactions where transactions that miss their deadlines are discarded and the objective of the real-time database system is to maximize the number of transactions that satisfied deadlines.

[1] A. P. Buchmann. D. R. McCarthy. M. Hsu. and U. Dayal, Time-Critical Database Scheduling: A Framework for Integrating Real-Time Scheduling and Concurrency Control, Xerox Advanced information Technoio, Four Cambridge Center, Cambridge MA &!142, Feb ,1989 IEEE
[2] Abbott, R. and Garcia-Molina, H. Scheduling real-time transactions with disk- resident data. Proceedings of the Fifteenth International Conference on l, very Large Database Systems, Amsterdam, 1989.
[3] Abbott, R., And Garcia-M• Lina, H, Scheduling real-time transactions: A performance ACM Transactions on Database Systems, Vol. 17, No. 3, September 1992.
[4] Abbott, R., and Garcia-Molina, H. Scheduling real-time transactions. ACM SIGMOD Rec. (Mar. 1988), 71-81.
[5] ArezouMohammadi and Selim G. Akl, Scheduling Algorithms for Real-Time Systems, Technical Report No. 2005-499, supported by the Natural Sciences and Engineering Research Council of Canada., July 15, 2005
[6] Azer BEST A VROS et. al., Real-Time Database Systems: Issues and Applications, SPRINGER SCIENCE+BUSINESS MEDIA, LLC, Copyright © by Springer Science Business Media New York, 1997
[7] Ben Kao; and Hector Garcia-Molina, An Overview of Real-Time Database System, 1994
[8] C. H. Papdimitriou: The Theory of Database Concurrency Control. Computer Science Press (1986)
[9] E. D. Jensen, C. D. Locke, H. Tokuda: A Time-Driven Scheduling Model for Real- Time Operating Systems. IEEE Real-Time System Symposium. (1985) ,112-122
[10] Haritsa, J et al., Earliest-deadline scheduling for real-time database systems. Proceedings of the Twelfth IEEE Real-Time Systems Symposium, San Antonio, TX, 1991.
[11] Haritsa, J et al., "Data Access Scheduling in Firm Real-Time Database Sys-tems," Journal of Real-Time Systems, vol. 4, Sept. 1992.
[12] HousineChetto& Marline Chetto , Some Result of the Earliest Deadline Scheduling Algorithm,IEEE Transaction on software Engineering vol.15,10 October 1989
[13] Huang, et al., Experimental evaluation of real-time transaction processing. Proceedings of the Tenth IEEE Real-Time System Symposium, Santa Monica, CA, 1989.
[14] ijzgiirUlusoy, A Study of Two Transaction-Processing Architectures for Distributed Real-Time Data Base Systems, J. Systems Software 1995; Systems Software 1995; by Elsevier Science Inc 31:97-1080 1995.
[15] J. Huang & J. Stankovic& et, al., Real-Time Transaction processing: Design, Implementation and Performance Evaluation, COINS Technical Report 90-43. May,1990
[16] J.R. HARITSA et al, Data Access Scheduling in Firm Real-Time, Academic Publishers. Manufactured in The Netherlands. The Journal of Real-Time Systems, 4, 203-241 (1992).
[17] JAUHARI et al., Priority hints: An algorithm for priority based buffer management. TR 911, Computer Sciences Dept., Univ. of Wisconsin-Madisonj Feb. 1990
[18] Jayant R. Haritsa, et al., Value-Based Scheduling in Real-Time Database Systems, Fred J. Maryanski, Editor, VLDB Journag2 117-152 (1993)
[19] JIA XU and DAVID LORGE PARNAS, Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations, IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 16. NO. 3. MARCH 1990
[20] Jiandong Huang e.tal,” On Using Priority Inheritance in Real-Time Databases”, National Science Foundation under Grant IRI-8908693 and Grant DCR-8500332, and by the U.S. O ce of Naval Research under Grant N00014-85-K0398., March, 1991
[21] K.Ramamrithm& et. Al., Efficient Scheduling Algorithm for Real Time Multiprocessor systems, COINS Technical Report 89-37, April,1989
[22] Kam-yiu Lam & et. al., Performance Studies of Locking Protocols for Real-time Databases with Earliest Deadline First, Journal of Database Management, Vol. 6 No. 2, Manuscript originally submitted November 10, 1993; Revised August 10, 1994; Accepted September 1, 1994 for publication.
[23] Kung, H. and J. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. on Data-base Syst., vol. 6, no. 2, pp 213-226, June 1981.
[24] L. Sha, R. Rajkumar, and J. Lehoczky, "Concurrency Control for Distributed Real-Time Databases," ACM SIGMOD Record, vol. 17, no. 1, Mar. 1988.
[25] ÖzgürUlusoy&Bilkent, Lock-Based Concurrency Control in Distributed Real-Time Database Systems, Journal of Database Management, Manuscript originally submitted November 10, 1992; Accepted March 3, 1993 Accepted publication March 3, 1993
[26] P. Yu, K. Wu, K. Lin, and S. H. Son, "On Real-Time Databases: Concurrency Control and Scheduling," Proceedings of IEEE, vol. 82, no. 1, January 1994, pp 140-157.
[27] Philip S. & et. al., “On Real-Time Databases: Concurrency Control and Scheduling1994
[28] Rajendran M. et al., Priority assignment in real-time active databases, The VLDB Journal (1996) 5: 19–34
[29] Ranjana Jhala1 et al., Concurrency Control Model for Distributed Database, International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056, Volume: 02 Issue: 01 | Mar-2015
[30] Robinson, J. Design of concurrency controls for transaction processing systems, Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA, 1982.
[31] S. C. Cheng, et al.: Scheduling Algorithms for Hard Real-Time Systems | A Brief Survey. Hard Real-Time Systems, 150-173, IEEE (1988)
[32] Sang H. Son and Seog Park, Scheduling and Concurrency Control for Real-Time Database Systems, ONR, by DOE, by IBM, and, by CIT. 1992 [33] Sang H. Son, & et. al., Real-Time Database Scheduling: Design, Implementation, and Performance Evaluation, Database Systems for Advanced Applications`91. Ed. A. Makinouchi @World Scientific Publishing Co.,1991
[34] SHA, L., RAJKUMAR, R., AND LEHOCZKY, J. P. Priority inheritance protocols: An approach to real-time synchronization, CMU-CS-87-181, Dept. of Computer Science, Carnegie-Mellon Univ., Dec. 1987.
[35] Shiby et. al., Integrating Standard Transactions in Firm Real-Time Database Systems.1996
[36] Sonia Takkar. B.Tech, Scheduling Real-Time Transactions in paralle1 Database Systems, Carleton university Ottawa. Ontario. Iugust 1. 1997
[37] ulHaque, Waqar, "Transaction processing in real-time database systems " Retrospective Theses and Dissertations. (1993). Paper 10442.
[38] Yumnam Jayanta& Yumnam Somananda, Conflicting Management of Transactions in Real Time Database System, 2011 First International Conference on Informatics and Computational Intelligence,2011

Real Time, Scheduling, Firm Deadline, Priority inversion, transactions, Earliest Deadline First.