Shared-Memory Parallelism Can Be Simple, Fast, and Scalable - Info and Reading Options

Open Data:

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.--

Search for “Shared-Memory Parallelism Can Be Simple, Fast, and Scalable” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Shared-Memory Parallelism Can Be Simple, Fast, and Scalable” in Libraries Near You:

Read or borrow “Shared-Memory Parallelism Can Be Simple, Fast, and Scalable” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Shared-Memory Parallelism Can Be Simple, Fast, and Scalable” at a library near you.