Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

Guojing Cong, David A. Bader

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an irregular application, fine-grained synchronization is one technique for managing the coordination of work; but in practice the actual performance for irregular problems depends on the input, the access pattern to shared data structures, the relative speed of processors, and the hardware support of synchronization primitives. In this paper, we focus on lock-free and mutual exclusion protocols for handling fine-grained synchronization. Mutual exclusion and lock-free protocols have received a fair amount of attention in coordinating accesses to shared data structures from concurrent processes. Mutual exclusion offers a simple programming abstraction, while lock-free data structures provide better fault tolerance and eliminate problems associated with critical sections such as priority inversion and deadlock. These synchronization protocols, however, are seldom used in parallel algorithm designs, especially for algorithms under the SPMD paradigm, as their implementations are highly hardware dependent and their costs are hard to characterize. Using graph-theoretic algorithms for illustrative purposes, we show experimental results on two shared-memory multiprocessors, the IBM pSeries 570 and the Sun Enterprise 4500, that irregular parallel algorithms with efficient fine-grained synchronization may yield good performance.

Original languageEnglish (US)
Pages (from-to)854-866
Number of pages13
JournalJournal of Parallel and Distributed Computing
Issue number6
StatePublished - Jun 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


  • High-performance algorithm engineering
  • Irregular algorithm
  • Parallel algorithms
  • Shared memory


Dive into the research topics of 'Designing irregular parallel algorithms with mutual exclusion and lock-free protocols'. Together they form a unique fingerprint.

Cite this