node132.html

Design and building parallel program

<P>
<DT><A NAME=Neumann><STRONG>121</STRONG></A><DD>
H. Goldstine and J. von Neumann.
 On the principles of large-scale computing machines.
 In <em> Collected Works of John von Neumann, Vol. 5</em>. Pergamon, 1963.
<P>
<DT><A NAME=GO93><STRONG>122</STRONG></A><DD>
G. H. Golub and J. M. Ortega.
 <em> Scientific Computing: An Introduction with Parallel
  Computing</em>.
 Academic Press, 1993.
<P>
<DT><A NAME=GGK83><STRONG>123</STRONG></A><DD>
A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and
  M. Snir.
 The NYU ultracomputer: Designing a MIMD, shared memory parallel
  computer.
 <em> IEEE Trans. Computs.</em>, C-32(2):175--189, 1983.
<P>
<DT><A NAME=GKM><STRONG>124</STRONG></A><DD>
S. Graham, P. Kessler, and M. McKusick.
 gprof: A call graph execution profiler.
 In <em> Proc. SIGPLAN '92 Symposium on Compiler Construction</em>, pages
  120--126. ACM, 1982.
<P>
<DT><A NAME=Mentat><STRONG>125</STRONG></A><DD>
A. S. Grimshaw.
 An introduction to parallel object-oriented programming with
  Mentat.
 Technical Report 91 07, University of Virginia, 1991.
<P>
<DT><A NAME=GLS94><STRONG>126</STRONG></A><DD>
W. Gropp, E. Lusk, and A. Skjellum.
 <em> Using MPI: Portable Parallel Programming with the Message
  Passing Interface</em>.
 MIT Press, 1995.
<P>
<DT><A NAME=GS93><STRONG>127</STRONG></A><DD>
W. Gropp and B. Smith.
 Scalable, extensible, and portable numerical libraries.
 In <em> Proc. Scalable Parallel Libraries Conf.</em>, pages 87--93. IEEE
  Computer Society, 1993.
<P>
<DT><A NAME=Gup87><STRONG>128</STRONG></A><DD>
A. Gupta.
 <em> Parallelism in Production Systems</em>.
 Morgan Kaufmann, 1987.
<P>
<DT><A NAME=Gus88><STRONG>129</STRONG></A><DD>
J. L. Gustafson.
 Reevaluating Amdahl's law.
 <em> Commun. ACM</em>, 31(5):532--533, 1988.
<P>
<DT><A NAME=GMB88><STRONG>130</STRONG></A><DD>
J. L. Gustafson, G. R. Montry, and R. E. Benner.
 Development of parallel methods for a 1024-processor hypercube.
 <em> SIAM J. Sci. and Stat. Computing</em>, 9(4):609--638, 1988.
<P>
<DT><A NAME=Hac89><STRONG>131</STRONG></A><DD>
A. Hac.
 Load balancing in distributed systems: A summary.
 <em> Performance Evaluation Review</em>, 16(2):17--19, 1989.
<P>
<DT><A NAME=HK><STRONG>132</STRONG></A><DD>
G. Haring and G. Kotsis, editors.
 <em> Performance Measurement and Visualization of Parallel Systems</em>.
 Elsevier Science Publishers, 1993.
<P>
<DT><A NAME=Harrison2><STRONG>133</STRONG></A><DD>
P. Harrison.
 Analytic models for multistage interconnection networks.
 <em> J. Parallel and Distributed Computing</em>, 12(4):357--369, 1991.
<P>
<DT><A NAME=HP90><STRONG>134</STRONG></A><DD>
P. Harrison and N. M. Patel.
 The representation of multistage interconnection networks in queuing
  models of parallel systems.
 <em> J. ACM</em>, 37(4):863--898, 1990.
<P>
<DT><A NAME=Harrison><STRONG>135</STRONG></A><DD>
R. Harrison et al.
 High performance computational chemistry: (II) A scalable SCF
  code.
 Preprint, Mathematics and Computer Science Division, Argonne National
  Laboratory, Argonne, Ill., 1994.
<P>
<DT><A NAME=DPC><STRONG>136</STRONG></A><DD>
P. Hatcher and M. Quinn.
 <em> Data-Parallel Programming on MIMD Computers</em>.
 MIT Press, 1991.
<P>
<DT><A NAME=HQL91><STRONG>137</STRONG></A><DD>
P. Hatcher, M. Quinn, et al.
 Data-parallel programming on MIMD computers.
 <em> IEEE Trans. Parallel and Distributed Syst.</em>, 2(3):377--383,
  1991.
<P>
<DT><A NAME=Heath2><STRONG>138</STRONG></A><DD>
M. Heath.
 Recent developments and case studies in performance visualization
  using ParaGraph.
 In <em> Performance Measurement and Visualization of Parallel
  Systems</em>, pages 175--200. Elsevier Science Publishers, 1993.
<P>
<DT><A NAME=Paragraph><STRONG>139</STRONG></A><DD>
M. Heath and J. Etheridge.
 Visualizing the performance of parallel programs.
 <em> IEEE Software</em>, 8(5):29--39, 1991.
<P>
<DT><A NAME=Heath><STRONG>140</STRONG></A><DD>
M. Heath, E. Ng, and B. Peyton.
 Parallel algorithms for sparse linear systems.
 <em> SIAM Review</em>, 33(3):420--460, 1991.
<P>
<DT><A NAME=HRS88><STRONG>141</STRONG></A><DD>
M. Heath, A. Rosenberg, and B. Smith.
 The physical mapping problem for parallel architectures.
 <em> J. ACM</em>, 35(3):603--634, 1988.
<P>
<DT><A NAME=Hehre><STRONG>142</STRONG></A><DD>
W. Hehre, L. Radom, P. Schleyer, and J. Pople.
 <em> Ab Initio Molecular Orbital Theory</em>.
 John Wiley and Sons, 1986.
<P>
<DT><A NAME=parmacs1><STRONG>143</STRONG></A><DD>
R. Hempel.
 The ANL/GMD macros (PARMACS) in Fortran for portable parallel
  programming using the message passing programming model -- users' guide and
  reference manual.
 Technical report, GMD, Postfach 1316, D-5205 Sankt Augustin
  1, Germany, 1991.
<P>
<DT><A NAME=parmacs2><STRONG>144</STRONG></A><DD>
R. Hempel, H.-C. Hoppe, and A. Supalov.
 PARMACS 6.0 library interface specification.
 Technical report, GMD, Postfach 1316, D-5205 Sankt Augustin
  1, Germany, 1992.
<P>
<DT><A NAME=HNS94><STRONG>145</STRONG></A><DD>
M. Henderson, B. Nickless, and R. Stevens.
 A scalable high-performance I/O system.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  79--86. IEEE Computer Society, 1994.
<P>
<DT><A NAME=Henderson><STRONG>146</STRONG></A><DD>
P. Henderson.
 <em> Functional Programming</em>.
 Prentice-Hall, 1980.
<P>
<DT><A NAME=Henn><STRONG>147</STRONG></A><DD>
J. Hennessy and N. Joupp.
 Computer technology and architecture: An evolving interaction.
 <em> Computer</em>, 24(9):18--29, 1991.
<P>
<DT><A NAME=LH><STRONG>148</STRONG></A><DD>
V. Herrarte and E. Lusk.
 Studying parallel program behavior with <tt> upshot</tt>.
 Technical Report ANL-91/15, Mathematics and Computer Science
  Division, Argonne National Laboratory, Argonne, Ill., 1991.
<P>
<DT><A NAME=HPFspec><STRONG>149</STRONG></A><DD>
High Performance Fortran Forum.
 High Performance Fortran language specification, version 1.0.
 Technical Report CRPC-TR92225, Center for Research on Parallel
  Computation, Rice University, Houston, Tex., 1993.
<P>
<DT><A NAME=Hil85><STRONG>150</STRONG></A><DD>
W. D. Hillis.
 <em> The Connection Machine</em>.
 MIT Press, 1985.
<P>
<DT><A NAME=HS86><STRONG>151</STRONG></A><DD>
W. D. Hillis and G. L. Steele.
 Data parallel algorithms.
 <em> Commun. ACM</em>, 29(12):1170--1183, 1986.
<P>
<DT><A NAME=HKTCACM><STRONG>152</STRONG></A><DD>
S. Hiranandani, K. Kennedy, and C. Tseng.
 Compiling Fortran D for MIMD distributed-memory machines.
 <em> Commun. ACM</em>, 35(8):66--80, 1992.
<P>
<DT><A NAME=Quicksort><STRONG>153</STRONG></A><DD>
C. A. R. Hoare.
 Quicksort.
 <em> Computer J.</em>, 5(1):10--15, 1962.
<P>
<DT><A NAME=CSP><STRONG>154</STRONG></A><DD>
C. A. R. Hoare.
 <em> Communicating Sequential Processes</em>.
 Prentice Hall, 1984.
<P>
<DT><A NAME=ECMWF2><STRONG>155</STRONG></A><DD>
G. Hoffmann and T. Kauranne, editors.
 <em> Parallel Supercomputing in the Atmospheric Sciences</em>.
 World Scientific, 1993.
<P>
<DT><A NAME=Hwa93><STRONG>156</STRONG></A><DD>
K. Hwang.
 <em> Advanced Computer Architecture: Parallelism, Scalability,
  Programmability</em>.
 McGraw-Hill, 1993.
<P>
<DT><A NAME=JaJa92><STRONG>157</STRONG></A><DD>
J. J&#225;J&#225;.
 <em> An Introduction to Parallel Algorithms</em>.
 Addison-Wesley, 1992.
<P>
<DT><A NAME=Jenq><STRONG>158</STRONG></A><DD>
J. Jenq and S. Sahni.
 All pairs shortest paths on a hypercube multiprocessor.
 In <em> Proc. 1987 Intl. Conf. on Parallel Processing</em>, pages
  713--716, 1987.
<P>
<DT><A NAME=Johnsson><STRONG>159</STRONG></A><DD>
S. L. Johnsson.
 Communication efficient basic linear algebra computations on
  hypercube architectures.
 <em> J. Parallel and Distributed Computing</em>, 4(2):133--172, 1987.
<P>
<DT><A NAME=JH89><STRONG>160</STRONG></A><DD>
S. L. Johnsson and C.-T. Ho.
 Optimum broadcasting and personalized communication in hypercubes.
 <em> IEEE Trans. Computs.</em>, C-38(9):1249--1268, 1989.
<P>
<DT><A NAME=JP94><STRONG>161</STRONG></A><DD>
M. Jones and P. Plassmann.
 Parallel algorithms for the adaptive refinement and partitioning of
  unstructured meshes.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  478--485. IEEE Computer Society, 1994.
<P>
<DT><A NAME=Kahn72><STRONG>162</STRONG></A><DD>
R. Kahn.
 Resource-sharing computer communication networks.
 <em> Proc. IEEE</em>, 60(11):1397--1407, 1972.
<P>
<DT><A NAME=MonteCarlo><STRONG>163</STRONG></A><DD>
M. Kalos.
 <em> The Basics of Monte Carlo Methods</em>.
 J. Wiley and Sons, 1985.
<P>
<DT><A NAME=KK88><STRONG>164</STRONG></A><DD>
L. N. Kanal and V. Kumar.
 <em> Search in Artificial Intelligence</em>.
 Springer-Verlag, 1988.
<P>
<DT><A NAME=KarpBabb><STRONG>165</STRONG></A><DD>
A. Karp and R. Babb.
 A comparison of twelve parallel Fortran dialects.
 <em> IEEE Software</em>, 5(5):52--67, 1988.
<P>
<DT><A NAME=Kar87><STRONG>166</STRONG></A><DD>
A. H. Karp.
 Programming for parallelism.
 <em> IEEE Computer</em>, 20(9):43--57, 1987.
<P>
<DT><A NAME=KF90><STRONG>167</STRONG></A><DD>
A. H. Karp and H. P. Flatt.
 Measuring parallel processor performance.
 <em> Commun. ACM</em>, 33(5):539--543, 1990.
<P>
<DT><A NAME=katzdiskarch><STRONG>168</STRONG></A><DD>
R. Katz, G. Gibson, and D. Patterson.
 Disk system architectures for high performance computing.
 <em> Proc. IEEE</em>, 77(12):1842--1858, 1989.
<P>
<DT><A NAME=KS93><STRONG>169</STRONG></A><DD>
W. J. Kaufmann and L. L. Smarr.
 <em> Supercomputing and the Transformation of Science</em>.
 Scientific American Library, 1993.
<P>
<DT><A NAME=KR><STRONG>170</STRONG></A><DD>
B. Kernighan and D. Ritchie.
 <em> The C Programming Language</em>.
 Prentice Hall, second edition, 1988.
<P>
<DT><A NAME=Kerrigan><STRONG>171</STRONG></A><DD>
J. Kerrigan.
 <em> Migrating to Fortran 90</em>.
 O'Reilly and Associates, 1992.
<P>
<DT><A NAME=CarlThesis><STRONG>172</STRONG></A><DD>
C. Kesselman.
 <em> Integrating Performance Analysis with Performance Improvement in
  Parallel Programs</em>.
 PhD thesis, UCLA, 1991.
<P>
<DT><A NAME=Klein><STRONG>173</STRONG></A><DD>
L. Kleinrock.
 On the modeling and analysis of computer networks.
 <em> Proc. IEEE</em>, 81(8):1179--1191, 1993.
<P>
<DT><A NAME=Knuth3><STRONG>174</STRONG></A><DD>
D. Knuth.
 <em> The Art of Computer Programming: Volume 3, Sorting and
  Searching</em>.
 Addison-Wesley, 1973.
<P>
<DT><A NAME=Knuth2><STRONG>175</STRONG></A><DD>
D. Knuth.
 <em> The Art of Computer Programming: Volume 2, Seminumerical
  Algorithms</em>.
 Addison-Wesley, 1981.
<P>
<DT><A NAME=HPFBook><STRONG>176</STRONG></A><DD>
C. Koelbel, D. Loveman, R. Schreiber, G. Steele, and M. Zosel.
 <em> The High Performance Fortran Handbook</em>.
 MIT Press, 1994.
<P>
<DT><A NAME=Koonin><STRONG>177</STRONG></A><DD>
S. Koonin and D. Meredith.
 <em> Computational Physics</em>.
 Addison-Wesley, 1990.
<P>
<DT><A NAME=Kow88><STRONG>178</STRONG></A><DD>
J. S. Kowalik.
 <em> Parallel Computation and Computers for Artificial Intelligence</em>.
 Kluwer Academic Publishers, 1988.
<P>
<DT><A NAME=Kumar93><STRONG>179</STRONG></A><DD>
V. Kumar, A. Grama, A. Gupta, and G. Karypis.
 <em> Introduction to Parallel Computing</em>.
 Benjamin/Cummings, 1993.
<P>
<DT><A NAME=KGR94><STRONG>180</STRONG></A><DD>
V. Kumar, A. Grama, and V. Rao.
 Scalable load balancing techniques for parallel computers.
 <em> J. Parallel and Distributed Computing</em>, 22(1):60--79, 1994.
<P>
<DT><A NAME=Kumar><STRONG>181</STRONG></A><DD>
V. Kumar and V. Rao.
 Parallel depth-first search, part II: Analysis.
 <em> Intl J. of Parallel Programming</em>, 16(6):479--499, 1987.
<P>