📄 node132.html

📁 Design and building parallel program
💻 HTML
📖 第 1 页 / 共 5 页
字号:
12 3 4 5 下一页
<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>References</TITLE>
</HEAD>
<BODY>
<meta name="description" value="References">
<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=tex2html3574 HREF="node131.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.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=tex2html3582 HREF="node133.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node133.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=tex2html3580 HREF="book.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/book.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=tex2html3584 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=tex2html3585 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=tex2html3583 HREF="node133.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node133.html">Index</A>
<B>Up:</B> <A NAME=tex2html3581 HREF="book.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/book.html">Designing and Building Parallel Programs</A>
<B> Previous:</B> <A NAME=tex2html3575 HREF="node131.html" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/node131.html">12 Further Reading</A>
<BR><HR><P>
<P><A NAME=SECTIONREF><H2>References</H2></A><P>
<DL COMPACT>
<DT><A NAME=ACM91><STRONG>1</STRONG></A><DD>
ACM.
 <em> Resources in Parallel and Concurrent Systems</em>.
 ACM Press, 1991.
<P>
<DT><A NAME=AAS87><STRONG>2</STRONG></A><DD>
G. Adams, D. Agrawal, and H. Siegel.
 A survey and comparison of fault-tolerant multistage interconnection
  networks.
 <em> IEEE Trans. Computs.</em>, C-20(6):14--29, 1987.
<P>
<DT><A NAME=Adams><STRONG>3</STRONG></A><DD>
J. Adams, W. Brainerd, J. Martin, B. Smith, and J. Wagener.
 <em> The Fortran 90 Handbook</em>.
 McGraw-Hill, 1992.
<P>
<DT><A NAME=aggarwalsorting><STRONG>4</STRONG></A><DD>
A. Aggarwal and J. S. Vitter.
 The input/output complexity of sorting and related problems.
 <em> Commun. ACM</em>, 31(9):1116--1127, 1988.
<P>
<DT><A NAME=Agha><STRONG>5</STRONG></A><DD>
G. Agha.
 <em> Actors</em>.
 MIT Press, 1986.
<P>
<DT><A NAME=Saltz1><STRONG>6</STRONG></A><DD>
G. Agrawal, A. Sussman, and J. Saltz.
 Compiler and runtime support for structured and block structured
  applications.
 In <em> Proc. Supercomputing '93</em>, pages 578--587, 1993.
<P>
<DT><A NAME=AHU><STRONG>7</STRONG></A><DD>
A. Aho, J. Hopcroft, and J. Ullman.
 <em> The Design and Analysis of Computer Algorithms</em>.
 Addison-Wesley, 1974.
<P>
<DT><A NAME=Akl89><STRONG>8</STRONG></A><DD>
S. Akl.
 <em> The Design and Analysis of Parallel Algorithms</em>.
 Prentice-Hall, 1989.
<P>
<DT><A NAME=AL93><STRONG>9</STRONG></A><DD>
S. G. Akl and K. A. Lyons.
 <em> Parallel Computational Geometry</em>.
 Prentice-Hall, 1993.
<P>
<DT><A NAME=Albert><STRONG>10</STRONG></A><DD>
E. Albert, J. Lukas, and G. Steele.
 Data parallel computers and the FORALL statement.
 <em> J. Parallel and Distributed Computing</em>, 13(2):185--192, 1991.
<P>
<DT><A NAME=AG94><STRONG>11</STRONG></A><DD>
G. S. Almasi and A. Gottlieb.
 <em> Highly Parallel Computing</em>.
 Benjamin/Cummings, second edition, 1994.
<P>
<DT><A NAME=Amdahl><STRONG>12</STRONG></A><DD>
G. Amdahl.
 Validity of the single-processor approach to achieving large-scale
  computing capabilities.
 In <em> Proc. 1967 AFIPS Conf.</em>, volume 30, page 483. AFIPS Press,
  1967.
<P>
<DT><A NAME=Anderson><STRONG>13</STRONG></A><DD>
S. Anderson.
 Random number generators.
 <em> SIAM Review</em>, 32(2):221--251, 1990.
<P>
<DT><A NAME=And91><STRONG>14</STRONG></A><DD>
G. R. Andrews.
 <em> Concurrent Programming: Principles and Practice</em>.
 Benjamin/Cummings, 1991.
<P>
<DT><A NAME=AO93><STRONG>15</STRONG></A><DD>
G. R. Andrews and R. A. Olsson.
 <em> The SR Programming Language: Concurrency in Practice</em>.
 Benjamin/Cummings, 1993.
<P>
<DT><A NAME=ansistandardF90><STRONG>16</STRONG></A><DD>
ANSI X3J3/S8.115.
 Fortran 90, 1990.
<P>
<DT><A NAME=Arvindam><STRONG>17</STRONG></A><DD>
S. Arvindam, V. Kumar, and V. Rao.
 Floorplan optimization on multiprocessors.
 In <em> Proc. 1989 Intl Conf. on Computer Design</em>, pages 109--113.
  IEEE Computer Society, 1989.
<P>
<DT><A NAME=AS88><STRONG>18</STRONG></A><DD>
W. C. Athas and C. L. Seitz.
 Multicomputers: Message-passing concurrent computers.
 <em> Computer</em>, 21(8):9--24, 1988.
<P>
<DT><A NAME=Concert><STRONG>19</STRONG></A><DD>
J. Auerbach, A. Goldberg, G. Goldszmidt, A. Gopal, M. Kennedy, J. Rao, and
  J. Russell.
 Concert/C: A language for distributed programming.
 In <em> Winter 1994 USENIX Conference</em>. Usenix Association, 1994.
<P>
<DT><A NAME=AGCM90><STRONG>20</STRONG></A><DD>
A. Averbuch, E. Gabber, B. Gordissky, and Y. Medan.
 A parallel FFT on an MIMD machine.
 <em> Parallel Computing</em>, 15:61--74, 1990.
<P>
<DT><A NAME=Bai90><STRONG>21</STRONG></A><DD>
D. Bailey.
 FFTs in external or hierarchical memory.
 <em> J. Supercomputing</em>, 4:23--35, 1990.
<P>
<DT><A NAME=Bailey><STRONG>22</STRONG></A><DD>
J. Bailey.
 First we reshape our computers, then they reshape us: The broader
  intellectual impact of parallelism.
 <em> Daedalus</em>, 121(1):67--86, 1992.
<P>
<DT><A NAME=Bal><STRONG>23</STRONG></A><DD>
H. E. Bal, J. G. Steiner, and A. S. Tanenbaum.
 Programming languages for distributed computing systems.
 <em> ACM Computing Surveys</em>, 21(3):261--322, 1989.
<P>
<DT><A NAME=IBMreport1><STRONG>24</STRONG></A><DD>
V. Bala and S. Kipnis.
 Process groups: A mechanism for the coordination of and
  communication among processes in the Venus collective communication
  library.
 Technical report, IBM T. J. Watson Research Center, 1992.
<P>
<DT><A NAME=IBMreport2><STRONG>25</STRONG></A><DD>
V. Bala, S. Kipnis, L. Rudolph, and M. Snir.
 Designing efficient, scalable, and portable collective communication
  libraries.
 Technical report, IBM T. J. Watson Research Center, 1992.
 Preprint.
<P>
<DT><A NAME=Banerjee><STRONG>26</STRONG></A><DD>
P. Banerjee.
 <em> Parallel Algorithms For VLSI Computer-Aided Design</em>.
 Prentice-Hall, 1994.
<P>
<DT><A NAME=Ban88><STRONG>27</STRONG></A><DD>
U. Banerjee.
 <em> Dependence Analysis for Supercomputing</em>.
 Kluwer Academic Publishers, 1988.
<P>
<DT><A NAME=BS94><STRONG>28</STRONG></A><DD>
S. Barnard and H. Simon.
 Fast multilevel implementation of recursive spectral bisection for
  partitioning unstructured problems.
 <em> Concurrency: Practice and Experience</em>, 6(2):101--117, 1994.
<P>
<DT><A NAME=BN94><STRONG>29</STRONG></A><DD>
J. Barton and L. Nackman.
 <em> Scientific and Engineering C++</em>.
 Addison-Wesley, 1994.
<P>
<DT><A NAME=Batcher><STRONG>30</STRONG></A><DD>
K. Batcher.
 Sorting networks and their applications.
 In <em> Proc. 1968 AFIPS Conf.</em>, volume 32, page 307. AFIPS Press,
  1968.
<P>
<DT><A NAME=BBN89><STRONG>31</STRONG></A><DD>
BBN Advanced Computers Inc.
 <em> TC-2000 Technical Product Summary</em>, 1989.
<P>
<DT><A NAME=BA90><STRONG>32</STRONG></A><DD>
M. Ben-Ari.
 <em> Principles of Concurrent and Distributed Programming</em>.
 Prentice-Hall, 1990.
<P>
<DT><A NAME=Bokhari2><STRONG>33</STRONG></A><DD>
M. Berger and S. Bokhari.
 A partitioning strategy for nonuniform problems on multiprocessors.
 <em> IEEE Trans. Computs.</em>, C-36(5):570--580, 1987.
<P>
<DT><A NAME=BS87><STRONG>34</STRONG></A><DD>
F. Berman and L. Snyder.
 On mapping parallel algorithms into parallel architectures.
 <em> J. Parallel and Distributed Computing</em>, 4(5):439--458, 1987.
<P>
<DT><A NAME=BT89><STRONG>35</STRONG></A><DD>
D. Bertsekas and J. Tsitsiklis.
 <em> Parallel and Distributed Computation: Numerical Methods</em>.
 Prentice-Hall, 1989.
<P>
<DT><A NAME=BOS91><STRONG>36</STRONG></A><DD>
D. P. Bertsekas, C. Ozveren, G. D. Stamoulis, P. Tseng, and J. N. Tsitsiklis.
 Optimal communication algorithms for hypercubes.
 <em> J. Parallel and Distributed Computing</em>, 11:263--275, 1991.
<P>
<DT><A NAME=Ble90><STRONG>37</STRONG></A><DD>
G. Blelloch.
 <em> Vector Models for Data-Parallel Computing</em>.
 MIT Press, 1990.
<P>
<DT><A NAME=BBG91><STRONG>38</STRONG></A><DD>
F. Bodin, P. Beckman, D. B. Gannon, S. Narayana, and S. Yang.
 Distributed pC++: Basic ideas for an object parallel language.
 In <em> Proc. Supercomputing '91</em>, pages 273--282, 1991.
<P>
<DT><A NAME=Bokhari><STRONG>39</STRONG></A><DD>
S. Bokhari.
 On the mapping problem.
 <em> IEEE Trans. Computs.</em>, C-30(3):207--214, 1981.
<P>
<DT><A NAME=OOD><STRONG>40</STRONG></A><DD>
G. Booch.
 <em> Object-Oriented Design with Applications</em>.
 Benjamin-Cummings, 1991.
<P>
<DT><A NAME=BoRCmappingIO><STRONG>41</STRONG></A><DD>
R. Bordawekar, J. del Rosario, and A. Choudhary.
 Design and evaluation of primitives for parallel I/O.
 In <em> Proc. Supercomputing '93</em>, pages 452--461. ACM, 1993.
<P>
<DT><A NAME=Choudhary><STRONG>42</STRONG></A><DD>
Z. Bozkus, A. Choudhary, G. Fox, T. Haupt, and S. Ranka.
 Fortran 90D/HPF compiler for distributed memory MIMD computers:
  Design, implementation, and performance results.
 In <em> Proc. Supercomputing '93</em>. IEEE Computer Society, 1993.
<P>
<DT><A NAME=BGA><STRONG>43</STRONG></A><DD>
W. Brainerd, C. Goldberg, and J. Adams.
 <em> Programmer's Guide to Fortran 90</em>.
 McGraw-Hill, 1990.
<P>
<DT><A NAME=p4article><STRONG>44</STRONG></A><DD>
R. Butler and E. Lusk.
 Monitors, message, and clusters: The p4 parallel programming
  system.
 <em> Parallel Computing</em>, 20:547--564, 1994.
<P>
<DT><A NAME=CaKeCompiling><STRONG>45</STRONG></A><DD>
D. Callahan and K. Kennedy.
 Compiling programs for distributed-memory multiprocessors.
 <em> J. Supercomputing</em>, 2:151--169, 1988.
<P>
<DT><A NAME=Car89><STRONG>46</STRONG></A><DD>
G. F. Carey, editor.
 <em> Parallel Supercomputing: Methods, Algorithms and Applications</em>.
 Wiley, 1989.
<P>
<DT><A NAME=CG2><STRONG>47</STRONG></A><DD>
N. Carriero and D. Gelernter.
 Linda in context.
 <em> Commun. ACM</em>, 32(4):444--458, 1989.
<P>
<DT><A NAME=Linda><STRONG>48</STRONG></A><DD>
N. Carriero and D. Gelernter.
 <em> How to Write Parallel Programs</em>.
 MIT Press, 1990.
<P>
<DT><A NAME=CG3><STRONG>49</STRONG></A><DD>
N. Carriero and D. Gelernter.
 Tuple analysis and partial evaluation strategies in the Linda
  pre-compiler.
 In <em> Languages and Compilers for Parallel Computing</em>.
  MIT-Press, 1990.
<P>
<DT><A NAME=COOL><STRONG>50</STRONG></A><DD>
R. Chandra, A. Gupta, and J. Hennessy.
 COOL: An object-based language for parallel programming.
 <em> Computer</em>, 27(8):14--26, 1994.
<P>
<DT><A NAME=FM2><STRONG>51</STRONG></A><DD>
K. M. Chandy and I. Foster.
 A deterministic notation for cooperating processes.
 <em> IEEE Trans. Parallel and Distributed Syst.</em>, 1995.
 to appear.
<P>
<DT><A NAME=IJSA><STRONG>52</STRONG></A><DD>
K. M. Chandy, I. Foster, K. Kennedy, C. Koelbel, and C.-W. Tseng.
 Integrated support for task and data parallelism.
 <em> Intl J. Supercomputer Applications</em>, 8(2):80--98, 1994.
<P>
<DT><A NAME=CC><STRONG>53</STRONG></A><DD>
K. M. Chandy and C. Kesselman.
 CC++: A declarative concurrent object-oriented programming
  notation.
 In <em> Research Directions in Concurrent Object-Oriented
  Programming</em>. MIT Press, 1993.
<P>
<DT><A NAME=Unity><STRONG>54</STRONG></A><DD>
K. M. Chandy and J. Misra.
 <em> Parallel Program Design</em>.
 Addison-Wesley, 1988.
<P>
<DT><A NAME=CT92><STRONG>55</STRONG></A><DD>
K. M. Chandy and S. Taylor.
 <em> An Introduction to Parallel Programming</em>.
 Jones and Bartlett, 1992.
<P>
<DT><A NAME=Vienna><STRONG>56</STRONG></A><DD>
B. Chapman, P. Mehrotra, and H. Zima.
 Programming in Vienna Fortran.
 <em> Scientific Programming</em>, 1(1):31--50, 1992.
<P>
<DT><A NAME=Chapman2><STRONG>57</STRONG></A><DD>
B. Chapman, P. Mehrotra, and H. Zima.
 Extending HPF for advanced data-parallel applications.
 <em> IEEE Parallel and Distributed Technology</em>, 2(3):15--27, 1994.
<P>
<DT><A NAME=Che93><STRONG>58</STRONG></A><DD>
D. Y. Cheng.
 A survey of parallel programming languages and tools.
 Technical Report RND-93-005, NASA Ames Research Center, Moffett
  Field, Calif., 1993.
<P>
<DT><A NAME=CDW94><STRONG>59</STRONG></A><DD>
J. Choi, J. Dongarra, and D. Walker.
 PUMMA: Parallel Universal Matrix Multiplication
  Algorithms on distributed memory concurrent computers.
 <em> Concurrency: Practice and Experience</em>, 6, 1994.
<P>
<DT><A NAME=JPDC><STRONG>60</STRONG></A><DD>
12 3 4 5 下一页
⌨️ 快捷键说明

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