Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Noname manuscript No. (will be inserted by the editor)
 

Summary: Noname manuscript No.
(will be inserted by the editor)
Inherent Limitations on Disjoint-Access Parallel
Implementations of Transactional Memory
Hagit Attiya Eshcar Hillel Alessia
Milani
Received: date / Accepted: date
Abstract Transactional memory (TM) is a popular approach for alleviating
the difficulty of programming concurrent applications; TM guarantees that
a transaction, consisting of a sequence of operations, appear to be executed
atomically. Two fundamental properties of TM implementations are disjoint-
access parallelism and the invisibility of read operations. Disjoint access paral-
lelism ensures that operations on disconnected data do not interfere, and thus
it is critical for TM scalability. The invisibility of read operations means that
their implementation does not write to the memory, thereby reducing memory
contention.
This paper proves an inherent tradeoff for implementations of transactional
memories: they cannot be both disjoint-access parallel and have read-only
transactions that are invisible and always terminate successfully. In fact, a
lower bound of (t) is proved on the number of writes needed in order to

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences