Using OpenMP-The Next Step

Using OpenMP-The Next Step

EnglishEbook
Pas, Ruud van der
The MIT Press
EAN: 9780262344012
Available online
CZK 3,002
Common price CZK 3,335
Discount 10%
pc

Detailed information

A guide to the most recent, advanced features of the widely used OpenMP parallel programming model, with coverage of major features in OpenMP 4.5.This book offers an up-to-date, practical tutorial on advanced features in the widely used OpenMP parallel programming model. Building on the previous volume, Using OpenMP: Portable Shared Memory Parallel Programming (MIT Press), this book goes beyond the fundamentals to focus on what has been changed and added to OpenMP since the 2.5 specifications. It emphasizes four major and advanced areas: thread affinity (keeping threads close to their data), accelerators (special hardware to speed up certain operations), tasking (to parallelize algorithms with a less regular execution flow), and SIMD (hardware assisted operations on vectors).As in the earlier volume, the focus is on practical usage, with major new features primarily introduced by example. Examples are restricted to C and C++, but are straightforward enough to be understood by Fortran programmers. After a brief recap of OpenMP 2.5, the book reviews enhancements introduced since 2.5. It then discusses in detail tasking, a major functionality enhancement; Non-Uniform Memory Access (NUMA) architectures, supported by OpenMP; SIMD, or Single Instruction Multiple Data; heterogeneous systems, a new parallel programming model to offload computation to accelerators; and the expected further development of OpenMP.
EAN 9780262344012
ISBN 0262344017
Binding Ebook
Publisher The MIT Press
Publication date October 23, 2017
Pages 392
Language English
Country United States
Authors Pas, Ruud van der; Stotzer, Eric; Terboven, Christian
Series Scientific and Engineering Computation
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.