node133.html

Design and building parallel program

<DT>components<DD><A NAME=tex2html566 HREF="node43.html#5721" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#5721">4.4.1 Components</A>
<DT>parallel 2-D FFTs<DD><A NAME=tex2html567 HREF="node43.html#5727" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#5727">4.4.1 Components</A>
<DT>parallel composition<DD><A NAME=tex2html574 HREF="node43.html#5772" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#5772">4.4.2 Composing Components</A>
<DT>sequential composition<DD><A NAME=tex2html572 HREF="node43.html#5754" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#5754">4.4.2 Composing Components</A>
</DL><DT>COOL<DD><A NAME=tex2html727 HREF="node66.html#7895" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node66.html#7895"> Chapter Notes</A>
<DT>Cosmic Cube<DD><A NAME=tex2html135 HREF="node13.html#715" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#715"> Chapter Notes</A>, <A NAME=tex2html502 HREF="node38.html#4349" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4349"> Chapter Notes</A>, <A NAME=tex2html1157 HREF="node105.html#13773" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node105.html#13773"> Chapter Notes</A>
<DT>Counters<DD><A NAME=tex2html1175 HREF="node107.html#14290" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node107.html#14290">9.1 Performance Analysis</A>, <A NAME=tex2html1184 HREF="node108.html#14316" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node108.html#14316">9.2.2 Counters</A>
<DT>Cray T3D<DD><A NAME=tex2html47 HREF="node8.html#394" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node8.html#394">1.2.2 Other Machine Models</A>, <A NAME=tex2html508 HREF="node38.html#4359" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4359"> Chapter Notes</A>
<DT>Crossbar switching network<DD><A NAME=tex2html419 HREF="node33.html#3769" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3769"> Crossbar Switching Network.</A>
<DT>Cycle time trends<DD><A NAME=tex2html21 HREF="node7.html#321" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#321">1.1.2 Trends in Computer </A>
<DT>Cyclic mapping<DD><A NAME=tex2html251 HREF="node19.html#1618" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node19.html#1618"> Cyclic Mappings.</A>, <A NAME=tex2html280 HREF="node20.html#1825" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node20.html#1825"> Mapping.</A>, <A NAME=tex2html313 HREF="node22.html#2158" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node22.html#2158"> Mapping.</A>, <A NAME=tex2html320 HREF="node25.html#2240" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node25.html#2240"> Chapter Notes</A>
<DL><DT>in HPF<DD><A NAME=tex2html937 HREF="node85.html#10954" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#10954">7.3.3 Distribution</A>, <A NAME=tex2html1001 HREF="node89.html#11448" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11448">7.7.3 Communication Costs</A>, <A NAME=tex2html1012 HREF="node90.html#11508" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node90.html#11508">7.8 Case Study: Gaussian </A>
<DT>in HPF<DD><A NAME=tex2html937 HREF="node85.html#10954" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#10954">7.3.3 Distribution</A>, <A NAME=tex2html1001 HREF="node89.html#11448" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11448">7.7.3 Communication Costs</A>, <A NAME=tex2html1012 HREF="node90.html#11508" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node90.html#11508">7.8 Case Study: Gaussian </A>
<DT>in HPF<DD><A NAME=tex2html937 HREF="node85.html#10954" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#10954">7.3.3 Distribution</A>, <A NAME=tex2html1001 HREF="node89.html#11448" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11448">7.7.3 Communication Costs</A>, <A NAME=tex2html1012 HREF="node90.html#11508" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node90.html#11508">7.8 Case Study: Gaussian </A>
</DL><DT>Data collection<DD>(, )
<DL><DT>basic techniques<DD><A NAME=tex2html1173 HREF="node107.html#14285" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node107.html#14285">9.1 Performance Analysis</A>
<DT>counters<DD><A NAME=tex2html1183 HREF="node108.html#14315" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node108.html#14315">9.2.2 Counters</A>
<DT>process<DD><A NAME=tex2html1195 HREF="node108.html#14375" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node108.html#14375">9.2.4 Summary of Data </A>
<DT>traces<DD><A NAME=tex2html1189 HREF="node108.html#14342" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node108.html#14342">9.2.3 Traces</A>
</DL><DT>Data decomposition<DD>seeDomain decomposition
<DT>Data dependency<DD><A NAME=tex2html83 HREF="node9.html#454" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#454">1.3.1 Tasks and Channels</A>
<DT>Data distribution<DD><DL><DT>at module boundaries<DD><A NAME=tex2html533 HREF="node41.html#5510" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5510">4.2.1 Data Distribution</A>
<DT>dynamic<DD><A NAME=tex2html968 HREF="node88.html#11352" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11352">7.6.3 HPF Features Not </A>
<DT>in data-parallel languages<DD><A NAME=tex2html876 HREF="node83.html#10652" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10652">7.1.2 Locality</A>
<DT>in HPF<DD>(, )
<DT>in HPF<DD>(, )
</DL><DT>Data distribution neutrality<DD><DL><DT>benefits<DD><A NAME=tex2html534 HREF="node41.html#5511" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5511">4.2.1 Data Distribution</A>
<DT>example<DD>(, )
<DT>example<DD>(, )
<DT>in ScaLAPACK<DD><A NAME=tex2html543 HREF="node41.html#5553" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5553">4.2.2 Sequential Composition</A>
<DT>in SPMD libraries<DD><A NAME=tex2html604 HREF="node48.html#6111" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node48.html#6111"> Chapter Notes</A>
</DL><DT>Data fitting<DD><A NAME=tex2html396 HREF="node31.html#3525" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node31.html#3525">3.5.3 Fitting Data to </A>
<DT>Data parallelism<DD><A NAME=tex2html105 HREF="node9.html#515" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#515">1.3.2 Other Programming Models</A>, <A NAME=tex2html862 HREF="node82.html#10585" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node82.html#10585">7 High Performance Fortran</A>
<DL><DT>and Fortran 90<DD><A NAME=tex2html891 HREF="node83.html#10679" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10679">7.1.4 Data-Parallel Languages</A>, <A NAME=tex2html910 HREF="node84.html#10821" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#10821">7.2.2 Array Intrinsic Functions</A>
<DT>and Fortran 90<DD><A NAME=tex2html891 HREF="node83.html#10679" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10679">7.1.4 Data-Parallel Languages</A>, <A NAME=tex2html910 HREF="node84.html#10821" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#10821">7.2.2 Array Intrinsic Functions</A>
<DT>and HPF<DD><A NAME=tex2html893 HREF="node83.html#10681" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10681">7.1.4 Data-Parallel Languages</A>
<DT>and modular design<DD><A NAME=tex2html887 HREF="node83.html#10671" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10671">7.1.3 Design</A>
<DT>and task parallelism<DD><A NAME=tex2html1033 HREF="node93.html#11733" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11733"> Chapter Notes</A>
<DT>for irregular problems<DD><A NAME=tex2html1032 HREF="node93.html#11729" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11729"> Chapter Notes</A>
<DT>languages<DD><A NAME=tex2html890 HREF="node83.html#10678" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10678">7.1.4 Data-Parallel Languages</A>, <A NAME=tex2html1207 HREF="node109.html#14414" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14414">9.3.3 Data-Parallel Languages</A>
<DT>languages<DD><A NAME=tex2html890 HREF="node83.html#10678" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10678">7.1.4 Data-Parallel Languages</A>, <A NAME=tex2html1207 HREF="node109.html#14414" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14414">9.3.3 Data-Parallel Languages</A>
</DL><DT>Data reduction<DD><A NAME=tex2html1197 HREF="node109.html#14383" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14383">9.3.1 Profile and Counts</A>, <A NAME=tex2html1199 HREF="node109.html#14394" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14394">9.3.2 Traces</A>
<DT>Data replication<DD><A NAME=tex2html483 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24">3.9.3 Shortest-Path Algorithms Summary</A>
<DT>Data transformation<DD><A NAME=tex2html1171 HREF="node107.html#14294" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node107.html#14294">9.1 Performance Analysis</A>
<DT>Data visualization<DD><A NAME=tex2html1178 HREF="node107.html#14296" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node107.html#14296">9.1 Performance Analysis</A>, <A NAME=tex2html1203 HREF="node109.html#14399" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14399">9.3.2 Traces</A>
<DT>Data-parallel C<DD><A NAME=tex2html725 HREF="node66.html#7891" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node66.html#7891"> Chapter Notes</A>, <A NAME=tex2html1026 HREF="node93.html#11702" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11702"> Chapter Notes</A>
<DT>Data-parallel languages<DD><A NAME=tex2html889 HREF="node83.html#10677" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10677">7.1.4 Data-Parallel Languages</A>, <A NAME=tex2html1208 HREF="node109.html#14415" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14415">9.3.3 Data-Parallel Languages</A>
<DT>Data-parallel model<DD><A NAME=tex2html103 HREF="node9.html#513" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#513">1.3.2 Other Programming Models</A>, <A NAME=tex2html878 HREF="node83.html#10657" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10657">7.1.3 Design</A>, <A NAME=tex2html881 HREF="node83.html#10664" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10664">7.1.3 Design</A>, <A NAME=tex2html885 HREF="node83.html#10668" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10668">7.1.3 Design</A>
<DT>Databases<DD><A NAME=tex2html128 HREF="node13.html#697" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#697"> Chapter Notes</A>, <A NAME=tex2html519 HREF="node38.html#4398" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4398"> Chapter Notes</A>, <A NAME=tex2html584 HREF="node44.html#5837" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node44.html#5837">4.5.1 Application</A>
<DT>Deadlock detection<DD><A NAME=tex2html1332 HREF="node131.html#15616" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15616">12 Further Reading</A>
<DT>Decision support<DD><A NAME=tex2html12 HREF="node7.html#289" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#289">1.1.1 Trends in Applications</A>
<DT>Dense matrix algorithms<DD><A NAME=tex2html1325 HREF="node131.html#15600" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15600">12 Further Reading</A>
<DT>Depth-first search<DD><A NAME=tex2html295 HREF="node21.html#1938" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1938"> Agglomeration.</A>
<DT>Design checklists<DD><DL><DT>agglomeration<DD><A NAME=tex2html230 HREF="node18.html#1536" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1536">2.4.4 Agglomeration Design Checklist</A>
<DT>communication<DD><A NAME=tex2html211 HREF="node17.html#1443" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1443">2.3.5 Communication Design Checklist</A>
<DT>mapping<DD><A NAME=tex2html264 HREF="node19.html#1652" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node19.html#1652">2.5.3 Mapping Design Checklist</A>
<DT>modular