node1.html

Design and building parallel program

<LI> <A NAME=tex2html1605 HREF="node33.html#SECTION02472050000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#SECTION02472050000000000000"> Hypercube Network.</A>
<LI> <A NAME=tex2html1606 HREF="node33.html#SECTION02472060000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node33.html#SECTION02472060000000000000"> Multistage Interconnection Networks.</A>
</UL> 
</UL> 
<LI> <A NAME=tex2html1607 HREF="node34.html#SECTION02480000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node34.html#SECTION02480000000000000000">3.8 Input/Output</A>
<LI> <A NAME=tex2html1608 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24">3.9 Case Study: Shortest-Path Algorithms</A>
<UL> 
<LI> <A NAME=tex2html1609 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24">3.9.1 Floyd's Algorithm</A>
<UL> 
<LI> <A NAME=tex2html1610 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24"> Parallel Floyd 1.</A>
<LI> <A NAME=tex2html1611 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24"> Parallel Floyd 2.</A>
</UL> 
<LI> <A NAME=tex2html1612 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24">3.9.2 Dijkstra's Algorithm</A>
<UL> 
<LI> <A NAME=tex2html1613 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24"> Parallel Dijkstra 1.</A>
<LI> <A NAME=tex2html1614 HREF="msgs0.htm#24" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#24"> Parallel Dijkstra 2.</A>
</UL> 
<LI> <A NAME=tex2html1615 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>
</UL> 
<LI> <A NAME=tex2html1616 HREF="node36.html#SECTION024100000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node36.html#SECTION024100000000000000000">3.10 Summary</A>
<LI> <A NAME=tex2html1617 HREF="node37.html#SECTION024110000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node37.html#SECTION024110000000000000000"> Exercises</A>
<LI> <A NAME=tex2html1618 HREF="node38.html#SECTION024120000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node38.html#SECTION024120000000000000000"> Chapter Notes</A>
</UL> 
<LI> <A NAME=tex2html1619 HREF="node39.html#SECTION02500000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node39.html#SECTION02500000000000000000">4 Putting Components Together</A>
<UL> 
<LI> <A NAME=tex2html1620 HREF="node40.html#SECTION02510000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node40.html#SECTION02510000000000000000">4.1 Modular Design Review</A>
<UL> 
<LI> <A NAME=tex2html1621 HREF="node40.html#SECTION02510010000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node40.html#SECTION02510010000000000000"> Provide simple interfaces.</A>
<LI> <A NAME=tex2html1622 HREF="node40.html#SECTION02510020000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node40.html#SECTION02510020000000000000"> Ensure that modules hide information.</A>
<LI> <A NAME=tex2html1623 HREF="node40.html#SECTION02510030000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node40.html#SECTION02510030000000000000"> Use appropriate tools.</A>
<LI> <A NAME=tex2html1624 HREF="node40.html#SECTION02510040000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node40.html#SECTION02510040000000000000"> Design checklist.</A>
</UL> 
<LI> <A NAME=tex2html1625 HREF="node41.html#SECTION02520000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02520000000000000000">4.2 Modularity and Parallel Computing</A>
<UL> 
<LI> <A NAME=tex2html1626 HREF="node41.html#SECTION02521000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02521000000000000000">4.2.1 Data Distribution</A>
<LI> <A NAME=tex2html1627 HREF="node41.html#SECTION02522000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02522000000000000000">4.2.2 Sequential Composition</A>
<LI> <A NAME=tex2html1628 HREF="node41.html#SECTION02523000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02523000000000000000">4.2.3 Parallel Composition</A>
<LI> <A NAME=tex2html1629 HREF="node41.html#SECTION02524000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02524000000000000000">4.2.4 Concurrent Composition</A>
<LI> <A NAME=tex2html1630 HREF="node41.html#SECTION02525000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node41.html#SECTION02525000000000000000">4.2.5 Design Rules</A>
</UL> 
<LI> <A NAME=tex2html1631 HREF="node42.html#SECTION02530000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node42.html#SECTION02530000000000000000">4.3 Performance Analysis</A>
<LI> <A NAME=tex2html1632 HREF="node43.html#SECTION02540000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#SECTION02540000000000000000">4.4 Case Study: Convolution</A>
<UL> 
<LI> <A NAME=tex2html1633 HREF="node43.html#SECTION02541000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#SECTION02541000000000000000">4.4.1 Components</A>
<LI> <A NAME=tex2html1634 HREF="node43.html#SECTION02542000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#SECTION02542000000000000000">4.4.2 Composing Components</A>
<LI> <A NAME=tex2html1635 HREF="node43.html#SECTION02543000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node43.html#SECTION02543000000000000000">4.4.3 Convolution Problem Summary</A>
</UL> 
<LI> <A NAME=tex2html1636 HREF="node44.html#SECTION02550000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node44.html#SECTION02550000000000000000">4.5 Case Study: Tuple Space</A>
<UL> 
<LI> <A NAME=tex2html1637 HREF="node44.html#SECTION02551000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node44.html#SECTION02551000000000000000">4.5.1 Application</A>
<LI> <A NAME=tex2html1638 HREF="node44.html#SECTION02552000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node44.html#SECTION02552000000000000000">4.5.2 Implementation</A>
</UL> 
<LI> <A NAME=tex2html1639 HREF="node45.html#SECTION02560000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node45.html#SECTION02560000000000000000">4.6 Case Study: Matrix Multiplication</A>
<UL> 
<LI> <A NAME=tex2html1640 HREF="node45.html#SECTION02561000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node45.html#SECTION02561000000000000000">4.6.1 Parallel Matrix-Matrix Multiplication</A>
<LI> <A NAME=tex2html1641 HREF="node45.html#SECTION02562000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node45.html#SECTION02562000000000000000">4.6.2 Redistribution Costs</A>
<LI> <A NAME=tex2html1642 HREF="node45.html#SECTION02563000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node45.html#SECTION02563000000000000000">4.6.3 A Systolic Algorithm</A>
</UL> 
<LI> <A NAME=tex2html1643 HREF="node46.html#SECTION02570000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node46.html#SECTION02570000000000000000">4.7 Summary</A>
<LI> <A NAME=tex2html1644 HREF="node47.html#SECTION02580000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node47.html#SECTION02580000000000000000"> Exercises</A>
<LI> <A NAME=tex2html1645 HREF="node48.html#SECTION02590000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node48.html#SECTION02590000000000000000"> Chapter Notes</A>
</UL> 
</UL> 
<LI> <A NAME=tex2html1646 HREF="node49.html#SECTION03000000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node49.html#SECTION03000000000000000000">Part II: Tools</A>
<UL> 
<LI> <A NAME=tex2html1647 HREF="node50.html#SECTION03100000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node50.html#SECTION03100000000000000000"> Part II: Tools</A>
<LI> <A NAME=tex2html1648 HREF="node51.html#SECTION03200000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node51.html#SECTION03200000000000000000">5 Compositional C++
 </A>
<UL> 
<LI> <A NAME=tex2html1649 HREF="node52.html#SECTION03210000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#SECTION03210000000000000000">5.1 C++
  Review</A>
<UL> 
<LI> <A NAME=tex2html1650 HREF="node52.html#SECTION03211000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#SECTION03211000000000000000">5.1.1 Strong Typing and Memory Management</A>
<LI> <A NAME=tex2html1651 HREF="node52.html#SECTION03212000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#SECTION03212000000000000000">5.1.2 Classes</A>
<LI> <A NAME=tex2html1652 HREF="node52.html#SECTION03213000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node52.html#SECTION03213000000000000000">5.1.3 Inheritance</A>
</UL> 
<LI> <A NAME=tex2html1653 HREF="node53.html#SECTION03220000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node53.html#SECTION03220000000000000000">5.2 CC++
  Introduction</A>
<LI> <A NAME=tex2html1654 HREF="node54.html#SECTION03230000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node54.html#SECTION03230000000000000000">5.3 Concurrency</A>
<LI> <A NAME=tex2html1655 HREF="node55.html#SECTION03240000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node55.html#SECTION03240000000000000000">5.4 Locality</A>
<UL> 
<LI> <A NAME=tex2html1656 HREF="node55.html#SECTION03241000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node55.html#SECTION03241000000000000000">5.4.1 Processor Objects</A>
<LI> <A NAME=tex2html1657 HREF="node55.html#SECTION03242000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node55.html#SECTION03242000000000000000">5.4.2 Global Pointers</A>
<LI> <A NAME=tex2html1658 HREF="node55.html#SECTION03243000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node55.html#SECTION03243000000000000000">5.4.3 Thread Placement</A>
</UL> 
<LI> <A NAME=tex2html1659 HREF="node56.html#SECTION03250000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#SECTION03250000000000000000">5.5 Communication</A>
<UL> 
<LI> <A NAME=tex2html1660 HREF="node56.html#SECTION03251000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#SECTION03251000000000000000">5.5.1 Remote Operations</A>
<LI> <A NAME=tex2html1661 HREF="node56.html#SECTION03252000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#SECTION03252000000000000000">5.5.2 Synchronization</A>
<LI> <A NAME=tex2html1662 HREF="node56.html#SECTION03253000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#SECTION03253000000000000000">5.5.3 Mutual Exclusion</A>
<LI> <A NAME=tex2html1663 HREF="node56.html#SECTION03254000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node56.html#SECTION03254000000000000000">5.5.4 Data Transfer Functions</A>
</UL> 
<LI> <A NAME=tex2html1664 HREF="node57.html#SECTION03260000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node57.html#SECTION03260000000000000000">5.6 Asynchronous Communication</A>
<LI> <A NAME=tex2html1665 HREF="node58.html#SECTION03270000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node58.html#SECTION03270000000000000000">5.7 Determinism</A>
<LI> <A NAME=tex2html1666 HREF="node59.html#SECTION03280000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node59.html#SECTION03280000000000000000">5.8 Mapping</A>
<UL>