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

افزودن به بوکمارک اشتراک گذاری 0 دیدگاه کاربران 2 (1)

مشارکت: عنوان و توضیح کوتاه هر کتاب را ترجمه کنید این ترجمه بعد از تایید با نام شما در سایت نمایش داده خواهد شد.

ترجمه این کتاب مشاهده همه کتاب های ترجمه نشده

از خودتان درباره کتاب توضیح کوتاهی بنویسید

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.

"

لغو

گزارش تخلف

مغایرت عنوان کتاب با توضیحات و تصویر جلد
عدم رعایت حقوق نشر طبق قوانین جمهوری اسلامی ایران
محتوای مستهجن
توهین به قومیتها و محتوای نژادپرستی
توهین به اقیلیتهای مذهبی
اهانت به مقامات سیاسی و مذهبی
اشاعه ی کودک آزاری
سایر موارد

بستن

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2017

نویسنده

Julian Shun

ناشر

ACM Books

شابک

9781970001914

20,000 تومان

خرید کتاب مطالعه نمونه درخواست ترجمه کتاب

خرید کتاب Shared-Memory Parallelism Can Be Simple, Fast, and Scalable

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

گزارش تخلف

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2017

نویسنده

ناشر

شابک

کتاب های مرتبط

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

Vom interaktiven Werkzeug zu kooperativen Arbeits- und Lernwelten

Expertensysteme '87 [siebenundachtzig], Konzepte und Werkzeuge [am 7. u. 8. 4. 1987 in Nürnberg]

PPoPP'10 : proceedings of the 2010 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming; January 9-14, 2010, Bangalore, India.

International Symposium on Symbolic and Algebraic Computation : July 27-29, Berkeley, Calif.

Verified Functional Programming in Agda

Verified Functional Programming in Agda

Communities of Computing

Heterogeneous Computing

Making Databases Work

Architecture of Computing Systems - ARCS 2014 27th International Conference, Lübeck, Germany, February 25-28, 2014. Proceedings

The test access port and boundary scan architecture

Digital Design and Computer Organization

Computer Architecture

Pattern-Oriented Software Architecture for Dummies

Server Architectures

Server Architectures

System Architecture with XML

The First Computers--History and Architectures

Architecture of Computing Systems - ARCS 2014 27th International Conference, Lübeck, Germany, February 25-28, 2014. Proceedings

Maritime Wideband Communication Networks

دیدگاه کاربران