Algorithms : sequential, parallel, and distributed / Kenneth A. Berman and Jerome L. Paul

By: Berman, Kenneth A [author]
Contributor(s): [Paul, Jerome L. ]
Language: English Publisher: Boston : Thomson, c2005Description: xxix, 962 pages : illustrations ; 25 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 0534420575; 9780534420574Subject(s): Parallel processing (Electronic computers) | Computer algorithms | Sequential processing (Computer science)DDC classification: 005.1
Contents:
Introduction to Algorithms -- Major Design Strategies -- Graph and Network Algorithms -- Parallel and Distributed Algorithms -- Special Topics -- Appendices : Mathematical Notation and Background , Linear Data Structures, Interpolating Asympotic Behavior, Random Walks in Digraphs, Elementary Probability Theory, Examples of Message-Passing Interface Code, Pseudocode Conventions.
Summary: This book offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Pauls text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students ability to think independently.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Home library Call number Status Date due Barcode Item holds
BOOK BOOK COLLEGE LIBRARY
COLLEGE LIBRARY
SUBJECT REFERENCE 		005.1 B456 2005 (Browse shelf) Available CITU-CL-35611
Total holds: 0

Includes bibliographical references and index.

Introduction to Algorithms -- Major Design Strategies -- Graph and Network Algorithms -- Parallel and Distributed Algorithms -- Special Topics -- Appendices : Mathematical Notation and Background , Linear Data Structures, Interpolating Asympotic Behavior, Random Walks in Digraphs, Elementary Probability Theory, Examples of Message-Passing Interface Code, Pseudocode Conventions.

This book offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Pauls text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students ability to think independently.

There are no comments for this item.

to post a comment.