Algorithms Sequential And Parallel - 2 Ed

The study of algorithms represents a traditional topic used by programmers and engineers in parallel computing.

This text 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.