Scalable, reliable, power-efficient communication for hardware transactional memory

Update item information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Balasubramonian, Rajeev
Other Author Pugsley, Seth H.; Awasthi, Manu; Madan, Niti; Muralimanohar, Naveen
Title Scalable, reliable, power-efficient communication for hardware transactional memory
Date 2008
Description In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true for a large-scale distributed memory system where multiple transactions may attempt to commit simultaneously and co-ordination is required before allowing commits to proceed in parallel. In this paper, we propose novel algorithms to implement commit that are more scalable (in terms of delay and energy) and are free of deadlocks/livelocks. We show that these algorithms have similarities with the token cache coherence concept and leverage these similarities to extend the algorithms to handle message loss and starvation scenarios. The proposed algorithms improve upon the state-of-the-art by yielding up to a 7X reduction in commit delay and up to a 48X reduction in network messages. These translate into overall performance improvements of up to 66% (for synthetic workloads with average transaction length of 200 cycles), 35% (for average transaction length of 1000 cycles), 8% (for average transaction length of 4000 cycles), and 41% (for a collection of SPLASH-2 programs).
Type Text
Publisher University of Utah
First Page 1
Last Page 25
Subject Hardware; Transactional memory; Communication
Subject LCSH Computer storage devices; Parallel programming (Computer science)
Language eng
Bibliographic Citation Pugsley, S. H., Awasthi, M., Madan, N., Muralimanohar, N., & Balasubramonian, R. (2008). Scalable, reliable, power-efficient communication for hardware transactional memory. Technical Report UUCS-08-001, 1-25, January.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management (c)University of Utah
Format Medium application/pdf
Format Extent 159,286 bytes
Identifier ir-main,12015
ARK ark:/87278/s6ns1cdn
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-24
ID 705678
Reference URL
Back to Search Results