- Gebundene Ausgabe: 382 Seiten
- Verlag: Thomson Learning; Auflage: 2 (3. August 2005)
- Sprache: Englisch
- ISBN-10: 1584504129
- ISBN-13: 978-1584504122
- Größe und/oder Gewicht: 19 x 3,2 x 23,5 cm
- Durchschnittliche Kundenbewertung: Schreiben Sie die erste Bewertung
- Amazon Bestseller-Rang: Nr. 1.704.751 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
- Komplettes Inhaltsverzeichnis ansehen
Algorithms Sequential And Parallel: A Unified Approach (Electrical and Computer Engineering Series) (Englisch) Gebundenes Buch – 3. August 2005
Dieses Buch gibt es in einer neuen Auflage:
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
The study of algorithms represents a traditional topic used by programmers and engineers in parallel computing. Concepts are considered from a variety of domains, including sorting and searching, matrix computations, computational geometry, and image processing. By considering techniques for sequential and parallel models of computation in a unified fashion, Algorithms Sequential and Parallel: A Unified Approach 2E takes an approach to this critical area of computer science and engineering that is not found in competing texts. It includes a traditional introduction to asymptotic notation, introduces a variety of models of computation, and covers a variety of algorithms and algorithmic techniques in a unified fashion. Traditional solution strategies, including divide-and-conquer, are presented for a variety of models of computation. Fundamental metrics are introduced as fundamental movement operations, along with implementations on a variety of models. The book can be used as an introductory or advanced course on algorithms (e.g., CS7 and higher), focusing on the design, analysis, and implementation of algorithms.This gives undergraduate and beginning graduate students a background in algorithms for sequential and parallel computers within one course.
Über den Autor und weitere Mitwirkende
Laurence Boxer (Buffalo, NY) serves as the chair and faculty member at Niagara University in the Department of Computer and Information Sciences and a member of the editorial board of the Journal of Computing and Information. Russ Miller (Buffalo, NY) is the Director of the Center for Computational Research and a Professor of Computer Science and Engineering at the State University of New York at Buffalo (SUNY-Buffalo). He co-authored Parallel Algorithms for Regular Architectures: Meshes and Pyramids (The MIT Press, 1996) with Q.F.Stout.
|5 Sterne (0%)|
|4 Sterne (0%)|
|3 Sterne (0%)|
|2 Sterne (0%)|
|1 Stern (0%)|
Die hilfreichsten Kundenrezensionen auf Amazon.com
The book is an introduction for a person with a good background in a sequential algorithms design. The proof of the Master Theorem is somehow overcomplicated - it would have been better if there had been a sketch of the proof before the authors delve into the mathematically rigorous part. Before reading the proof in this book I recommend to read a proof of a simplified version of the Master Theorem as given in "Algorithms" by Dasgupta, Papadimitriou and Vazirani - it takes less than a page compared with 11 pages for the complete case in this book.
I first came across the first edition's translation on Russian nearly 2 years ago ( the author's site says it was translated in 2007, but actually it was in the first quarter of 2006 ), then I bought the original 2nd edition - the book worth it.
P.S. I've found nothing about Python language, as one of the review says, the authors use easily understandable pseudo-language. The book is not a cook book with code - this is virtually impossible for such a type of book as an algorithm realization heavily depends on a parallel machine architecture.
The dominant textbook in the field of computer algorithms is Introduction to Algorithms, by Cormen et al. This is a very fine book. However, we have written Algorithms Sequential and Parallel in a very different style, which we feel will give significant advantages to many who use our book. Points of difference between these texts include the following:
1. Algorithms Sequential and Parallel has a unified approach to the presentation of sequential and parallel algorithms. Students of 21st Century computing will need to learn parallel algorithms, which are often closely related to their sequential analogs. Ours is the first algorithms text to integrate presentation of sequential and parallel algorithms so that readers can understand their relationships. This integrated treatment also frees the instructor from the common practice of spending most of an algorithms course on the study of sequential algorithms, with the last 2 or 3 weeks devoted to parallel algorithms - a practice that may mislead students into thinking that parallel computing is still the immature specialization of researchers, rather than a core technology for the 21st Century.
2. Algorithms Sequential and Parallel does not compete with Cormen et al. in the scope of topics covered. The Cormen et al. text, whose 2nd edition is well over 1100 pages, seems designed for at least a year sequence in the study of algorithms. By contrast, Algorithms Sequential and Parallel, 2nd edition, is under 400 pages. This makes it suitable for a one-semester study of algorithms, appropriate for many undergraduate and first- or second-year graduate programs; also, it makes Algorithms Sequential and Parallel significantly less costly.
Algorithms Sequential and Parallel discusses mathematical tools used in the analysis of algorithms, a variety of sequential and parallel models of computation (including the RAM, PRAM, linear array, mesh, hypercube, pyramid, mesh-of-trees, and coarse-grained models), fundamental algorithms (including broadcast, semigroup computations, parallel prefix, sorting, searching) and their sequential and parallel implementations, paradigms such as recursive divide-and-conquer, and algorithms for a variety of applications areas (matrix operations and a variety of other numerical problems, computational geometry, image processing, graph problems, etc). Each chapter concludes with exercises at varying levels of difficulty.
Note that a disinterested reviewer gave the first edition of Algorithms Sequential and Parallel a rating of 5 stars (out of 5) in SIGACT News 34 #2, June, 2003, pp. 3-5.