Abstract

In normal shadow SWIFT commit protocol shadow of all the borrower transactions which satisfy a given criteria are created when the lock manager processes the request. This creates heavy overhead on the system and degrades its performance. In this paper, we have presented a new method of handling the requests by the borrower transactions. We create the shadow only when the borrower aborts due to abort of lender and can complete its execution in the remaining time. Further, the shadow uses the work already done by borrower transaction .We also propose the use of selective commit depending on Lender’s commitment. Thus it prevents any overhead associated with the maintenance of the shadow as was the case in earlier shadow based protocols.

References

• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• Aldarmi Saud A., “Real - Time Database Systems: Concepts and Design,” Department of Computer Science, University of York, April 1998.
• 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.
• Al - Houmaily Yousef J. and Chrysanthis P. K., “In Search for An Efficient Real - Time Atomic Commit Protocol,”
• Url = citeseer.nj.nec.com/47189.html.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• Bestavros Azer, “Advances in Real - Time Database Systems Research,” ACM SIGMOD Record, Vol. 24, No. 1, pp. 3 - 8, 1996.