 |
|
|
Item Details
| Title:
|
PARALLEL ALGORITHMS
|
| By: |
Henri Casanova, Arnaud Legrand, Yves Robert |
| Format: |
Electronic book text |
| List price:
|
£41.99 |
|
We believe that this item is permanently unavailable, and so we cannot source
it.
|
|
|
|
|
|
| ISBN 10: |
1439891079 |
| ISBN 13: |
9781439891070 |
| Publisher: |
TAYLOR & FRANCIS LTD |
| Pub. date: |
10 October, 2011 |
| Series: |
Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series |
| Pages: |
360 |
| Description: |
Focusing on algorithms for distributed-memory parallel architectures, this book covers theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. |
| Synopsis: |
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades. 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. |
| Illustrations: |
500 equations; 9 Tables, black and white; 119 Illustrations, black and white |
| Publication: |
UK |
| Imprint: |
Chapman & Hall/CRC |
| Returns: |
Non-returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|