Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
 

Summary: Transactional Contention Management
as a Non-Clairvoyant Scheduling Problem
Hagit Attiya
Leah Epstein
Hadas Shachnai
Tami Tamir§
ABSTRACT
The transactional approach to contention management
guarantees atomicity by making sure that whenever two
transactions have a conflict on a resource, only one of them
proceeds. A major challenge in implementing this approach
lies in guaranteeing progress, since transactions are often
restarted.
Inspired by the paradigm of non-clairvoyant job schedul-
ing, we analyze the performance of a contention manager by
comparison with an optimal, clairvoyant contention manager
that knows the list of resource accesses that will be per-
formed by each transaction, as well as its release time and
duration. The realistic, non-clairvoyant contention manager
is evaluated by the competitive ratio between the last com-

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology
Tamir, Tami - School of Computer Science and Engineering, Interdisciplinary Center Herzliya

 

Collections: Computer Technologies and Information Sciences