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

📄 node1.html

📁 Design and building parallel program
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<LI> <A NAME=tex2html1667 HREF="node59.html#SECTION03281000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node59.html#SECTION03281000000000000000">5.8.1 Processor Object Placement</A>
<LI> <A NAME=tex2html1668 HREF="node59.html#SECTION03282000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node59.html#SECTION03282000000000000000">5.8.2 Mapping Threads to Processor Objects</A>
</UL> 
<LI> <A NAME=tex2html1669 HREF="node60.html#SECTION03290000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node60.html#SECTION03290000000000000000">5.9 Modularity</A>
<LI> <A NAME=tex2html1670 HREF="node61.html#SECTION032100000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node61.html#SECTION032100000000000000000">5.10 Performance Issues</A>
<LI> <A NAME=tex2html1671 HREF="node62.html#SECTION032110000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node62.html#SECTION032110000000000000000">5.11 Case Study: Channel Library</A>
<LI> <A NAME=tex2html1672 HREF="node63.html#SECTION032120000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node63.html#SECTION032120000000000000000">5.12 Case Study: Fock Matrix Construction</A>
<LI> <A NAME=tex2html1673 HREF="node64.html#SECTION032130000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node64.html#SECTION032130000000000000000">5.13 Summary</A>
<LI> <A NAME=tex2html1674 HREF="node65.html#SECTION032140000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node65.html#SECTION032140000000000000000"> Exercises</A>
<LI> <A NAME=tex2html1675 HREF="node66.html#SECTION032150000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node66.html#SECTION032150000000000000000"> Chapter Notes</A>
</UL> 
<LI> <A NAME=tex2html1676 HREF="node67.html#SECTION03300000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node67.html#SECTION03300000000000000000">6 Fortran M</A>
<UL> 
<LI> <A NAME=tex2html1677 HREF="node68.html#SECTION03310000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node68.html#SECTION03310000000000000000">6.1 FM Introduction</A>
<LI> <A NAME=tex2html1678 HREF="node69.html#SECTION03320000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node69.html#SECTION03320000000000000000">6.2 Concurrency</A>
<UL> 
<LI> <A NAME=tex2html1679 HREF="node69.html#SECTION03321000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node69.html#SECTION03321000000000000000">6.2.1 Defining Processes</A>
<LI> <A NAME=tex2html1680 HREF="node69.html#SECTION03322000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node69.html#SECTION03322000000000000000">6.2.2 Creating Processes</A>
</UL> 
<LI> <A NAME=tex2html1681 HREF="node70.html#SECTION03330000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#SECTION03330000000000000000">6.3 Communication</A>
<UL> 
<LI> <A NAME=tex2html1682 HREF="node70.html#SECTION03331000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#SECTION03331000000000000000">6.3.1 Creating Channels</A>
<LI> <A NAME=tex2html1683 HREF="node70.html#SECTION03332000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#SECTION03332000000000000000">6.3.2 Sending Messages</A>
<LI> <A NAME=tex2html1684 HREF="node70.html#SECTION03333000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node70.html#SECTION03333000000000000000">6.3.3 Receiving Messages</A>
</UL> 
<LI> <A NAME=tex2html1685 HREF="node71.html#SECTION03340000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#SECTION03340000000000000000">6.4 Unstructured Communication</A>
<UL> 
<LI> <A NAME=tex2html1686 HREF="node71.html#SECTION03341000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#SECTION03341000000000000000">6.4.1 Many-to-One Communication</A>
<LI> <A NAME=tex2html1687 HREF="node71.html#SECTION03342000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#SECTION03342000000000000000">6.4.2 Many-to-Many Communication</A>
<LI> <A NAME=tex2html1688 HREF="node71.html#SECTION03343000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node71.html#SECTION03343000000000000000">6.4.3 Dynamic Channel Structures</A>
</UL> 
<LI> <A NAME=tex2html1689 HREF="node72.html#SECTION03350000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node72.html#SECTION03350000000000000000">6.5 Asynchronous Communication</A>
<LI> <A NAME=tex2html1690 HREF="node73.html#SECTION03360000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node73.html#SECTION03360000000000000000">6.6 Determinism</A>
<LI> <A NAME=tex2html1691 HREF="node74.html#SECTION03370000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node74.html#SECTION03370000000000000000">6.7 Argument Passing</A>
<UL> 
<LI> <A NAME=tex2html1692 HREF="node74.html#SECTION03371000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node74.html#SECTION03371000000000000000">6.7.1 Copying and Determinism</A>
<LI> <A NAME=tex2html1693 HREF="node74.html#SECTION03372000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node74.html#SECTION03372000000000000000">6.7.2 Avoiding Copying</A>
</UL> 
<LI> <A NAME=tex2html1694 HREF="node75.html#SECTION03380000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#SECTION03380000000000000000">6.8 Mapping</A>
<UL> 
<LI> <A NAME=tex2html1695 HREF="node75.html#SECTION03381000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#SECTION03381000000000000000">6.8.1 Virtual Computers</A>
<LI> <A NAME=tex2html1696 HREF="node75.html#SECTION03382000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#SECTION03382000000000000000">6.8.2 Process Placement</A>
<LI> <A NAME=tex2html1697 HREF="node75.html#SECTION03383000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node75.html#SECTION03383000000000000000">6.8.3 Submachines</A>
</UL> 
<LI> <A NAME=tex2html1698 HREF="node76.html#SECTION03390000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node76.html#SECTION03390000000000000000">6.9 Modularity</A>
<LI> <A NAME=tex2html1699 HREF="node77.html#SECTION033100000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node77.html#SECTION033100000000000000000">6.10 Performance Issues</A>
<LI> <A NAME=tex2html1700 HREF="node78.html#SECTION033110000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node78.html#SECTION033110000000000000000">6.11 Case Study: Fock Matrix Construction</A>
<LI> <A NAME=tex2html1701 HREF="node79.html#SECTION033120000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node79.html#SECTION033120000000000000000">6.12 Summary</A>
<LI> <A NAME=tex2html1702 HREF="node80.html#SECTION033130000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node80.html#SECTION033130000000000000000"> Exercises</A>
<LI> <A NAME=tex2html1703 HREF="node81.html#SECTION033140000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node81.html#SECTION033140000000000000000"> Chapter Notes</A>
</UL> 
<LI> <A NAME=tex2html1704 HREF="node82.html#SECTION03400000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node82.html#SECTION03400000000000000000">7 High Performance Fortran</A>
<UL> 
<LI> <A NAME=tex2html1705 HREF="node83.html#SECTION03410000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#SECTION03410000000000000000">7.1 Data Parallelism</A>
<UL> 
<LI> <A NAME=tex2html1706 HREF="node83.html#SECTION03411000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#SECTION03411000000000000000">7.1.1 Concurrency</A>
<LI> <A NAME=tex2html1707 HREF="node83.html#SECTION03412000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#SECTION03412000000000000000">7.1.2 Locality</A>
<LI> <A NAME=tex2html1708 HREF="node83.html#SECTION03413000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#SECTION03413000000000000000">7.1.3 Design</A>
<LI> <A NAME=tex2html1709 HREF="node83.html#SECTION03414000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node83.html#SECTION03414000000000000000">7.1.4 Data-Parallel Languages</A>
</UL> 
<LI> <A NAME=tex2html1710 HREF="node84.html#SECTION03420000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#SECTION03420000000000000000">7.2 Fortran 90</A>
<UL> 
<LI> <A NAME=tex2html1711 HREF="node84.html#SECTION03421000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#SECTION03421000000000000000">7.2.1 Array Assignment Statement</A>
<LI> <A NAME=tex2html1712 HREF="node84.html#SECTION03422000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node84.html#SECTION03422000000000000000">7.2.2 Array Intrinsic Functions</A>
</UL> 
<LI> <A NAME=tex2html1713 HREF="node85.html#SECTION03430000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#SECTION03430000000000000000">7.3 Data Distribution</A>
<UL> 
<LI> <A NAME=tex2html1714 HREF="node85.html#SECTION03431000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#SECTION03431000000000000000">7.3.1 Processors</A>
<LI> <A NAME=tex2html1715 HREF="node85.html#SECTION03432000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#SECTION03432000000000000000">7.3.2 Alignment</A>
<LI> <A NAME=tex2html1716 HREF="node85.html#SECTION03433000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node85.html#SECTION03433000000000000000">7.3.3 Distribution</A>
</UL> 
<LI> <A NAME=tex2html1717 HREF="node86.html#SECTION03440000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node86.html#SECTION03440000000000000000">7.4 Concurrency</A>
<UL> 
<LI> <A NAME=tex2html1718 HREF="node86.html#SECTION03441000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node86.html#SECTION03441000000000000000">7.4.1 The  FORALL Statement</A>
<LI> <A NAME=tex2html1719 HREF="node86.html#SECTION03442000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node86.html#SECTION03442000000000000000">7.4.2 The  INDEPENDENT Directive and Do-Loops</A>
</UL> 
<LI> <A NAME=tex2html1720 HREF="node87.html#SECTION03450000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node87.html#SECTION03450000000000000000">7.5 Dummy Arguments and Modularity</A>
<UL> 
<LI> <A NAME=tex2html1721 HREF="node87.html#SECTION03450010000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node87.html#SECTION03450010000000000000"> Strategy 1: Remap Arguments.</A>
<LI> <A NAME=tex2html1722 HREF="node87.html#SECTION03450020000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node87.html#SECTION03450020000000000000"> Strategy 2: Use Parent Mapping.</A>
</UL> 
<LI> <A NAME=tex2html1723 HREF="node88.html#SECTION03460000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#SECTION03460000000000000000">7.6 Other HPF Features</A>
<UL> 
<LI> <A NAME=tex2html1724 HREF="node88.html#SECTION03461000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#SECTION03461000000000000000">7.6.1 System Inquiry Intrinsic Functions</A>
<LI> <A NAME=tex2html1725 HREF="node88.html#SECTION03462000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#SECTION03462000000000000000">7.6.2 Storage and Sequence Association</A>
<LI> <A NAME=tex2html1726 HREF="node88.html#SECTION03463000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node88.html#SECTION03463000000000000000">7.6.3 HPF Features Not Covered</A>
</UL> 
<LI> <A NAME=tex2html1727 HREF="node89.html#SECTION03470000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#SECTION03470000000000000000">7.7 Performance Issues</A>
<UL> 
<LI> <A NAME=tex2html1728 HREF="node89.html#SECTION03471000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#SECTION03471000000000000000">7.7.1 HPF Compilation</A>
<LI> <A NAME=tex2html1729 HREF="node89.html#SECTION03472000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#SECTION03472000000000000000">7.7.2 Sequential Bottlenecks</A>
<LI> <A NAME=tex2html1730 HREF="node89.html#SECTION03473000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node89.html#SECTION03473000000000000000">7.7.3 Communication Costs</A>
</UL> 
<LI> <A NAME=tex2html1731 HREF="node90.html#SECTION03480000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node90.html#SECTION03480000000000000000">7.8 Case Study: Gaussian Elimination</A>
<LI> <A NAME=tex2html1732 HREF="node91.html#SECTION03490000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node91.html#SECTION03490000000000000000">7.9 Summary</A>
<LI> <A NAME=tex2html1733 HREF="node92.html#SECTION034100000000000000000" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node92.html#SECTION034100000000000000000"> Exercises</A>

⌨️ 快捷键说明

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