Shared-memory parallelism can be simple, fast, and scalable
- 1st ed.
- UK: Morgan & Claypool, 2017
- xv, 426 p. : col. ill.; 23.5 cm.
- ACM books #15 .
Includes bibliographical references and index., "This is a revised version of the thesis that won the 2015 ACM Doctoral Dissertation Award."--Back cover.
Parallelism is the key to achieving high performance in computing. However, writing efficient and scalable parallel programs is notoriously difficult, and often requires significant expertise. To address this challenge, it is crucial to provide programmers with high-level tools to enable them to develop solutions easily, and at the same time emphasize the theoretical and practical aspects of algorithm design to allow the solutions developed to run efficiently under many different settings. This thesis addresses this challenge using a three-pronged approach consisting of the design of shared-memory programming techniques, frameworks, and algorithms for important problems in computing. The thesis provides evidence that with appropriate programming techniques, frameworks, and algorithms, shared-memory programs can be simple, fast, and scalable, both in theory and in practice. The results developed in this thesis serve to ease the transition into the multicore era