Parallel Algorithms
Focusing on algorithms for distributed-memory parallel architectures, this book presents a rigorous yet accessible treatment of theoretical models of parallel computation and parallel algorithm design.
Tag(s): Parallel Computing
Publication date: 28 Jul 2008
ISBN-10: n/a
ISBN-13: 9781584889458
Paperback: 360 pages
Views: 11,264
Parallel Algorithms
Casanova, Legrand, and Robert wrote:The aim of this book is to provide a rigorous yet accessible treatment of parallel algorithms, including theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and fundamental notions of scheduling. The focus is on algorithms for distributed-memory parallel architectures in which computing elements communicate by exchanging messages. While such platforms have become mainstream, the design of efficient and sound parallel algorithms is still a challenging proposition. Fortunately, in spite of the "leaps and bounds" evolution of parallel computing technology, there exists a core of fundamental algorithmic principles. These principles are largely independent from the details of the underlying platform architecture and provide the basis for developing applications on current and future parallel platforms. This book identifies and synthesizes fundamental ideas and generally applicable algorithmic principles out of the mass of parallel algorithm expertise and practical implementations developed over the last decades.
Intended Audience and Use
The target audience for this book is graduate students and post-graduate researchers in computer science and related fields.
About The Author(s)
Professor in the Information and Computer Science Department at the University of Hawaiʻi at Mānoa.
Professor in the Information and Computer Science Department at the University of Hawaiʻi at Mānoa.
Dr. Legrand is a tenured CNRS research scientist at the LIG (formerly ID Laboratory). He works in the INRIA MESCAL project. His research targets the management (mostly from an algorithmic point of view, i.e., scheduling, load balancing, fairness, game theory….) and performance evaluation (in particular through simulation, visualization, statistical analysis, …) of large scale distributed computing infrastructures such as clusters, grids, desktop grids, volunteer computing platforms, clouds,… when used for scientific computing.
Dr. Legrand is a tenured CNRS research scientist at the LIG (formerly ID Laboratory). He works in the INRIA MESCAL project. His research targets the management (mostly from an algorithmic point of view, i.e., scheduling, load balancing, fairness, game theory….) and performance evaluation (in particular through simulation, visualization, statistical analysis, …) of large scale distributed computing infrastructures such as clusters, grids, desktop grids, volunteer computing platforms, clouds,… when used for scientific computing.
Professor in the Computer Science Department at Ecole Normale Supérieure de Lyon. He is mainly interested in algorithm design and scheduling techniques for large-scale distributed platforms.
Professor in the Computer Science Department at Ecole Normale Supérieure de Lyon. He is mainly interested in algorithm design and scheduling techniques for large-scale distributed platforms.