📄 node131.html
字号:
<html><!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN">
<!Converted with LaTeX2HTML 95.1 (Fri Jan 20 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds >
<HEAD>
<TITLE>12 Further Reading</TITLE>
</HEAD>
<BODY>
<meta name="description" value="12 Further Reading">
<meta name="keywords" value="book">
<meta name="resource-type" value="document">
<meta name="distribution" value="global">
<P>
<BR> <HR><a href="msgs0.htm#2" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#2"><img ALIGN=MIDDLE src="asm_color_tiny.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/asm_color_tiny.gif" alt="[DBPP]"></a> <A NAME=tex2html3564 HREF="node130.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node130.html"><IMG ALIGN=MIDDLE ALT="previous" SRC="previous_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/previous_motif.gif"></A> <A NAME=tex2html3570 HREF="node132.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html"><IMG ALIGN=MIDDLE ALT="next" SRC="next_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/next_motif.gif"></A> <A NAME=tex2html3568 HREF="node114.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node114.html"><IMG ALIGN=MIDDLE ALT="up" SRC="up_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/up_motif.gif"></A> <A NAME=tex2html3572 HREF="node1.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node1.html"><IMG ALIGN=MIDDLE ALT="contents" SRC="contents_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/contents_motif.gif"></A> <A NAME=tex2html3573 HREF="node133.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node133.html"><IMG ALIGN=MIDDLE ALT="index" SRC="index_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/index_motif.gif"></A> <a href="msgs0.htm#3" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#3"><img ALIGN=MIDDLE src="search_motif.gif" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/search_motif.gif" alt="[Search]"></a> <BR>
<B> Next:</B> <A NAME=tex2html3571 HREF="node132.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html">References</A>
<B>Up:</B> <A NAME=tex2html3569 HREF="node114.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node114.html">Part III: Resources</A>
<B> Previous:</B> <A NAME=tex2html3565 HREF="node130.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node130.html"> Chapter Notes</A>
<BR><HR><P>
<H1><A NAME=SECTION04400000000000000000>12 Further Reading</A></H1>
<P>
<A NAME=chapbiblio> </A>
<P>
The literature on parallel programming and parallel computing is large
and expanding rapidly. We have provided numerous references to this
literature in the chapter notes. Here, we provide additional
pointers.
<P>
<A NAME=15550> </A>
Numerous books on parallel computing provide other perspectives or
more detailed treatments of topics covered only briefly here. Of
particular interest are the texts by Quinn [<A HREF="node132.html#Quinn94" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Quinn94">235</A>] and Kumar et
al. [<A HREF="node132.html#Kumar93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Kumar93">179</A>], both of which complement <em> Designing and
Building Parallel Programs
</em> by describing a wide range of
parallel algorithms and communication structures; both also include
excellent bibliographies. The Association for Computing
Machinery [<A HREF="node132.html#ACM91" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#ACM91">1</A>] has published a bibliography of relevant
material. Fox et al. [<A HREF="node132.html#Fox88" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Fox88">111</A>,<A HREF="node132.html#Fox94" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Fox94">113</A>] describe a range of parallel
algorithms, focusing on
<A NAME=15556> </A>
developments in the Caltech Concurrent Computation Project. Books by
Akl [<A HREF="node132.html#Akl89" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Akl89">8</A>], Gibbons and Rytter [<A HREF="node132.html#GR90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#GR90">119</A>],
JáJá [<A HREF="node132.html#JaJa92" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#JaJa92">157</A>], Leighton [<A HREF="node132.html#Leighton" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Leighton">187</A>], Miller and
Stout [<A HREF="node132.html#MS92" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#MS92">209</A>], and Smith [<A HREF="node132.html#Smi93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Smi93">267</A>] provide more theoretical
treatments.
<P>
Texts describing parallel computer architecture include those by
<A NAME=15565> </A>
Almasi and Gottlieb [<A HREF="node132.html#AG94" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#AG94">11</A>], DeCegama [<A HREF="node132.html#DeC89" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#DeC89">75</A>],
Hwang [<A HREF="node132.html#Hwa93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Hwa93">156</A>], Reed and Fujimoto [<A HREF="node132.html#RF89" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#RF89">242</A>], Suaya and
Birtwistle [<A HREF="node132.html#SB90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#SB90">272</A>], Stone [<A HREF="node132.html#Sto93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Sto93">269</A>], and Tabak [<A HREF="node132.html#Tab91" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Tab91">278</A>].
See also the survey articles by Duncan [<A HREF="node132.html#Dun90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Dun90">87</A>,<A HREF="node132.html#Dun92" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Dun92">88</A>] and a
chapter in Hennessy and Patterson's [<A HREF="node132.html#HP90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#HP90">134</A>] book on computer
architecture.
<P>
Books providing general introductions to parallel programming or
describing particular approaches include those by
Andrews [<A HREF="node132.html#And91" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#And91">14</A>], Andrews and Olson [<A HREF="node132.html#AO93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#AO93">15</A>], Ben
Ari [<A HREF="node132.html#BA90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#BA90">32</A>], Carriero and Gelernter [<A HREF="node132.html#Linda" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Linda">48</A>], Chandy and
Taylor [<A HREF="node132.html#CT92" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#CT92">55</A>], Foster and Taylor [<A HREF="node132.html#Strand" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Strand">107</A>], Gehani and
Roome [<A HREF="node132.html#GR88" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#GR88">117</A>], Hatcher and Quinn [<A HREF="node132.html#DPC" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#DPC">136</A>], Koelbel et
al. [<A HREF="node132.html#HPFBook" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#HPFBook">176</A>], and Wallach [<A HREF="node132.html#Wal91" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Wal91">291</A>]. See also the survey
articles by Karp [<A HREF="node132.html#Kar87" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Kar87">166</A>] and Bal, Steiner, and
Tanenbaum [<A HREF="node132.html#Bal" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Bal">23</A>]. Feo, Cann, and Oldehoeft [<A HREF="node132.html#Sisal" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Sisal">95</A>]
<A NAME=15588> </A>
describe SISAL, a functional programming language for parallel
<A NAME=15589> </A>
computing.
<P>
Kumar et al. [<A HREF="node132.html#Kumar93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Kumar93">179</A>] describe many parallel numeric algorithms
and provide detailed references to the literature. Books by Bertsekas
and Tsitsiklis [<A HREF="node132.html#BT89" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#BT89">35</A>], Carey [<A HREF="node132.html#Car89" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Car89">46</A>], Dongarra et
al. [<A HREF="node132.html#Dong91" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Dong91">82</A>], Fox et al. [<A HREF="node132.html#Fox88" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Fox88">111</A>], Golub and
Ortega [<A HREF="node132.html#GO93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#GO93">122</A>], Lakshmivarahan and Dhall [<A HREF="node132.html#LD90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#LD90">184</A>], and van der
Velde [<A HREF="node132.html#vdV" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#vdV">290</A>] address various aspects of parallel algorithms in
<A NAME=15598> </A>
numerical analysis and scientific computing. Survey articles in this
area include those by Gallivan, Plemmons, and Sameh [<A HREF="node132.html#GPS90" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#GPS90">116</A>]
<A NAME=15600> </A>
(dense matrix algorithms); Demmel, Heath, and van der
Vorst [<A HREF="node132.html#DHvdV93" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#DHvdV93">77</A>] (dense matrix algorithms); and Heath et
<A NAME=15602> </A>
al. [<A HREF="node132.html#Heath" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node132.html#Heath">140</A>] (sparse matrix algorithms).
<P>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -