Algorithms: sequential, parallel, and distributed

Type Book

Rate 0.0 /5

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…

Details

Files

Reviews

Download

Title Statements

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

Summary

Edition Statements

Publication Date:©2005.

Publication Statements

Publisher(s):Thomson/Course Technology
Place of Publication:Boston, Mass
Language:eng
Publication Date:©2005.

The Physical Object

Description:1 online resource (xxix, 962 pages) : : illustrations

Edition Identifiers

oclc:ocn989089694
LC Classification:QA76.9.A43
Dewey Decimal:005.1

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.

Subjects

Algorithmes ALGORITHMS Algorithmus Computer algorithms Parallel processing (Electronic compute… Parallélisme (Informatique) Sequential processing (Computer science) Traitement séquentiel (Informatique)