Design and analysis of parallel algorithms / Selim G. Akl.

By:

Akl, Selim G

Material type: Text

TextPublication details: London : Prentice-Hall, c1989.Description: xiii, 401 p. : ill. ; 25 cmISBN:

0132000563

Subject(s):

DDC classification:

004.35 23 Ak315

Contents:

1. Introduction-- 2. Selection-- 3. Merging-- 4. Sorting-- 5. Searching-- 6. Generating permutations and combinations-- 7. Matrix operations-- 8. Numerical problems-- 9. Computing fourier transforms-- 10. Graph theory-- 11. Computational geometry-- 12. Traversing combinatorial spaces-- 13. Decision and optimization-- 14. The bit complexity of parallel computations-- Author index-- Subject index.

Summary: A comprehensive exploration of how to design algorithms that exploit the parallelism inherent in the problem to be solved, and how to analyze these algorithms in order to evaluate their speed and cost.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Books	ISI Library, Kolkata	004.35 Ak315 (Browse shelf(Opens below))	Available		C26405

Total holds: 0

Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)

Previous		No cover image available	No cover image available		No cover image available	No cover image available	No cover image available	Next
Previous	004.338 F853 Real time Computer systems	004.338 Ut93 Real time computer technique and applications in the psychological sciences	004.35 A446 Highly parallel computing	004.35 Ak315 Design and analysis of parallel algorithms /	004.35 B276 Survey of verification techniques for parallel programs	004.35 B395 Parallelism,learning,evolution : proceedings	004.35 B456 principles of concurrent programming	Next

Includes bibliographies and indexes.

1. Introduction--
2. Selection--
3. Merging--
4. Sorting--
5. Searching--
6. Generating permutations and combinations--
7. Matrix operations--
8. Numerical problems--
9. Computing fourier transforms--
10. Graph theory--
11. Computational geometry--
12. Traversing combinatorial spaces--
13. Decision and optimization--
14. The bit complexity of parallel computations--
Author index--
Subject index.

A comprehensive exploration of how to design algorithms that exploit the parallelism inherent in the problem to be solved, and how to analyze these algorithms in order to evaluate their speed and cost.

There are no comments on this title.

to post a comment.

Place hold
Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com)