Towards a theory of online schedulers

  • Authors:
  • Kari Jouko Räihä;Henry Tirri

  • Affiliations:
  • University of Helsinki, SF-00250 Helsinki 25, Finland;University of Helsinki, SF-00250 Helsinki 25, Finland

  • Venue:
  • PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several online schedulers of transactions are considered. The scheduling algorithms are presented in a modular and uniform way. Deadlock and livelock prevention (using restarts, if necessary) is integrated into the algorithms. A metrics is defined for comparing the behavior of two schedulers on the same set of transactions. The measure that is used makes only a very simple assumption about the transactions. This assumption is easily motivated, and thus the measure is a useful approximation of measures appearing in reality. The behavior of the schedulers is compared on the basis of user delays caused by one scheduler on logs accepted as such by another scheduler. No order of magnitude differences are found, but the examples used for proving lower bounds for the delays are illustrative of the characteristics of the schedulers.