Algorithms Sequential And Parallel

The study of algorithms represents a traditional topic used by programmers and engineers in parallel computing. Concepts are considered from a variety of domain... » 

The study of algorithms represents a traditional topic used by programmers and engineers in parallel computing. Concepts are considered from a variety of domains, including sorting and searching, matrix computations, computational geometry, and image processing. By considering techniques for sequential and parallel models of computation in a unified fashion, Algorithms Sequential and Parallel: A Unified Approach 2E takes an approach to this critical area of computer science and engineering that is not found in competing texts.

It includes a traditional introduction to asymptotic notation, introduces a variety of models of computation, and covers a variety of algorithms and algorithmic techniques in a unified fashion. Traditional solution strategies, including divide-and-conquer, are presented for a variety of models of computation. Fundamental metrics are introduced as fundamental movement operations, along with implementations on a variety of models.

The book can be used as an introductory or advanced course on algorithms (e.g., CS7 and higher), focusing on the design, analysis, and implementation of algorithms. This gives undergraduate and beginning graduate students a background in algorithms for sequential and parallel computers within one course.

Presents practical applications of algorithms (e.g., Parallel Processing, Computational Geometry, and Image Processing) Includes exercises at the end of each chapter varying in difficulty, from the level of confidence-building to the very challenging «