The purpose of this book is to help you program shared-memory parallel systems without
risking your sanity. Nevertheless, you should think of the information in this book as a …

This paper presents a novel concurrent hash table implementation which supports wait-free,
near-linearly scalable lookup, even in the presence of concurrent modifications. In particular …

Multicore systems should support both speculative and non-speculative parallelism.
Speculative parallelism is easy to use and is crucial to scale many challenging applications …

Memory transactions, similar to database transactions, allow a programmer to focus on the
logic of their program and let the system ensure that transactions are atomic and isolated …

There has been an increasing interest in using unlabeled data in semi-supervised learning
for various classification problems. Previous work shows that unlabeled data can improve or …

Multithreaded programs often suffer from synchronization bugs such as atomicity violations
and deadlocks. These bugs arise from complicated locking strategies and ad hoc …

Changes in technology can have far-reaching effects on theory. For example, while Turing's
work on computability predated the first electronic computers, complexity theory flowered …

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel
programming: NePalTM: design and implementa Page 1 NePaLTM: Design and …

Transactional memory (TM) eliminates many problems associated with lock-based
synchronization. Over recent years, much progress has been made in software and …

Parallel programming is hard, because it is impractical to test all possible thread
interleavings. One promising approach to improve a multi-threaded program's reliability is to …