Priority-based scheduling with adaptive speculative locking in distributed real-time transaction processing

  • Authors:
  • Waqar Haque

  • Affiliations:
  • University of Northern British Columbia, Prince George, BC, Canada

  • Venue:
  • SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The priority assignment protocols can significantly impact the performance of a real-time transaction processing system. The effect of these protocols has been studied under various system and load configurations with the Adaptive Speculative Locking (ASL) as the underlying concurrency control mechanism. The simulation results show that both Earliest Deadline First (EDF) and Shortest Job First (SJF) can provide superior performance depending on the resources available and workload conditions. The effect of update probability and transaction arrival rate is also studied. The paper also provides a significant background of the problem and the related work.