Introduction
In this Section
It is well known that the best parallel approach to solving a problem is often different from the best sequential implementation. Thus, many commonly used algorithms and data structures need to be redesigned for scalable parallel computing. This section includes chapters that illustrate algorithm implementation techniques and approaches to data structure layout in order to achieve efficient GPU execution. There are three general requirements: high level of parallelism, coherent memory access by threads within warps, and coherent control flow within warps. Practical techniques for satisfying these requirements are illustrated with a diverse set of fundamental data structures and algorithms, including tree, hash tables, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access