Unbounded page-based transactional memory

Chuang Weihaw, Satish Narayanasamy, Ganesh Venkatesh, John Morgan Sampson, Michael Van Biesbrouck, Gilles Pokam, Osvaldo Colavin, Brad Calder

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are desirable, as they can increase the scope of transactions' use, and thereby further simplify a programmer's job. However, hardware support is essential to support efficient execution of unbounded transactions. In this paper, we introduce Page-based Transactional Memory to support unbounded transactions. We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data.

Original languageEnglish (US)
Pages (from-to)347-358
Number of pages12
JournalACM SIGPLAN Notices
Volume41
Issue number11
StatePublished - Nov 1 2006

Fingerprint

Data storage equipment
Hardware

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Weihaw, C., Narayanasamy, S., Venkatesh, G., Sampson, J. M., Van Biesbrouck, M., Pokam, G., ... Calder, B. (2006). Unbounded page-based transactional memory. ACM SIGPLAN Notices, 41(11), 347-358.
Weihaw, Chuang ; Narayanasamy, Satish ; Venkatesh, Ganesh ; Sampson, John Morgan ; Van Biesbrouck, Michael ; Pokam, Gilles ; Colavin, Osvaldo ; Calder, Brad. / Unbounded page-based transactional memory. In: ACM SIGPLAN Notices. 2006 ; Vol. 41, No. 11. pp. 347-358.
@article{59f930a290ae48d0b845fd4a86bcf147,
title = "Unbounded page-based transactional memory",
abstract = "Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are desirable, as they can increase the scope of transactions' use, and thereby further simplify a programmer's job. However, hardware support is essential to support efficient execution of unbounded transactions. In this paper, we introduce Page-based Transactional Memory to support unbounded transactions. We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data.",
author = "Chuang Weihaw and Satish Narayanasamy and Ganesh Venkatesh and Sampson, {John Morgan} and {Van Biesbrouck}, Michael and Gilles Pokam and Osvaldo Colavin and Brad Calder",
year = "2006",
month = "11",
day = "1",
language = "English (US)",
volume = "41",
pages = "347--358",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "11",

}

Weihaw, C, Narayanasamy, S, Venkatesh, G, Sampson, JM, Van Biesbrouck, M, Pokam, G, Colavin, O & Calder, B 2006, 'Unbounded page-based transactional memory', ACM SIGPLAN Notices, vol. 41, no. 11, pp. 347-358.

Unbounded page-based transactional memory. / Weihaw, Chuang; Narayanasamy, Satish; Venkatesh, Ganesh; Sampson, John Morgan; Van Biesbrouck, Michael; Pokam, Gilles; Colavin, Osvaldo; Calder, Brad.

In: ACM SIGPLAN Notices, Vol. 41, No. 11, 01.11.2006, p. 347-358.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Unbounded page-based transactional memory

AU - Weihaw, Chuang

AU - Narayanasamy, Satish

AU - Venkatesh, Ganesh

AU - Sampson, John Morgan

AU - Van Biesbrouck, Michael

AU - Pokam, Gilles

AU - Colavin, Osvaldo

AU - Calder, Brad

PY - 2006/11/1

Y1 - 2006/11/1

N2 - Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are desirable, as they can increase the scope of transactions' use, and thereby further simplify a programmer's job. However, hardware support is essential to support efficient execution of unbounded transactions. In this paper, we introduce Page-based Transactional Memory to support unbounded transactions. We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data.

AB - Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are desirable, as they can increase the scope of transactions' use, and thereby further simplify a programmer's job. However, hardware support is essential to support efficient execution of unbounded transactions. In this paper, we introduce Page-based Transactional Memory to support unbounded transactions. We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data.

UR - http://www.scopus.com/inward/record.url?scp=33846550124&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846550124&partnerID=8YFLogxK

M3 - Article

VL - 41

SP - 347

EP - 358

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 11

ER -

Weihaw C, Narayanasamy S, Venkatesh G, Sampson JM, Van Biesbrouck M, Pokam G et al. Unbounded page-based transactional memory. ACM SIGPLAN Notices. 2006 Nov 1;41(11):347-358.