Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Nested Parallelism in Transactional Memory Kunal Agrawal Jeremy T. Fineman Jim Sukha
 

Summary: Nested Parallelism in Transactional Memory
Kunal Agrawal Jeremy T. Fineman Jim Sukha
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology
Cambridge, MA 02139, USA
{kunal ag, jfineman, sukhaj}@mit.edu
Abstract
This paper investigates adding transactions with nested parallelism
and nested transactions to a dynamically multithreaded parallel
programming language that generates only series-parallel pro-
grams. We describe XConflict, a data structure that facilitates con-
flict detection for a software transactional memory system which
supports transactions with nested parallelism and unbounded nest-
ing depth. For languages that use a Cilk-like work-stealing sched-
uler, XConflict answers concurrent conflict queries in O(1) time
and can be maintained efficiently. In particular, for a program with
T1 work and a span (or critical-path length) of T, the running time
on p processors of the program augmented with XConflict is only
O(T1/p+ pT).
Using XConflict, we describe CWSTM, a runtime-system de-

  

Source: Agrawal, Kunal - Department of Computer Science and Engineering, Washington University in St. Louis

 

Collections: Computer Technologies and Information Sciences