Before you leave...
Take 20% off your first order
20% off
Enter the code below at checkout to get 20% off your first order
Discover summer reading lists for all ages & interests!
Find Your Next Read

In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling.
With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.
Author: Henri Casanova, Arnaud Legrand, Yves Robert
ISBN-10: 1584889454
ISBN-13: 9781584889458
Publisher: CRC Press
Language: English
Published: 07/01/2008
Pages: 352
Format: Hardcover
Weight: 1.45lbs
Size: 9.30h x 6.40w x 0.90d
Henri Casanova, Arnaud Legran, Yves Robert
Thanks for subscribing!
This email has been registered!
Take 20% off your first order
Enter the code below at checkout to get 20% off your first order