International Journal of Computational Intelligence Research

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

NLCP: A Heuristic for Priority Assignment Policy in Distributed Real Time Database System


Affiliations
1 Uttarakhand Technical University Dehradun,(UK), India
2 MMM Engg. College Gorakhpur,(UP), India
     

   Subscribe/Renew Journal


Distributed database technology and real - time databases have been important areas of research in the recent days. It has been advised that many benefits can be obtained by integrating real - time and distributed database technologies. This paper deals with an important aspects of transaction processing in distributed real time databases, namely the problem of assigning priorities to transaction and as well as sub - transaction. We will present an efficient heuristic for assigning priorities to parent transaction as well as their child named cohorts or sub - transaction. We will also give the analysis of the heuristic with suitable example and show that how the priorities can be assigned.

Keywords

Priority Assignment Policy, Distributed Real Time Database System
Subscription Login to verify subscription
User
Notifications
Font Size


  • Aldarmi, S.A.: Real-time database systems: concepts and design. Department of Computer Science, University of York, April 1998.

  • Seshadri, T.S., Haritsa, J.R.: Integrating standard transactions in real-time database systems. Inf. Syst. 21(1), 3–28 (1996).

  • Stankovic, J.A.: Misconception about real-time computing. IEEE Comput. 21(10), 10–19 (1988).

  • Vrbsky, S.V., Tomic, S.: Satisfying timing constraints of real time databases. J. Syst. Softw. 41, 63 73(1998). www.mpcs.org/MPCS98/Final_Papers/Paper.48.pdf.

  • Lam, K.-W., Lee, V.C.S., Hung, S.L.: Transaction scheduling in distributed real-time systems. Int. J. Time-Crit. Comput. Syst. 19, 169–193 (2000).

  • Lee, V.C.S., Lam, K.-W., Hung, S.L.: Concurrency control for mixed transactions in real-time databases. IEEE Trans. Comput. 51(7), 821–834 (2002).

  • Ulusoy Ozgur, “Research Issues in Real - time Database Systems,” Information Sciences, Volume 87, Issues 1 - 3, pp. 123 - 151, November 1995.

  • Arahna, R.F.M., Ganti, V., Narayanan, S., Muthukrishnan, C.R., Prasad, S.T.S., Ramamritham, K.: Implementation of a real-time database system. Inf. Syst. 21(1), 55–74 (1996).

  • Chen, Y.-W., Gruenwald, L.: Effects of deadline propagation on scheduling nested transactions in distributed real-time database systems. J. Inf. Syst. 21(1), 103–124 (1996).

  • Lindström, J., Raatikainen, K.: Using importance of transactions and optimistic concurrency control in firm real-time databases. In: Proceedings of the 7th International Conference on Real-Time Computing Systems and Applications (RTCSA’2000), Cheju Island, South Korea, 12–14 December 2000.

  • Lindstrom, J.: Optimistic concurrency control method for distributed real time database systems. PhD thesis, Report A-2003-I, Helsinki University, January 2003.

  • Agrawal Divyakant, Abbadi A. El, Jeffers R. and Lin L., “Ordered Shared Locks for Real - time Databases,” International Journals of Very Large Data Bases (VLDB Journal), Vol. 4, Issue 1, pp. 87 - 126, January 1995.

  • Datta Anindya, Mukhejee S., Konana F., Yiguler I. R. and Bajaj A., “Multiclass Transaction Scheduling and Overload Management in Firm Real - Time Database Systems,” Information Systems, Vol. 21, No.1, pp. 29 - 54, 1996.

  • DiPippo Lisa C. and Wolfe Victor F., “Real - Time Databases,” Database Systems Handbook, Multiscience Press, 1997.

  • Kao Ben and Garcia - Monila H., “An Overview of Real - time Database Systems,” Advances in real - time systems, pp. 463 - 486, 1995.

  • Ramamritham Krithi, “Real - time Databases,” Distributed and Parallel Databases, Special Issue: Research Topics in Distributed and Parallel Databases, Vol. 1, Issue 2, pp. 199 - 226, April 1993.

  • Audsley Neil C., Burns A., Richardson M. F. and Wellings A. J., “Absolute and Relative Temporal Constraints in Hard Real Time Databases,” Proceedings of the 4 th Euromicro Workshop on Real - time Systems, IEEE Computer Society Press, Athens, pp. 148 – 153, June 1992.

  • Liu C. L. and Layland J. W., “Scheduling Algorithms for Multiprogramming in a Hard Real - time Environment,” Journals of the ACM, Vol. 20, No. 1, pp. 46 - 61, Jan. 1973.

  • Abbott, R., Garcia-Monila, H.: Scheduling real-time transaction: a performance evaluation. In: Proceedings of the 14th International Conference on Very Large Databases, pp. 1–12, August 1988.

  • Pang, H.H.: Query processing in firm real-time database systems. PhD thesis, University of Wisconsin, Madison (1994).

  • Pang, H.H., Carey, M.J., Livny,M.: Multiclass query scheduling in real-time database systems. IEEE Trans. Knowl. Data Eng. 7(4), 533–551 (1995).

  • Dogdu, E., Ozsoyoglu, G.: Real-time transactions with execution histories: priority assignment and load control. In: Proceedings of the 6th International Conference on Information and Knowledge Management, Las Vegas, NV, pp. 301– 308.

  • Kao Ben and Garcia - Molina H., “Deadline Assignment in a Distributed Soft Real - Time System,” Proceedings of the 13 th International Conference on Distributed Computing Systems, pp. 428 - 437, 1993.

  • Lee Victor C. S., Lam K. Y., Kao Benjamin C. M., Lam K. W. and Hung S. L., “Priority Assignment for Sub - Transaction in Distributed Real - time Databases,” 1st International Workshop on Real - Time Database Systems, 1996.

  • Kao Ben and Garcia - Molina H., “Subtask Deadline Assignment for Complex Distributed Soft Real - time Tasks,” Technical Report 93 - 149, Stanford University, 1993.

  • Chen, H.-R., Chin, Y.H., Tseng, S.-M.: Scheduling value-based transactions in distributed real-time database systems. In: Proceedings of the 15th International Parallel and Distributed Processing Symposium, 23–27 April 2001, pp. 978–984 (2001).

  • Haritsa, J.R., Ramamritham, K., Gupta, R.: The PROMPT real-time commit protocol. IEEE Trans. Parallel Distrib. Syst. 11(2), 160–181 (2000).

  • Udai, S., Manoj, M., Sarje, A.K.: Priority assignment heuristic and issue of fairness to cohorts executing in parallel. WSEAS Int. Trans. Comput. 4(7), 758–768 (2005).

  • Haritsa Jayant R., Carey Michael J. and Linvy Miron, “Dynamic Real - Time Optimistic Concurrency Control,” Proceedings of the 11 th Real - Time Systems Symposium, Dec. 1990.

  • Chen Yu - Wei, and Gruenwald Le, “Effects of Deadline Propagation on Scheduling Nested Transactions in Distributed Real - Time Database Systems,” Journal of Information Systems, Vol. 21, No. 1, pp. 103 - 124, 1996.


Abstract Views: 669

PDF Views: 12




  • NLCP: A Heuristic for Priority Assignment Policy in Distributed Real Time Database System

Abstract Views: 669  |  PDF Views: 12

Authors

Sanjeev Kumar Singh
Uttarakhand Technical University Dehradun,(UK), India
R. K. Singh
Uttarakhand Technical University Dehradun,(UK), India
P. K. Singh
MMM Engg. College Gorakhpur,(UP), India

Abstract


Distributed database technology and real - time databases have been important areas of research in the recent days. It has been advised that many benefits can be obtained by integrating real - time and distributed database technologies. This paper deals with an important aspects of transaction processing in distributed real time databases, namely the problem of assigning priorities to transaction and as well as sub - transaction. We will present an efficient heuristic for assigning priorities to parent transaction as well as their child named cohorts or sub - transaction. We will also give the analysis of the heuristic with suitable example and show that how the priorities can be assigned.

Keywords


Priority Assignment Policy, Distributed Real Time Database System

References