⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 node133.html

📁 Design and building parallel program
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<html><!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN">
<!Converted with LaTeX2HTML 95.1 (Fri Jan 20 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds >
<HEAD>
<TITLE>Index</TITLE>
</HEAD>
<BODY>
<meta name="description" value="Index">
<meta name="keywords" value="book">
<meta name="resource-type" value="document">
<meta name="distribution" value="global">
<P>
 <BR> <HR><a href="msgs0.htm#2" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#2"><img ALIGN=MIDDLE src="asm_color_tiny.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/asm_color_tiny.gif" alt="[DBPP]"></a>    <A NAME=tex2html3586 HREF="node132.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html"><IMG ALIGN=MIDDLE ALT="previous" SRC="previous_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/previous_motif.gif"></A> <IMG ALIGN=MIDDLE ALT="next" SRC="next_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/next_motif.gif"> <A NAME=tex2html3590 HREF="book.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/book.html"><IMG ALIGN=MIDDLE ALT="up" SRC="up_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/up_motif.gif"></A> <A NAME=tex2html3592 HREF="node1.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node1.html"><IMG ALIGN=MIDDLE ALT="contents" SRC="contents_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/contents_motif.gif"></A>  <a href="msgs0.htm#3" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#3"><img ALIGN=MIDDLE src="search_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/search_motif.gif" alt="[Search]"></a>   <BR>
<B>Up:</B> <A NAME=tex2html3591 HREF="book.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/book.html">Designing and Building Parallel Programs</A>
<B> Previous:</B> <A NAME=tex2html3587 HREF="node132.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html">References</A>
<BR><HR><P>
<P><H2><A NAME=SECTION06000000000000000000>Index</A></H2>
<DL><DT>*Lisp<DD><A NAME=tex2html1022 HREF="node93.html#11694" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11694"> Chapter Notes</A>
<DT>Abstract processors in HPF<DD><A NAME=tex2html920 HREF="node85.html#10909" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#10909">7.3.1 Processors</A>
<DT>Actor model<DD><A NAME=tex2html145 HREF="node13.html#748" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#748"> Chapter Notes</A>
<DT>Agglomeration<DD><A NAME=tex2html152 HREF="node15.html#1095" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node15.html#1095">2.1 Methodical Design</A>, (, )
<DL><DT>and granularity<DD><A NAME=tex2html217 HREF="node18.html#1474" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1474">2.4.1 Increasing Granularity</A>, <A NAME=tex2html218 HREF="node18.html#1481" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1481"> Surface-to-Volume Effects.</A>
<DT>and granularity<DD><A NAME=tex2html217 HREF="node18.html#1474" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1474">2.4.1 Increasing Granularity</A>, <A NAME=tex2html218 HREF="node18.html#1481" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1481"> Surface-to-Volume Effects.</A>
<DT>design checklist<DD><A NAME=tex2html231 HREF="node18.html#1537" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1537">2.4.4 Agglomeration Design Checklist</A>
<DT>for atmosphere model<DD><A NAME=tex2html276 HREF="node20.html#1804" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node20.html#1804"> Agglomeration.</A>
<DT>for floorplan optimization<DD><A NAME=tex2html294 HREF="node21.html#1935" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1935"> Agglomeration.</A>
<DT>for Fock matrix problem<DD><A NAME=tex2html307 HREF="node22.html#2094" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node22.html#2094"> Communication and Agglomeration.</A>
<DT>in data-parallel model<DD><A NAME=tex2html882 HREF="node83.html#10665" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10665">7.1.3 Design</A>
</DL><DT>AIMS performance tool<DD><A NAME=tex2html1234 HREF="node110.html#14513" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node110.html#14513">9.4.7 AIMS</A>, <A NAME=tex2html1243 HREF="node113.html#14549" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node113.html#14549"> Chapter Notes</A>
<DT>Amdahl's law<DD><DL><DT>application to HPF<DD><A NAME=tex2html993 HREF="node89.html#11420" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11420">7.7.2 Sequential Bottlenecks</A>
<DT>definition<DD><A NAME=tex2html336 HREF="node28.html#3098" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3098">3.2.1 Amdahl's Law</A>, <A NAME=tex2html493 HREF="node38.html#4315" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4315"> Chapter Notes</A>
<DT>definition<DD><A NAME=tex2html336 HREF="node28.html#3098" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3098">3.2.1 Amdahl's Law</A>, <A NAME=tex2html493 HREF="node38.html#4315" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4315"> Chapter Notes</A>
</DL><DT>Applied Parallel Research<DD><A NAME=tex2html1252 HREF="node113.html#14562" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node113.html#14562"> Chapter Notes</A>
<DT>ARPANET<DD><A NAME=tex2html138 HREF="node13.html#727" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#727"> Chapter Notes</A>
<DT>Asymptotic analysis<DD><DL><DT>limitations of<DD><A NAME=tex2html341 HREF="node28.html#3135" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3135">3.2.3 Asymptotic Analysis</A>, <A NAME=tex2html343 HREF="node28.html#3145" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3145">3.2.3 Asymptotic Analysis</A>
<DT>limitations of<DD><A NAME=tex2html341 HREF="node28.html#3135" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3135">3.2.3 Asymptotic Analysis</A>, <A NAME=tex2html343 HREF="node28.html#3145" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node28.html#3145">3.2.3 Asymptotic Analysis</A>
<DT>reference<DD><A NAME=tex2html495 HREF="node38.html#4318" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4318"> Chapter Notes</A>
</DL><DT>Asynchronous communication<DD><A NAME=tex2html208 HREF="node17.html#1428" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1428">2.3.4 Asynchronous Communication</A>
<DL><DT>in CC++<DD><A NAME=tex2html678 HREF="node57.html#7347" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node57.html#7347">5.6 Asynchronous Communication</A>
<DT>in FM<DD><A NAME=tex2html794 HREF="node72.html#9241" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9241">6.5 Asynchronous Communication</A>
<DT>in MPI<DD><A NAME=tex2html1099 HREF="node98.html#12829" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12829">8.4 Asynchronous Communication</A>
</DL><DT>Asynchronous Transfer Mode<DD><A NAME=tex2html66 HREF="node8.html#417" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node8.html#417">1.2.2 Other Machine Models</A>
<DT>Atmosphere model<DD><DL><DT>basic equations<DD><A NAME=tex2html271 HREF="node20.html#1667" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node20.html#1667">2.6.1 Atmosphere Model Background</A>
<DT>description<DD>(, )
<DT>description<DD>(, )
<DT>parallel algorithms<DD>(, )
<DT>parallel algorithms<DD>(, )
<DT>references<DD><A NAME=tex2html325 HREF="node25.html#2274" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node25.html#2274"> Chapter Notes</A>
</DL><DT>BBN Butterfly<DD><A NAME=tex2html511 HREF="node38.html#4367" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4367"> Chapter Notes</A>
<DT>Bisection bandwidth<DD><A NAME=tex2html486 HREF="node37.html#4289" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node37.html#4289"> Exercises</A>
<DT>Bisection width<DD><A NAME=tex2html489 HREF="node37.html#4288" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node37.html#4288"> Exercises</A>, <A NAME=tex2html514 HREF="node38.html#4376" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4376"> Chapter Notes</A>
<DT>Bitonic mergesort<DD><A NAME=tex2html1312 HREF="node130.html#15274" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node130.html#15274"> Chapter Notes</A>
<DT>Bottlenecks in HPF<DD><A NAME=tex2html992 HREF="node89.html#11418" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11418">7.7.2 Sequential Bottlenecks</A>
<DT>Branch-and-bound search<DD><DL><DT>description<DD><A NAME=tex2html289 HREF="node21.html#1903" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1903">2.7.1 Floorplan Background</A>, <A NAME=tex2html327 HREF="node25.html#2283" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node25.html#2283"> Chapter Notes</A>
<DT>description<DD><A NAME=tex2html289 HREF="node21.html#1903" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1903">2.7.1 Floorplan Background</A>, <A NAME=tex2html327 HREF="node25.html#2283" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node25.html#2283"> Chapter Notes</A>
<DT>in MPI<DD><A NAME=tex2html1046 HREF="node95.html#12203" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node95.html#12203">8.1 The MPI Programming </A>
</DL><DT>Breadth-first search<DD><A NAME=tex2html291 HREF="node21.html#1916" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1916"> Partition.</A>
<DT>Bridge construction problem<DD><DL><DT>definition<DD><A NAME=tex2html74 HREF="node9.html#458" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#458">1.3.1 Tasks and Channels</A>
<DT>determinism<DD><A NAME=tex2html97 HREF="node9.html#498" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#498">1.3.1 Tasks and Channels</A>
<DT>in CC++<DD><A NAME=tex2html634 HREF="node53.html#6858" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node53.html#6858">5.2 CC++

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -