오디오북 라이프의 시작

격이 다른 오디오북 생활을 경험해보세요!

  • 언제든 손쉽게 구독해지 가능
  • 월정액 11900원 부터
  • 무제한 청취
  • 총 5만권 이상의 영/한 오디오북
  • 온가족을 위한 다양한 오디오북
지금 바로 시작해보세요!
kr all devices

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

시리즈

1 of 64

언어
영어
Format
카테고리

논픽션

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.

© 2017 ACM Books (전자책 ): 9781970001907

출시일

전자책 : 2017년 6월 1일

태그

    다른 사람들도 즐겼습니다 ...

    언제 어디서나 스토리텔

    • 국내 유일 해리포터 시리즈 오디오북

    • 5만권이상의 영어/한국어 오디오북

    • 키즈 모드(어린이 안전 환경)

    • 월정액 무제한 청취

    • 언제든 취소 및 해지 가능

    • 오프라인 액세스를 위한 도서 다운로드

    인기

    스토리텔 언리미티드

    5만권 이상의 영어, 한국어 오디오북을 무제한 들어보세요

    11900 원 /월
    • 계정 1개

    • 무제한 청취

    • 사용자 1인

    • 무제한 청취

    • 언제든 해지하실 수 있어요

    지금 바로 시작하기

    패밀리

    친구 또는 가족과 함께 오디오북을 즐기고 싶은 분들을 위해

    매달 17900원 부터
    • 2-3 계정

    • 무제한 청취

    • 2-3 계정

    • 무제한 청취

    • 언제든 해지하실 수 있어요

    2 개 계정

    17900 원 /월
    지금 바로 시작하기