By Topic

Lowering Conflicts of High Contention Software Transactional Memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhang Xiaoqiang ; Sch. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha ; Peng Lin ; Xie Lunguo

Two concurrent transactions are said to conflict based on linearizability semantics if they access the same shared data and at least one of them modifies that data. In many applications enforcing the strict linearizability semantics over the entire read-set of a transaction can lead to a large number of unnecessary aborts. Concurrent threads executing transactions with high contentions can result a high transaction abort ratio which degrade the overall performance. In this paper, we investigate the use of Causal Consistency with weaker semantics that provides a good trade-off between strong semantics and good practical performance even for long transactions. Experimental results show that the implementation is simple, and substantially reduce the number of Conflicts.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:3 )

Date of Conference:

12-14 Dec. 2008