Algorithms Sequential and Parallel :A Unified Approach ( CTE )

Publication subTitle :A Unified Approach

Publication series :CTE

Author: Russ Miller;Laurence Boxer  

Publisher: Cengage‎

Publication year: 2013

E-ISBN: 9781285678313

P-ISBN(Paperback): 9781133366805

Subject: TP301.6 algorithm theory

Keyword: 计算技术、计算机技术

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

Give your students a state-of-the-art approach to algorithms available only in Miller/Boxer's ALGORITHMS SEQUENTIAL AND PARALLEL: A UNIFIED APPROACH, 3E. This unique and functional text provides an introduction to algorithms and paradigms for modern computing systems, integrating the study of parallel and sequential algorithms within a focused presentation targeted at a one-semester course. This book prepares students to design, analyze, and implement algorithms for modern computing systems. This edition includes definitions and algorithms for a variety of state-of-the-art computing systems, including clouds, GPGPUs, grids, clusters, and networks of workstations. A wide range of practical exercises and engaging examples drawn from fundamental application domains enable students to develop the analytical and problem solving skills they need to design and implement efficient algorithms for current and future computing systems. ALGORITHMS SEQUENTIAL AND PARALLEL: A UNIFIED APPROACH, 3E also offers instructor support material in order to provide students with a solid background in both sequential and parallel modes of computation.教学资源:PPT。 教学资源目前仅能提供给老师,获取方式如下: 1. 邮箱获取:将教辅需求发邮件至asia.infochina@cengage.com 2. 电话获取:010-83435111 3. 微信获取:关注我们的公众号,会由客服人员答疑解惑 公众号名称:圣智教育服务中心 微信号:Cengage_Learning 4. QQ获取:加入我们的QQ群 群名称:圣智教育服务中心 群号:658668132

Chapter

Reference Guide

1 Asymptotic Analysis

2 Induction and Recursion

3 The Master Method

4 Models of Computation

5 Combinational Circuits

6 Matrix Operations

7 Parallel Prefix

8 Pointer Jumping

9 Divide-and-Conquer

10 Computational Geometry

11 Image Processing

12 Graph Algorithms

13 Numerical Problems

Appendix 1 Proof of the Principle of Mathematical Induction

Appendix 2 Proof of the Master Theorem

Appendix 3 Efficient Gather and Scatter Operations

Appendix 4 Expected-Case Running Time of Quicksort

Bibliography

Index

The users who browse this book also browse