Parallel Algorithms

Name: Parallel Algorithms
Brand: Taylor & Francis Ltd
SKU: 9780367659394
Price: 9750 KES
Availability: OutOfStock
ISBN: 9780367659394

by Arnaud Legrand , Henri Casanova , Yves Robert

Book Details

Format Paperback / softback

Book Series Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

ISBN-10 0367659395

ISBN-13 9780367659394

Publisher Taylor & Francis Ltd

Imprint Chapman & Hall/CRC

Country of Manufacture GB

Country of Publication GB

Publication Date Sep 30th, 2020

Print length 360 Pages

Weight 538 grams

Dimensions 15.60 x 23.30 x 1.70 cms

Product Classification: Digital and Information technology: general topics Information technology: general issues Supercomputers Algorithms & data structures Algorithms and data structures Computer architecture & logic design Computer architecture and logic design

KSh 9,750.00

Currently unavailable 0 in stock

Delivery Location

County

Location

Delivery fee: Select location

Secure

Quality

Fast

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. It extracts fund

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.

Get Parallel Algorithms by Arnaud Legrand, Henri Casanova at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Taylor & Francis Ltd and it has 360 pages.