Professors Berman and Paul give students a comprehensive tool kit of sequential and parallel algorithms, plus a set of mathematical techniques for assessing the performance and correctness of algorithms. Their balanced, integrated presentation of sequential and parallel algorithms helps students gain a more intuitive ability to select appropriate algorithms from a variety of alternatives. The authors determine worst, best, and average running times for the algorithms covered. For both Parallel Random Access Machines and interconnection network models, they present algorithms in parallel pseudocode.
"synopsis" may belong to another edition of this title.
Synopsis:
Parallel algorithms are becoming increasingly important due to faster computer architectures. Covering sequential and parallel algorithms, this work gives undergraduate and first-year graduate students an introduction to parallel algorithms without sacrificing coverage of sequential algorithms.
"About this title" may belong to another edition of this title.
- PublisherPWS
- Publication date1996
- ISBN 10 0534946747
- ISBN 13 9780534946746
- BindingHardcover
- Number of pages880