Shared-Memory Parallelism Can Be Simple, Fast, and Scalable by Julian Shun

Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp

Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.

The feel-good place to buy books
  • Free delivery in Australia
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • Proud to be a B Corp – A Business for good

Shared-Memory Parallelism Can Be Simple, Fast, and Scalable by Julian Shun

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. This thesis addresses this challenge, and provides evidence that shared-memory programs can be simple, fast, and scalable.
Shun, Julian: - 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 large-scale 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.
SKU Unavailable
ISBN 13 9781970001884
ISBN 10 1970001887
Title Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
Author Julian Shun
Series Acm Bks
Condition Unavailable
Binding Type Paperback
Publisher Morgan & Claypool Publishers
Year published 2017-06-30
Number of pages 443
Cover note Book picture is for illustrative purposes only, actual binding, cover or edition may vary.