Morgan Kaufmann

Programming Massively Parallel Processors: A Hands-on Approach

Free shipping with 3 or more products in your cart
Sold Out
Free shipping with 3 or more products in your cart
Secure checkout
Your payment is fully protected
Duties & VAT included
No surprise charges at the door
Tracked delivery
Track your order end to end
Returns support
30-day return window

Description

Programming Massively Parallel Processors discusses the basic concepts of parallel programming and GPU architecture. Various techniques for constructing parallel programs are explored in detail. Case studies demonstrate the development process, which begins with computational thinking and ends with effective and efficient parallel programs.

This book describes computational thinking techniques that will enable students to think about problems in ways that are amenable to high-performance parallel computing. It utilizes CUDA (Compute Unified Device Architecture), NVIDIA's software development tool created specifically for massively parallel environments. Studies learn how to achieve both high-performance and high-reliability using the CUDA programming model as well as OpenCL.

This book is recommended for advanced students, software engineers, programmers, and hardware engineers.

  • Teaches computational thinking and problem-solving techniques that facilitate high-performance parallel computing.
  • Utilizes CUDA (Compute Unified Device Architecture), NVIDIA's software development tool created specifically for massively parallel environments.
  • Shows you how to achieve both high-performance and high-reliability using the CUDA programming model as well as OpenCL.
Technical Specifications
Manufacturer
Morgan Kaufmann
Height
23.5 cm
Length
19.1 cm
Width
1.9 cm
Weight
0.59 kg
Shipping & Delivery

Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.

Returns & Exchanges

We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.