Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
 

Summary: Improving Preemptive Prioritization via Statistical Characterization
of OLTP Locking
David T. McWherter Bianca Schroeder Anastassia Ailamaki
Mor Harchol-Balter
Abstract
OLTP and transactional workloads are increas-
ingly common in computer systems, ranging from e-
commerce to warehousing to inventory management.
It is valuable to provide priority scheduling in these
systems, to reduce the response time for the most im-
portant clients, e.g. the "big spenders". Two-phase
locking, commonly used in DBMS, makes prioritiza-
tion difficult, as transactions wait for locks held by oth-
ers regardless of priority. Common lock scheduling so-
lutions, including non-preemptive priority inheritance
and preemptive abort, have performance drawbacks for
TPC-C type workloads.
The contributions of this paper are two-fold: (i) We
provide a detailed statistical analysis of locking in TPC-
C workloads with priorities under several common pre-

  

Source: Ailamaki, Anastassia - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences