Shared-Memory Parallelism Can be Simple, Fast, and Scalable

Released on by Julian Shun
preview-18

  • Shared-Memory Parallelism Can be Simple, Fast, and Scalable Book Detail

  • Author : Julian Shun
  • Release Date : 2017-06-01
  • Publisher : Morgan & Claypool
  • Genre : Computers
  • Pages : 445
  • ISBN 13 : 1970001895
  • File Size : 40,40 MB
DOWNLOAD BOOK

Shared-Memory Parallelism Can be Simple, Fast, and Scalable by Julian Shun PDF Summary

Book Description: 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. The first part of this thesis introduces tools and techniques for deterministic parallel programming, including means for encapsulating nondeterminism via powerful commutative building blocks, as well as a novel framework for executing sequential iterative loops in parallel, which lead to deterministic parallel algorithms that are efficient both in theory and in practice. The second part of this thesis introduces Ligra, the first high-level shared memory framework for parallel graph traversal algorithms. The framework allows programmers to express graph traversal algorithms using very short and concise code, delivers performance competitive with that of highly-optimized code, and is up to orders of magnitude faster than existing systems designed for distributed memory. This part of the thesis also introduces Ligra+, which extends Ligra with graph compression techniques to reduce space usage and improve parallel performance at the same time, and is also the first graph processing system to support in-memory graph compression. The third and fourth parts of this thesis bridge the gap between theory and practice in parallel algorithm design by introducing the first algorithms for a variety of important problems on graphs and strings that are efficient both in theory and in practice. For example, the thesis develops the first linear-work and polylogarithmic-depth algorithms for suffix tree construction and graph connectivity that are also practical, as well as a work-efficient, polylogarithmic-depth, and cache-efficient shared-memory algorithm for triangle computations that achieves a 2–5x speedup over the best existing algorithms on 40 cores. This is a revised version of the thesis that won the 2015 ACM Doctoral Dissertation Award.

Disclaimer: www.yourbookbest.com does not own Shared-Memory Parallelism Can be Simple, Fast, and Scalable books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

Principles of Distributed Systems

Principles of Distributed Systems

File Size : 41,41 MB
Total View : 3153 Views
DOWNLOAD

This book constitutes the refereed proceedings of the 14th International Conference on Principles of Distributed Systems, OPODIS 2010, held in Tozeur, Tunisia,

Scalable Shared-Memory Multiprocessing

Scalable Shared-Memory Multiprocessing

File Size : 48,48 MB
Total View : 4778 Views
DOWNLOAD

Dr. Lenoski and Dr. Weber have experience with leading-edge research and practical issues involved in implementing large-scale parallel systems. They were key c

Euro-Par 2011 Parallel Processing

Euro-Par 2011 Parallel Processing

File Size : 53,53 MB
Total View : 2478 Views
DOWNLOAD

The two-volume set LNCS 6852/6853 constitutes the refereed proceedings of the 17th International Euro-Par Conference held in Bordeaux, France, in August/Septemb