descargar SharedMemory Parallelism Can be Simple, Fast, and Scalable en PDF
Julian Shun
Descripción
Sinopsis
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 highlevel 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 threepronged approach consisting of the design of sharedmemory programming techniques, frameworks, and algorithms for important problems in computing. The thesis provides evidence that with appropriate programming techniques, frameworks, and algorithms, sharedmemory 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 highlevel 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 highlyoptimized 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 inmemory 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 linearwork and polylogarithmicdepth algorithms for suffix tree construction and graph connectivity that are also practical, as well as a workefficient, polylogarithmicdepth, and cacheefficient sharedmemory 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.
Acerca de Julian Shun
Julian Shun obtained his Ph.D. in Computer Science from Carnegie Mellon University, advised by Guy Blelloch. He obtained his undergraduate degree in Computer Science from UC Berkeley. For his Ph.D., Julian developed Ligra, a framework for largescale graph processing in shared memory, as well as algorithms for graph and text analytics that are efficient both in theory and in practice. He also developed methods for writing deterministic parallel programs and created the Problem Based Benchmark Suite for benchmarking parallel programs. Julian is currently a Miller Research Fellow at UC Berkeley.
ISBN: 9781970001907
Idioma: Español
Formatos: pdf epub kindle mobi
$3026.00
>>> Aquí GRATIS!!! <<<
Información:
 Veces descargado: 926
 Tamaño: 669KB
 Veces leído: 1552
Aquí tienes más Libros de Informática
Llegaste buscando:
SharedMemory Parallelism Can be Simple, Fast, and Scalable descargar epub, SharedMemory Parallelism Can be Simple, Fast, and Scalable gratis sin registrarse, SharedMemory Parallelism Can be Simple, Fast, and Scalable en pdf en español
¿Cómo descargar este y todos los libros del sitio?

📕Registrate gratis AQUÍ por 1 mes

📕Antes que termine el mes, CANCELA la membresia

📕Disfruta de todos los libros y contenidos que necesites