Parallel Programming with Transactional Memory

  • Authors:
  • Ulrich Drepper

  • Affiliations:
  • Red Hat

  • Venue:
  • Queue - The Concurrency Problem
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

While sometimes even writing regular, single-threaded programs can be quite challenging, trying to split a program into multiple pieces that can be executed in parallel adds a whole dimension of additional problems. Drawing upon the transaction concept familiar to most programmers, transactional memory was designed to solve some of these problems and make parallel programming easier. Ulrich Drepper from Red Hat shows us how it's done.