node133.html

Design and building parallel program

<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>
<DT>unstructured<DD><A NAME=tex2html202 HREF="node17.html#1418" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1418">2.3.3 Unstructured and Dynamic </A>, <A NAME=tex2html775 HREF="node71.html#9017" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9017">6.4 Unstructured Communication</A>
<DT>unstructured<DD><A NAME=tex2html202 HREF="node17.html#1418" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node17.html#1418">2.3.3 Unstructured and Dynamic </A>, <A NAME=tex2html775 HREF="node71.html#9017" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#9017">6.4 Unstructured Communication</A>
</DL><DT>Communication time<DD><A NAME=tex2html354 HREF="node29.html#3221" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node29.html#3221"> Communication Time.</A>
<DT>Communication/computation ratio<DD><A NAME=tex2html220 HREF="node18.html#1485" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node18.html#1485"> Surface-to-Volume Effects.</A>
<DT>Communicators<DD>seeMPI
<DT>Competition for bandwidth<DD><DL><DT>examples<DD><A NAME=tex2html443 HREF="node33.html#3885" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3885"> Multistage Interconnection Networks.</A>, <A NAME=tex2html449 HREF="node33.html#3910" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3910"> Multistage Interconnection Networks.</A>
<DT>examples<DD><A NAME=tex2html443 HREF="node33.html#3885" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3885"> Multistage Interconnection Networks.</A>, <A NAME=tex2html449 HREF="node33.html#3910" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3910"> Multistage Interconnection Networks.</A>
<DT>idealized model of<DD><A NAME=tex2html412 HREF="node33.html#3732" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3732">3.7.1 Competition for Bandwidth</A>
<DT>impact<DD><A NAME=tex2html411 HREF="node33.html#3730" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3730">3.7 A Refined Communication </A>
</DL><DT>Compilers<DD><DL><DT>data-parallel<DD><A NAME=tex2html886 HREF="node83.html#10669" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10669">7.1.3 Design</A>, <A NAME=tex2html988 HREF="node89.html#11389" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11389">7.7.1 HPF Compilation</A>
<DT>data-parallel<DD><A NAME=tex2html886 HREF="node83.html#10669" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10669">7.1.3 Design</A>, <A NAME=tex2html988 HREF="node89.html#11389" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11389">7.7.1 HPF Compilation</A>
<DT>for CC++<DD><A NAME=tex2html710 HREF="node61.html#7686" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node61.html#7686">5.10 Performance Issues</A>
<DT>for Fortran M<DD><A NAME=tex2html852 HREF="node77.html#9773" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node77.html#9773">6.10 Performance Issues</A>
<DT>for HPF<DD><A NAME=tex2html987 HREF="node89.html#11388" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11388">7.7.1 HPF Compilation</A>, <A NAME=tex2html1030 HREF="node93.html#11712" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11712"> Chapter Notes</A>
<DT>for HPF<DD><A NAME=tex2html987 HREF="node89.html#11388" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#11388">7.7.1 HPF Compilation</A>, <A NAME=tex2html1030 HREF="node93.html#11712" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node93.html#11712"> Chapter Notes</A>
</DL><DT>Composition<DD><DL><DT>concurrent<DD><A NAME=tex2html531 HREF="node41.html#5503" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5503">4.2 Modularity and Parallel </A>, <A NAME=tex2html550 HREF="node41.html#5597" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5597">4.2.4 Concurrent Composition</A>
<DT>concurrent<DD><A NAME=tex2html531 HREF="node41.html#5503" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5503">4.2 Modularity and Parallel </A>, <A NAME=tex2html550 HREF="node41.html#5597" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5597">4.2.4 Concurrent Composition</A>
<DT>definition<DD><A NAME=tex2html521 HREF="node39.html#5457" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node39.html#5457">4 Putting Components Together</A>
<DT>parallel<DD><A NAME=tex2html530 HREF="node41.html#5501" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5501">4.2 Modularity and Parallel </A>
<DT>sequential<DD><A NAME=tex2html528 HREF="node41.html#5498" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5498">4.2 Modularity and Parallel </A>, <A NAME=tex2html536 HREF="node41.html#5517" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5517">4.2.2 Sequential Composition</A>
<DT>sequential<DD><A NAME=tex2html528 HREF="node41.html#5498" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5498">4.2 Modularity and Parallel </A>, <A NAME=tex2html536 HREF="node41.html#5517" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5517">4.2.2 Sequential Composition</A>
</DL><DT>Compositional C++<DD>seeCC++
<DT>Computation time<DD><A NAME=tex2html350 HREF="node29.html#3217" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node29.html#3217"> Computation Time.</A>
<DT>Computational chemistry<DD><A NAME=tex2html300 HREF="node22.html#1967" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node22.html#1967">2.8 Case Study: Computational </A>, <A NAME=tex2html317 HREF="node25.html#2293" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node25.html#2293"> Chapter Notes</A>
<DT>Computational geometry<DD><A NAME=tex2html1327 HREF="node131.html#15604" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15604">12 Further Reading</A>
<DT>Computer architecture<DD><A NAME=tex2html44 HREF="node8.html#383" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node8.html#383">1.2.2 Other Machine Models</A>, <A NAME=tex2html415 HREF="node33.html#3764" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#3764">3.7.2 Interconnection Networks</A>
<DL><DT>references<DD><A NAME=tex2html130 HREF="node13.html#704" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#704"> Chapter Notes</A>, <A NAME=tex2html501 HREF="node38.html#4347" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4347"> Chapter Notes</A>, <A NAME=tex2html1321 HREF="node131.html#15565" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15565">12 Further Reading</A>
<DT>references<DD><A NAME=tex2html130 HREF="node13.html#704" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#704"> Chapter Notes</A>, <A NAME=tex2html501 HREF="node38.html#4347" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4347"> Chapter Notes</A>, <A NAME=tex2html1321 HREF="node131.html#15565" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15565">12 Further Reading</A>
<DT>references<DD><A NAME=tex2html130 HREF="node13.html#704" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#704"> Chapter Notes</A>, <A NAME=tex2html501 HREF="node38.html#4347" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#4347"> Chapter Notes</A>, <A NAME=tex2html1321 HREF="node131.html#15565" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15565">12 Further Reading</A>
<DT>trends<DD><A NAME=tex2html30 HREF="node7.html#350" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#350">1.1.4 Summary of Trends</A>
</DL><DT>Computer performance improvement<DD><A NAME=tex2html25 HREF="node7.html#338" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#338">1.1.2 Trends in Computer </A>, <A NAME=tex2html26 HREF="node7.html#339" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#339">1.1.2 Trends in Computer </A>
<DT>Computer trends<DD><A NAME=tex2html33 HREF="node7.html#355" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#355">1.1.4 Summary of Trends</A>
<DT>Computer vision<DD><A NAME=tex2html1315 HREF="node130.html#15285" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node130.html#15285"> Chapter Notes</A>, <A NAME=tex2html1330 HREF="node131.html#15612" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15612">12 Further Reading</A>
<DT>Computer-aided diagnosis<DD><A NAME=tex2html11 HREF="node7.html#288" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#288">1.1.1 Trends in Applications</A>
<DT>Concert C<DD><A NAME=tex2html730 HREF="node66.html#7901" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node66.html#7901"> Chapter Notes</A>
<DT>Concurrency<DD><DL><DT>explicit vs. implicit<DD><A NAME=tex2html868 HREF="node83.html#10594" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10594">7.1.1 Concurrency</A>
<DT>in CC++<DD><A NAME=tex2html645 HREF="node54.html#6911" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node54.html#6911">5.3 Concurrency</A>
<DT>in data-parallel programs<DD><A NAME=tex2html866 HREF="node83.html#10592" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10592">7.1.1 Concurrency</A>
<DT>in Fortran M<DD><A NAME=tex2html741 HREF="node69.html#8732" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node69.html#8732">6.2 Concurrency</A>
<DT>parallel software requirement<DD><A NAME=tex2html23 HREF="node7.html#323" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node7.html#323">1.1.2 Trends in Computer </A>
</DL><DT>Concurrent C<DD><A NAME=tex2html729 HREF="node66.html#7899" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node66.html#7899"> Chapter Notes</A>
<DT>Concurrent composition<DD><A NAME=tex2html532 HREF="node41.html#5505" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5505">4.2 Modularity and Parallel </A>, <A NAME=tex2html549 HREF="node41.html#5596" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5596">4.2.4 Concurrent Composition</A>
<DL><DT>benefits<DD><A NAME=tex2html551 HREF="node41.html#5599" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5599">4.2.4 Concurrent Composition</A>, <A NAME=tex2html552 HREF="node41.html#5600" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5600">4.2.4 Concurrent Composition</A>
<DT>benefits<DD><A NAME=tex2html551 HREF="node41.html#5599" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5599">4.2.4 Concurrent Composition</A>, <A NAME=tex2html552 HREF="node41.html#5600" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5600">4.2.4 Concurrent Composition</A>
<DT>cost<DD><A NAME=tex2html553 HREF="node41.html#5602" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5602">4.2.4 Concurrent Composition</A>
<DT>example<DD><A NAME=tex2html548 HREF="node41.html#5613" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#5613">4.2.4 Concurrent Composition</A>
<DT>in CC++<DD><A NAME=tex2html686 HREF="node59.html#7577" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node59.html#7577">5.8.2 Mapping Threads to </A>
<DT>in Fortran M<DD><A NAME=tex2html827 HREF="node75.html#9544" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#9544">6.8.3 Submachines</A>
<DT>tuple space example<DD><A NAME=tex2html579 HREF="node44.html#5815" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node44.html#5815">4.5 Case Study: Tuple </A>
</DL><DT>Concurrent Computation Project<DD><A NAME=tex2html1320 HREF="node131.html#15556" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15556">12 Further Reading</A>
<DT>Concurrent data structures<DD><A NAME=tex2html1331 HREF="node131.html#15614" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15614">12 Further Reading</A>
<DT>Concurrent logic programming<DD><A NAME=tex2html144 HREF="node13.html#747" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node13.html#747"> Chapter Notes</A>
<DT>Conferences in parallel computing<DD><A NAME=tex2html1336 HREF="node131.html#15640" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html#15640">12 Further Reading</A>
<DT>Conformality<DD><DL><DT>definition<DD><A NAME=tex2html871 HREF="node83.html#10608" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#10608">7.1.1 Concurrency</A>
<DT>in Fortran M<DD><A NAME=tex2html762 HREF="node70.html#8845" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#8845">6.3.1 Creating Channels</A>
<DT>of array sections<DD><A NAME=tex2html899 HREF="node84.html#10699" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#10699">7.2.1 Array Assignment Statement</A>
</DL><DT>Constructor functions in C++<DD><A NAME=tex2html620 HREF="node52.html#6759" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#6759">5.1.2 Classes</A>
<DT>Convolution algorithm<DD><DL><DT>application in image processing<DD><A NAME=tex2html562 HREF="node43.html#5694" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#5694">4.4 Case Study: Convolution</A>