In the last few decades, technology advancements have paved the way for the creation of
intelligent and autonomous systems that utilize complex calculations which are both time …

The transactional memory programming paradigm is gaining momentum as the approach of
choice for replacing locks in concurrent programming. This paper introduces the …

The memory coherence problem in designing and implementing a shared virtual memory on
loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized …

Writing concurrent programs is notoriously difficult, and is of increasing practical importance.
A particular source of concern is that even correctly-implemented concurrency abstractions …

Transactional memory (TM) simplifies parallel programming by guaranteeing that
transactions appear to execute atomically and in isolation. Implementing these properties …

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow
membership queries on a set that can be changing dynamically via insertions and deletions …

Transactional memory (TM) promises to substantially reduce the difficulty of writing correct,
efficient, and scalable concurrent programs. But" bounded" and" best-effort" hardware TM …

Applications need to become more concurrent to take advantage of the increased
computational power provided by chip level multiprocessing. Programmers have …

We report on our experience with the hardware transactional memory (HTM) feature of two
pre-production revisions of a new commercial multicore processor. Our experience includes …

The advent of multicore processors has renewed interest in the idea of incorporating
transactions into the programming model used to write parallel programs. This approach …