• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable

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

Paperback

Series: ACM Books

General ComputersProgramming

ISBN10: 1970001887
ISBN13: 9781970001884
Publisher: ACM Books
Published: Jun 1 2017
Pages: 443
Weight: 1.67
Height: 0.90 Width: 7.50 Depth: 9.25
Language: English

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.

1 different editions

Also available

Also in

General Computers