| | |
Summary: Transactional Scheduling for Read-Dominated
Workloads
Hagit Attiya and Alessia Milani
Department of Computer Science, Technion, Haifa 32000, Israel
{hagit|alessia}@cs.technion.ac.il
Abstract. The transactional approach to contention management guarantees atom-
icity by aborting transactions that may violate consistency. A major challenge in
this approach is to schedule transactions in a manner that reduces the total time to
perform all transactions (the makespan), since transactions are often aborted and
restarted. The performance of a transactional scheduler can be evaluated by the
ratio between its makespan and the makespan of an optimal, clairvoyant scheduler
that knows the list of resource accesses that will be performed by each transac-
tion, as well as its release time and duration.
This paper studies transactional scheduling in the context of read-dominated work-
loads; these common workloads include read-only transactions, i.e., those that
only observe data, and late-write transactions, i.e., those that update only towards
the end of the transaction.
We present the BIMODAL transactional scheduler, which is especially tailored to
accommodate read-only transactions, without punishing transactions that write
most of their duration, called early-write transactions. It is evaluated by compari-
|
