Description
Intended for juniors in computer science, this textbook presents both sequential and parallel approaches to solving bitonic merge, matrix, linked list, merge sort, selection, quick sort, convex hull, smallest enclosing box, all-nearest neighbor, component labeling, and graphing problems. The authors are affiliated with SUNY-Buffalo. Annotation ©2005 Book News, Inc., Portland, OR (booknews.com)
Read More
With multi-core processors replacing traditional processors and the movement to multiprocessor workstations and servers, parallel computing has moved from a specialty area to the core of computer science. In order to provide efficient and cost-effective solutions to problems, algorithms must be designed for multiprocessor systems. Algorithms Sequential and Parallel: A Unified Approach 2/E provides a state-of-the-art approach to an algorithms course. The book considers algorithms, paradigms, and the analysis of solutions to critical problems for sequential and parallel models of computation in a unified fashion. This gives practicing engineers and scientists, undergraduates, and beginning graduate students a background in algorithms for sequential and parallel algorithms within one text. Prerequisites include fundamentals of data structures, discrete mathematics, and calculus.
Read Less