Yoon Seok Hwan, Kim Pyoung Jung, Park Ji Eun, Lee Jae Young, Lee Tong Hyun, Kung Sang Hwan

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 5, pp. 1196-1210, May. 1997
10.3745/KIPSTE.1997.4.5.1196,   PDF Download:

Abstract

Timestamp-Ordering Protocol among transaction scheduling algorithms can cause the priority reversion that a transaction with higher priority is processed after the transaction with lower priority by assigning timestamp to transactions entering system and scheduling them based on the timestamp. To prevent this reversion, we suggest a data priority-based timestamp ordering protocol to schedule transactions based on their priority within the same timestamp group after grouping transactions into constant time interval based on entering points. To evaluate the performance of this protocol, we compared the performance of this protocol with that of others after constructing the simulation environment with real time database system. We verified that the performance of proposed protocol is superior to that of timestamp ordering protocol under the condition of high load and high data conflicts.

Statistics
Cite this article