node133.html

Design and building parallel program

<DT>connecting outport/inport pairs<DD><A NAME=tex2html79 HREF="node9.html#447" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node9.html#447">1.3.1 Tasks and Channels</A>
<DT>creation in Fortran M<DD><A NAME=tex2html759 HREF="node70.html#8808" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#8808">6.3.1 Creating Channels</A>
<DT>dynamic in Fortran M<DD><A NAME=tex2html787 HREF="node71.html#9162" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9162">6.4.3 Dynamic Channel Structures</A>
<DT>for argument passing in Fortran M<DD><A NAME=tex2html808 HREF="node74.html#9352" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node74.html#9352">6.7 Argument Passing</A>
<DT>in communication<DD><A NAME=tex2html174 HREF="node17.html#1162" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1162">2.3 Communication</A>
<DT>in CSP<DD><A NAME=tex2html140 HREF="node13.html#732" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#732"> Chapter Notes</A>
</DL><DT>Checkpointing<DD><A NAME=tex2html461 HREF="node34.html#3975" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node34.html#3975">3.8 Input/Output</A>, <A NAME=tex2html518 HREF="node38.html#4392" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4392"> Chapter Notes</A>
<DT>CHIMP<DD><A NAME=tex2html1168 HREF="node105.html#13797" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node105.html#13797"> Chapter Notes</A>
<DT>Classes in C++<DD><A NAME=tex2html623 HREF="node52.html#6707" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#6707">5.1.2 Classes</A>
<DT>Climate modeling<DD><A NAME=tex2html14 HREF="node7.html#294" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#294">1.1.1 Trends in Applications</A>, <A NAME=tex2html169 HREF="node16.html#1144" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node16.html#1144">2.2.2 Functional Decomposition</A>, <A NAME=tex2html267 HREF="node20.html#1664" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node20.html#1664">2.6 Case Study: Atmosphere </A>, <A NAME=tex2html1215 HREF="node110.html#14437" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node110.html#14437">9.4.1 Paragraph</A>
<DL><DT>in CC++<DD><A NAME=tex2html685 HREF="node59.html#7527" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node59.html#7527">5.8.2 Mapping Threads to </A>
<DT>in Fortran M<DD><A NAME=tex2html825 HREF="node75.html#9532" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#9532">6.8.3 Submachines</A>
<DT>in MPI<DD><A NAME=tex2html1152 HREF="node102.html#13414" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node102.html#13414">8.8 Case Study: Earth </A>
</DL><DT>Clock synchronization<DD><A NAME=tex2html1206 HREF="node109.html#14406" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node109.html#14406">9.3.2 Traces</A>, <A NAME=tex2html1246 HREF="node113.html#14555" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node113.html#14555"> Chapter Notes</A>
<DT>CM Fortran<DD><A NAME=tex2html1021 HREF="node93.html#11692" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11692"> Chapter Notes</A>
<DT>Collaborative work environments<DD><A NAME=tex2html10 HREF="node7.html#287" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#287">1.1.1 Trends in Applications</A>
<DT>Collective communication<DD><A NAME=tex2html1074 HREF="node97.html#12580" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node97.html#12580">8.3 Global Operations</A>, <A NAME=tex2html1220 HREF="node110.html#14455" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node110.html#14455">9.4.2 Upshot</A>
<DT>Collocation of arrays<DD><A NAME=tex2html924 HREF="node85.html#10922" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#10922">7.3.2 Alignment</A>
<DT>Combining scatter<DD><A NAME=tex2html979 HREF="node88.html#11365" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11365">7.6.3 HPF Features Not </A>
<DT>Communicating Sequential Processes<DD><A NAME=tex2html139 HREF="node13.html#730" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#730"> Chapter Notes</A>
<DT>Communication<DD>(, )
<DL><DT>and channels<DD><A NAME=tex2html173 HREF="node17.html#1161" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1161">2.3 Communication</A>
<DT>collective<DD><A NAME=tex2html1045 HREF="node95.html#12199" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node95.html#12199">8.1 The MPI Programming </A>, <A NAME=tex2html1073 HREF="node97.html#12581" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node97.html#12581">8.3 Global Operations</A>
<DT>collective<DD><A NAME=tex2html1045 HREF="node95.html#12199" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node95.html#12199">8.1 The MPI Programming </A>, <A NAME=tex2html1073 HREF="node97.html#12581" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node97.html#12581">8.3 Global Operations</A>
<DT>design checklist<DD><A NAME=tex2html212 HREF="node17.html#1445" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1445">2.3.5 Communication Design Checklist</A>
<DT>disadvantages of local<DD><A NAME=tex2html196 HREF="node17.html#1354" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1354">2.3.2 Global Communication</A>
<DT>for atmosphere model<DD><A NAME=tex2html274 HREF="node20.html#1760" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node20.html#1760"> Communication.</A>
<DT>for floorplan optimization<DD><A NAME=tex2html292 HREF="node21.html#1921" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node21.html#1921"> Communication.</A>
<DT>for Fock matrix problem<DD><A NAME=tex2html308 HREF="node22.html#2095" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node22.html#2095"> Communication and Agglomeration.</A>
<DT>in CC++<DD><A NAME=tex2html657 HREF="node56.html#7056" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#7056">5.5 Communication</A>
<DT>in data-parallel model<DD><A NAME=tex2html883 HREF="node83.html#10666" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10666">7.1.3 Design</A>
<DT>in Fortran M<DD><A NAME=tex2html756 HREF="node70.html#8803" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#8803">6.3 Communication</A>
<DT>in MPI<DD><A NAME=tex2html1044 HREF="node95.html#12196" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node95.html#12196">8.1 The MPI Programming </A>
<DT>synchronous<DD><A NAME=tex2html793 HREF="node71.html#9238" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9238">6.4.3 Dynamic Channel Structures</A>, <A NAME=tex2html1145 HREF="node100.html#13361" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node100.html#13361">8.6.2 MPI Features Not </A>
<DT>synchronous<DD><A NAME=tex2html793 HREF="node71.html#9238" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9238">6.4.3 Dynamic Channel Structures</A>, <A NAME=tex2html1145 HREF="node100.html#13361" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node100.html#13361">8.6.2 MPI Features Not </A>
</DL><DT>Communication costs<DD><A NAME=tex2html355 HREF="node29.html#3224" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node29.html#3224"> Communication Time.</A>
<DL><DT>bandwidth competition<DD><A NAME=tex2html410 HREF="node33.html#3729" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3729">3.7 A Refined Communication </A>
<DT>in CC++<DD><A NAME=tex2html705 HREF="node61.html#7641" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node61.html#7641">5.10 Performance Issues</A>
<DT>in HPF<DD><A NAME=tex2html997 HREF="node89.html#11425" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11425">7.7.3 Communication Costs</A>
<DT>in MPI<DD><A NAME=tex2html1146 HREF="node101.html#14216" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node101.html#14216">8.7 Performance Issues</A>, <A NAME=tex2html1147 HREF="node101.html#14216" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node101.html#14216">8.7 Performance Issues</A>
<DT>in MPI<DD><A NAME=tex2html1146 HREF="node101.html#14216" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node101.html#14216">8.7 Performance Issues</A>, <A NAME=tex2html1147 HREF="node101.html#14216" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node101.html#14216">8.7 Performance Issues</A>
<DT>of unaligned array mapping<DD><A NAME=tex2html1004 HREF="node89.html#11477" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11477">7.7.3 Communication Costs</A>
<DT>with cyclic distribution<DD><A NAME=tex2html1003 HREF="node89.html#11450" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11450">7.7.3 Communication Costs</A>
</DL><DT>Communication patterns<DD><A NAME=tex2html177 HREF="node17.html#1166" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1166">2.3 Communication</A>
<DL><DT>asynchronous<DD><A NAME=tex2html183 HREF="node17.html#1180" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1180">2.3 Communication</A>, <A NAME=tex2html207 HREF="node17.html#1426" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1426">2.3.4 Asynchronous Communication</A>, <A NAME=tex2html795 HREF="node72.html#9242" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9242">6.5 Asynchronous Communication</A>, <A NAME=tex2html960 HREF="node88.html#11311" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11311">7.6.2 Storage and Sequence </A>, <A NAME=tex2html1100 HREF="node98.html#12831" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12831">8.4 Asynchronous Communication</A>
<DT>asynchronous<DD><A NAME=tex2html183 HREF="node17.html#1180" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1180">2.3 Communication</A>, <A NAME=tex2html207 HREF="node17.html#1426" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1426">2.3.4 Asynchronous Communication</A>, <A NAME=tex2html795 HREF="node72.html#9242" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9242">6.5 Asynchronous Communication</A>, <A NAME=tex2html960 HREF="node88.html#11311" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11311">7.6.2 Storage and Sequence </A>, <A NAME=tex2html1100 HREF="node98.html#12831" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12831">8.4 Asynchronous Communication</A>
<DT>asynchronous<DD><A NAME=tex2html183 HREF="node17.html#1180" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1180">2.3 Communication</A>, <A NAME=tex2html207 HREF="node17.html#1426" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1426">2.3.4 Asynchronous Communication</A>, <A NAME=tex2html795 HREF="node72.html#9242" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9242">6.5 Asynchronous Communication</A>, <A NAME=tex2html960 HREF="node88.html#11311" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11311">7.6.2 Storage and Sequence </A>, <A NAME=tex2html1100 HREF="node98.html#12831" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12831">8.4 Asynchronous Communication</A>
<DT>asynchronous<DD><A NAME=tex2html183 HREF="node17.html#1180" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1180">2.3 Communication</A>, <A NAME=tex2html207 HREF="node17.html#1426" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1426">2.3.4 Asynchronous Communication</A>, <A NAME=tex2html795 HREF="node72.html#9242" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9242">6.5 Asynchronous Communication</A>, <A NAME=tex2html960 HREF="node88.html#11311" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11311">7.6.2 Storage and Sequence </A>, <A NAME=tex2html1100 HREF="node98.html#12831" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12831">8.4 Asynchronous Communication</A>
<DT>asynchronous<DD><A NAME=tex2html183 HREF="node17.html#1180" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1180">2.3 Communication</A>, <A NAME=tex2html207 HREF="node17.html#1426" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1426">2.3.4 Asynchronous Communication</A>, <A NAME=tex2html795 HREF="node72.html#9242" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#9242">6.5 Asynchronous Communication</A>, <A NAME=tex2html960 HREF="node88.html#11311" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#11311">7.6.2 Storage and Sequence </A>, <A NAME=tex2html1100 HREF="node98.html#12831" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node98.html#12831">8.4 Asynchronous Communication</A>
<DT>dynamic<DD><A NAME=tex2html181 HREF="node17.html#1176" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1176">2.3 Communication</A>, <A NAME=tex2html205 HREF="node17.html#1423" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1423">2.3.3 Unstructured and Dynamic </A>
<DT>dynamic<DD><A NAME=tex2html181 HREF="node17.html#1176" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1176">2.3 Communication</A>, <A NAME=tex2html205 HREF="node17.html#1423" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1423">2.3.3 Unstructured and Dynamic </A>
<DT>local<DD><A NAME=tex2html178 HREF="node17.html#1168" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1168">2.3 Communication</A>
<DT>many-to-many<DD><A NAME=tex2html784 HREF="node71.html#9141" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9141">6.4.2 Many-to-Many Communication</A>
<DT>many-to-one<DD><A NAME=tex2html125 HREF="node10.html#636" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node10.html#636">1.4.4 Parameter Study</A>, <A NAME=tex2html781 HREF="node71.html#9048" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9048">6.4.1 Many-to-One Communication</A>
<DT>many-to-one<DD><A NAME=tex2html125 HREF="node10.html#636" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node10.html#636">1.4.4 Parameter Study</A>, <A NAME=tex2html781 HREF="node71.html#9048" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9048">6.4.1 Many-to-One Communication</A>
<DT>point-to-point<DD><A NAME=tex2html1043 HREF="node95.html#12195" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node95.html#12195">8.1 The MPI Programming </A>
<DT>static<DD><A NAME=tex2html180 HREF="node17.html#1174" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1174">2.3 Communication</A>
<DT>structured<DD><A NAME=tex2html179 HREF="node17.html#1171" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1171">2.3 Communication</A>
<DT>synchronous<DD><A NAME=tex2html182 HREF="node17.html#1178" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1178">2.3 Communication</A>, <A NAME=tex2html790 HREF="node71.html#9196" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9196">6.4.3 Dynamic Channel Structures</A>