Skip to main content
Presentation
Workshop on relaxing synchronization for multicore and manycore scalability (RACES 2012)
Proceedings of the 3rd annual conference on Systems, programming, and applications: software for humanity (2012)
  • Andrew P. Black, Portland State University
  • Theo D'Hondt, Vrije Universiteit Brussel
  • Doug Kimelman
  • Martin Rinard, Massachusetts Institute of Technology
  • David Unger
Abstract

Massively-parallel systems are coming: core counts keep rising whether conventional cores as in multicore and manycore systems, or specialized cores as in GPUs. Conventional wisdom has been to utilize this parallelism by reducing synchronization to the minimum required to preserve determinism in particular, by eliminating data races. However, Amdahl's law implies that on highly-parallel systems even a small amount of synchronization that introduces serialization will limit scaling. Thus, we are forced to confront the trade-off between synchronization and the ability of an implementation to scale performance with the number of processors: synchronization inherently limits parallelism. This workshop focuses on harnessing parallelism by limiting synchronization, even to the point where programs will compute inconsistent or approximate rather than exact answers.

Keywords
  • Computer software -- Development,
  • Programming languages (Electronic computers)
Publication Date
2012
Comments
Copyright (2012) ACM
Citation Information
Andrew P. Black, Theo D'Hondt, Doug Kimelman, Martin Rinard, et al.. "Workshop on relaxing synchronization for multicore and manycore scalability (RACES 2012)" Proceedings of the 3rd annual conference on Systems, programming, and applications: software for humanity (2012)
Available at: http://works.bepress.com/andrew_black/38/