parallel Algorithms Made Easy
The Complexity Of Today's Applications Coupled With The Widespread Use Of Parallel Computing Has Made The Design And Analysis Of Parallel Algorithms Topics Of Growing Interest. This Volume Fills A Need In The Field For An Introductory Treatment Of Parallel Algorithms-appropriate Even At The Undergraduate Level, Where No Other Textbooks On The Subject Exist. It Features A Systematic Approach To The Latest Design Techniques, Providing Analysis And Implementation Details For Each Parallel Algorithm Described In The Book. Introduction To Parallel Algorithms Covers Foundations Of Parallel Computing; Parallel Algorithms For Trees And Graphs; Parallel Algorithms For Sorting, Searching, And Merging; And Numerical Algorithms. This Remarkable Book:
* Presents Basic Concepts In Clear And Simple Terms
* Incorporates Numerous Examples To Enhance Students' Understanding
* Shows How To Develop Parallel Algorithms For All Classical Problems In Computer Science, Mathematics, And Engineering
* Employs Extensive Illustrations Of New Design Techniques
* Discusses Parallel Algorithms In The Context Of Pram Model
* Includes End-of-chapter Exercises And Detailed References On Parallel Computing.
This Book Enables Universities To Offer Parallel Algorithm Courses At The Senior Undergraduate Level In Computer Science And Engineering. It Is Also An Invaluable Text/reference For Graduate Students, Scientists, And Engineers In Computer Science, Mathematics, And Engineering.

lgli/并行算法导论.pdf

lgrsnf/并行算法导论.pdf

Introduction to Parallel Algorithms (Wiley Series on Parallel and Distributed Computing)

Parallel algorighms

(印)C. Xavier, (美)S.S. Iyengar著 ; 张云泉, 陈英译; 泽维尔; 伊耶加尔; 张云泉; 陈英

Xavier, C., Iyengar, S. S.

C. Xavier; S. S. Iyengar

Jossey-Bass, Incorporated Publishers

John Wiley & Sons, Incorporated

WILEY COMPUTING Publisher

China Machine Press

Wiley-Interscience

机械工业出版社;中信出版社

Wiley series on parallel and distributed computing, New York, New York State, 1998

Wiley series on parallel and distributed computing, New York, cop. 1998

Ji suan ji ke xue cong shu, Bei jing, 2004

United States, United States of America

China, People's Republic, China

1, PS, 1998

{"isbns":["0471251828","7111133900","9780471251828","9787111133902"],"publisher":"iBooker it-ebooks","series":"it-ebooks-extra"}

Includes bibliographical references and index.
"A Wiley-Interscience publication."

Bookmarks: p0-1 (p1): 0.1计算机简介
p0-2 (p1): 目 录出版者的话专家指导委员会译者序前言致谢作者简介第一部分并行计算基础第0章引言
p0-3 (p5): 0.2并行计算机
p0-4 (p6): 0.3并行处理的概念
p0-5 (p8): 0.4高性能计算机
p0-6 (p9): 0.5本书的结构和内容
p0-7 (p10): 参考文献
p0-8 (p11): 第1章并行计算要素
p0-9 (p11): 1.1并行的层次
p0-10 (p12): 1.2.1 Flynn分类
p0-11 (p12): 1.2并行计算机分类
p0-12 (p14): 1.2.2 Erlangen分类（Handler分类）
p0-13 (p15): 1.2.3 Giloi分类
p0-14 (p15): 1.2.4 Hwang-Brigg分类
p0-15 (p15): 1.2.5 Duncan分类
p0-16 (p18): 1.3并行计算模型
p0-17 (p18): 1.3.1二叉树模型
p0-18 (p20): 1.3.2网络模型
p0-19 (p21): 1.3.3超立方体（k-立方体）
p0-20 (p26): 1.3.5金字塔网络
p0-21 (p26): 1.3.4网格网络
p0-22 (p27): 1.3.6星形图
p0-23 (p28): 1.4 PRAM模型
p0-24 (p32): 1.5一些简单算法
p0-25 (p34): 1.6并行算法的性能
p0-26 (p37): 1.7小结
p0-27 (p37): 参考文献
p0-28 (p38): 习题
p0-29 (p40): 第2章并行计算数据结构
p0-30 (p40): 2.1数组和列表
p0-31 (p41): 2.2链接列表
p0-32 (p44): 2.3图与树
p0-33 (p44): 2.3.1预备知识
p0-34 (p48): 2.3.2欧拉图与哈密顿图
p0-35 (p49): 2.3.3树
p0-36 (p57): 2.3.4图的遍历
p0-37 (p58): 2.3.5连通性
p0-38 (p62): 2.3.6可平面图
p0-39 (p64): 2.3.7染色与独立集
p0-40 (p65): 2.3.9交图
p0-41 (p65): 2.3.8团覆盖
p0-42 (p66): 2.3.10弦图
p0-43 (p70): 2.3.11更多的交图
p0-44 (p70): 2.3.12图的匹配问题
p0-45 (p71): 2.3.13图的中心
p0-46 (p72): 2.3.14控制理论
p0-47 (p73): 2.3.15图论中的一些问题
p0-48 (p74): 参考文献
p0-49 (p76): 3.1二叉树设计环境
p0-50 (p76): 第3章并行算法设计环境
p0-51 (p79): 3.2二倍增长
p0-52 (p79): 3.3指针跳转
p0-53 (p82): 3.4分而治之
p0-54 (p83): 3.5划分
p0-55 (p86): 3.6 小结
p0-56 (p86): 参考文献
p0-57 (p86): 习题
p0-58 (p88): 4.1向量内积
p0-59 (p88): 4.2矩阵乘法
p0-60 (p88): 第4章简单并行算法
p0-61 (p90): 4.3部分和
p0-62 (p94): 4.4二项式系数
p0-63 (p98): 4.5范围内最小值问题
p0-64 (p101): 参考文献
p0-65 (p101): 习题
p0-66 (p103): 第二部分图模型算法第5章树算法
p0-67 (p103): 5.1欧拉圈
p0-68 (p104): 5.2给树加根
p0-69 (p105): 5.3后序编号
p0-70 (p107): 5.4后代个数
p0-71 (p107): 5.5顶点层数
p0-72 (p108): 5.6最低公共祖先
p0-73 (p110): 5.7树收缩
p0-74 (p114): 5.8算术表达式的计算
p0-75 (p117): 5.9森林求根问题
p0-76 (p119): 5.10到根的路
p0-77 (p123): 5.11树变为二叉树
p0-78 (p125): 5.12顶点直径
p0-79 (p128): 5.13最远邻居
p0-80 (p130): 参考文献
p0-81 (p131): 习题
p0-82 (p132): 第6章图算法
p0-83 (p132): 6.1简单图算法
p0-84 (p135): 6.2并行连通度算法
p0-85 (p135): 6.2.1广度优先搜索（BFS）
p0-86 (p139): 6.2.2利用BFS搜索连通支
p0-87 (p141): 6.2.3传递闭包矩阵
p0-88 (p141): 6.2.4顶点收缩
p0-89 (p145): 6.3 2-连通支
p0-90 (p146): 6.4支撑树
p0-91 (p148): 6.5最短路问题
p0-92 (p151): 参考文献
p0-93 (p152): 习题
p0-94 (p154): 第7章弦图的NC算法
p0-95 (p154): 7.1弦图判别
p0-96 (p161): 7.2弦图的极大团
p0-97 (p163): 7.3 CV图的特征
p0-98 (p164): 7.4路图判别
p0-99 (p164): 7.4.1一些概念和事实
p0-100 (p168): 7.4.2算法概述
p0-101 (p169): 7.4.3两个UV图的并
p0-102 (p175): 7.4.4 正确性和复杂度
p0-103 (p177): 参考文献
p0-104 (p179): 第三部分数组处理算法第8章搜索与合并
p0-105 (p179): 8.1串行搜索
p0-106 (p180): 8.2 CREW PRAM模型下的并行搜索
p0-107 (p181): 8.3更多数据的并行搜索
p0-108 (p182): 8.4无序数组搜索
p0-109 (p182): 8.5秩合并
p0-110 (p184): 8.6双调合并
p0-111 (p187): 参考文献
p0-112 (p188): 第9章排序算法
p0-113 (p188): 9.1串行排序算法
p0-114 (p188): 9.1.1冒泡排序
p0-115 (p189): 9.1.2插入排序
p0-116 (p190): 9.1.3 Shell递减步长排序
p0-117 (p191): 9.1.4堆排序
p0-118 (p193): 9.2合并排序
p0-119 (p194): 9.3排序网络
p0-120 (p195): 参考文献
p0-121 (p196): 习题
p0-122 (p197): 第四部分数值算法第10章代数方程和矩阵
p0-123 (p197): 10.1代数方程
p0-124 (p197): 10.1.1几何解释
p0-125 (p198): 10.1.2对分法
p0-126 (p199): 10.2矩阵的行列式
p0-127 (p202): 10.3线性方程组
p0-128 (p205): 10.3.1高斯消元法
p0-129 (p206): 10.3.2 Givens旋转
p0-130 (p208): 10.4傅里叶变换
p0-131 (p215): 10.5多项式乘法
p0-132 (p217): 10.6矩阵求逆
p0-133 (p219): 10.7 Toeplitz矩阵
p0-134 (p222): 10.8三对角方程组
p0-135 (p222): 10.8.1 高斯消元法
p0-136 (p223): 10.8.2奇偶约化法
p0-137 (p226): 参考文献
p0-138 (p227): 习题
p0-139 (p228): 11.1微分
p0-140 (p228): 第11章微分与积分
p0-141 (p229): 11.2偏微分
p0-142 (p233): 11.3定积分
p0-143 (p235): 11.4插值
p0-144 (p235): 11.4.1线性插值
p0-145 (p236): 11.4.2二次插值
p0-146 (p236): 11.4.3拉格朗日插值
p0-147 (p237): 参考文献
p0-148 (p238): 习题
p0-149 (p239): 12.2偏微分方程
p0-150 (p239): 第12章微分方程
p0-151 (p239): 12.1欧拉公式
p0-152 (p240): 12.3抛物方程
p0-153 (p242): 12.3.1施密特法（求解抛物方程）
p0-154 (p246): 12.3.2 Laasonen法（求解抛物方程）
p0-155 (p248): 12.3.3 Crank Nickolson法
p0-156 (p249): 12.3.4三层差分法
p0-157 (p251): 参考文献
p0-158 (p252): 部分习题解答
p0-159 (p258): 索引

This volume fills a need in the field for an introductory treatment of parallel algorithms - appropriate even at the undergraduate level, where no other textbooks on the subject exist. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each parallel algorithm described in the book. Introduction to Parallel Algorithms covers foundations of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. This book enables universities to offer parallel algorithm courses at the senior undergraduate level in computer science and engineering. It is also an invaluable text/reference for graduate students, scientists, and engineers in computer science, mathematics, and engineering

The complexity of today's information processing requirements, coupled with the availability of powerful computers, have boosted the interest in the study, design, and analysis of parallel algorithms. 'Introduction to Parallel Algorithms' responds to the need in the field for an easy-to-understand text in this growth area of computer science

This book responds to the need in the field for an easy-to-understand, introductory treatment of this high-growth area of computer science. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each algorithm. A large number of examples reinforce key concepts.

本书阐述了并行计算基础知识, 树和图的并行算法, 排序, 搜索和合并的并行算法及数值算法等, 并提供了大量习题

2023-10-03