Sciweavers

Share
PPOPP
2009
ACM

An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs

11 years 1 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising as a new paradigm to pursue. However, to fully exploit all the cores in a chip, parallel programming is often required, and the complexity of parallel programming raises a significant concern. Data synchronization is a major source of this programming complexity, and Transactional Memory is proposed to reduce the difficulty caused by data synchronization requirements, while providing high scalability and low performance overhead. The previous literature on Transactional Memory mostly focuses on architectural designs. Its impact on algorithms and applications has not yet been studied thoroughly. In this paper, we investigate Transactional Memory from the algorithm designer's perspective. This paper presents an algorithmic model to assist in the design of efficient Transactional Memory algorithms and a nov...
Seunghwa Kang, David A. Bader
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where PPOPP
Authors Seunghwa Kang, David A. Bader
Comments (0)
books