Parallel Program Design Cornell Theory Center Virtual Workshop Module Table of Contents Par.pdfVIP
- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Parallel Program Design Cornell Theory Center Virtual Workshop Module Table of Contents Par
Parallel Program Design Page 1 of 18
Cornell Theory Center
Virtual Workshop Module
Parallel Program Design
Daniel Sverdlik
Video Introduction
View with modem or broadband connection
Read the text transcript
Table of Contents
1. Goals, Decisions
2. Examples of Functional Parallelism
2.1 Ecosystem Modeling
2.2 Audio Signal Processing
3. Examples of Data Parallelism
3.1 Image Processing
3.2 Effect of Pollution on Forested Areas
3.3 Chess
4. Walk Through
4.1 Problem Description
4.2 Decomposition
4.3 Code Structure
/Services/Edu/Topics/ParallelProgDesign/more.asp 9/23/2002
Parallel Program Design Page 2 of 18
4.4 SPMD Solution
4.5 SPMD with Master Worker Embedded
5. Repositories
References Quiz Evaluation Navigation Guide
1. Goals, Decisions
1.1 Goals (ideal)
Speedup is defined as the serial execution time divided by the parallel execution
time, for a given problem size and number of processors. Perfect speedup
(generally not attainable) would equal the number of processors. Scalability looks
at how speedup is preserved as the problem size and number of processors
increases.
Ideal (read: unrealistic) goals for writing a program with maximum speedup and
scalability:
Each process has a unique bit of work to do, and does not have to redo any
other work in order to get its bit done.
Each process stores the data needed to accomplish that work, and does not
require anyone elses data.
A given piece of data exists only on one process, and each bit of
computation only needs to be done once, by one process.
Communication be
您可能关注的文档
- MS Visio文档跨平台网络浏览器的实现方法.doc
- MSC.Patran中体单元与壳单元的连接方法的探索.doc
- MSCADAMS在贴片机动态精度研究中的应用.pdf
- MS电荷密度图 能带结构和态密度分析.doc
- MSTRWebcustomization开发示例.docx
- MSE准则下岭_主成分组合估计与LS估计的比较与选择.pdf
- MTI翻译基础短语英汉对照(三).doc
- MTI翻译基础短语英汉对照(九).doc
- MTI摄影验光在幼儿弱视筛查中的应用.pdf
- MTI翻译基础短语英汉对照(五).doc
- Parallelized Variational EM for Latent Dirichlet Allocation An Experimental Evaluation of S.pdf
- Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics.pdf
- papyrus的log分析.doc
- Parametric Dynamics of Level Spacings in Quantum Chaos.pdf
- Parametric High Definition (PHD) Speech SynthesisbyAnalysisThe Development of a Fundament.pdf
- Parker Pen Company (派克公司介绍)中英文对照.doc
- Pareto分布参数的Bayes估计.pdf
- Part I Basic Economic Ideas.ppt
- Part Two信函例文分析及练习.doc
- Part Two Keys and Notes(答案与解析).doc
文档评论(0)