CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Dynamic Priority Assignment and Conflict Resolution in Real Time Databases

by Alok Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 4
Year of Publication: 2010
Authors: Alok Kumar
10.5120/93-194

Alok Kumar . Dynamic Priority Assignment and Conflict Resolution in Real Time Databases. International Journal of Computer Applications. 1, 4 ( February 2010), 90-91. DOI=10.5120/93-194

@article{ 10.5120/93-194,
author = { Alok Kumar },
title = { Dynamic Priority Assignment and Conflict Resolution in Real Time Databases },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 4 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 90-91 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number4/93-194/ },
doi = { 10.5120/93-194 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:44:17.816700+05:30
%A Alok Kumar
%T Dynamic Priority Assignment and Conflict Resolution in Real Time Databases
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 4
%P 90-91
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The conflict resolution technique normally used in Real Time Systems is EDF(Earliest Deadline First).However ,this technique is found to be biased towards the shorter transactions. No technique has been Reported in the literature to remove this biasing. This paper presents a new technique of dynamic priority assignment in real time transactions that is based on the ratio of time left to the time required to complete the transaction. The transaction which has the minimum fraction of time leftover as compared to the time taken for completion of that transaction is executed first. Thus it is free from any short of biasing.

References
  1. Abbott Robert and Garcia - Molina H., “Scheduling Real - time Transactions with Disk Resident Data,” Proceedings of the 15th International Conference on Very Large Databases, Amsterdam, The Netherlands, pp. 385 - 395, 1989.
  2. Abbott Robert and Garcia - Monila H., “Scheduling Real - Time Transaction: a Performance Evaluation,” Proceedings of the 14th International Conference on Very Large Databases, pp. 1 - 12, August 1988.
  3. Abdallah Maha, Guerraoui R. and Pucheral P., “one - Phase Commit: Does It Make Sense,” Proceedings of the International Conference on Parallel and Distributed Systems (ICPADS'98), Tainan, Taiwan, Dec. 14 - 16, 1998.
  4. Agrawal Divyakant, Abbadi A. El and Jeffers R., “Using Delayed Commitment in Locking Protocols for Real - Time Databases,” Proceedings of the ACM International Conference on Management of Data (SIGMOD), San Diego, California, pp. 104 -113, June 2 - 5, 1992.
  5. 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.
  6. Aldarmi Saud A. and Burns A., “Dynamic CPU Scheduling with Imprecise Knowledge of Computation Time,” Technical Report YCS - 314, Department of Computer Science, University of York, U. K., 1999.
  7. Aldarmi Saud A., “Real - Time Database Systems: Concepts and Design,” Department of Computer Science, University of York, April 1998.
  8. Al - Houmaily Yousef J. and Chrysanthis P. K., “Atomicity with Incompatible Presumptions,” Proceedings of the 18th ACM Symposium on Principles of Database Systems (PODS), Philadelphia, June 1999.
  9. Al - Houmaily Yousef J. and Chrysanthis P. K., “In Search for An Efficient Real - Time Atomic Commit Protocol,”
  10. Url = citeseer.nj.nec.com/47189.html.
  11. Al - Houmaily Yousef J., Chrysanthis P. K. and Levitan Steven P., “Enhancing the Performance of Presumed Commit Protocol,” Proceedings of the ACM Symposium on Applied Computing, San Jose, CA, USA, February 28 - March 1, 1997.
  12. Al - Houmaily Yousef J., Chrysanthis P. K. and Levitan Steven P., “An Argument in Favor of the Presumed Commit Protocol,” Proceedings of the IEEE International Conference on Data Engineering, Birmingham, April 1997.
  13. Arahna Rohan F. M., Ganti Venkatesh, Narayanan Srinivasa, Muthukrishnan C. R., Prasad S. T. S. and Ramamritham K., “Implementation of a real - time database system,” Information Systems, Vol. 21 , Issue 1, pp. 55 - 74, March 1996.
  14. Attaluri Gopi K. and Salem Kenneth, “The Presumed - Either Two - Phase Commit Protocol,” IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5, pp. 1190 - 1196, Sept. - Oct. 2002.
  15. Audsley Neil C., Burns A., Richardson M. F. and Wellings A. J., “Data Consistency in Hard Real - Time Systems”, YCS 203, Department of Computer Science, University of York, June 1993.
  16. 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 4th Euromicro Workshop on Real - time Systems, IEEE Computer Society Press, Athens, pp. 148 – 153, June 1992.
  17. Bestavros Azer, “Advances in Real - Time Database Systems Research,” ACM SIGMOD Record, Vol. 24, No. 1, pp. 3 - 8, 1996.
  18. Bestavros Azer, Lin K. J. and Son S. H., “Real - Time Database Systems: Issues and Applications,” Kluwer Academic Publishers, 1997.
  19. Bowers David S., “Directions in Databases,” Lecture Notes in Computer Science, 826, Springer - Verlag, pp. 23 - 54.
Index Terms

Computer Science
Information Sciences

Keywords

Real Time Systems EDF Dynamic Priority Assignment Distributed Database

Powered by PhDFocusTM