Scheduling Value-Based Nested Transactions in Distributed Real-Time Database Systems

  • Authors:

  • Hong-Ren Chen;Y. H. Chin

  • Affiliations:

  • Department of Education, National University of Tainan, Tainan 70005, Taiwan, R.O.C hrchen@ipx.ntntc.edu.tw;Department of Computer Science, National Tsing Hua University, Hsinchu 30013, Taiwan, R.O.C. yhchin@cs.nthu.edu.tw

  • Venue:
  • Real-Time Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many noticeable studies have focussed on scheduling flat transactions in a distributed real-time database system (RTDBS). However, a nested transaction model has been widely adopted in many real-life applications such as Internet stock trading systems and telecommunications. This work concerns efficiently scheduling real-time nested transactions in a distributed RTDBS. A new real-time scheduler called flexible high reward for nested transactions (FHRN) is proposed. FHRN consists of (1) FHRNp1 policy to schedule real-time nested transactions and (2) 2PL_HPN to resolve the concurrent data-accessing problem among interleaved nested transactions. Simulation results show that FHRN outperforms these existent real-time schedulers such as random priority (RP), earliest deadline (ED), highest value (HV), hierarchical earliest deadline (HED), and highest reward and urgency (HRU) when an application requires a nested transaction model.