node132.html

Design and building parallel program

<DT><A NAME=KumarS><STRONG>182</STRONG></A><DD>
V. Kumar and V. Singh.
 Scalability of parallel algorithms for the all-pairs shortest-path
  problem.
 <em> J. Parallel and Distributed Computing</em>, 13(2):124--138, 1991.
<P>
<DT><A NAME=LS84><STRONG>183</STRONG></A><DD>
T. Lai and S. Sahni.
 Anomalies in parallel branch-and-bound algorithms.
 <em> Commun. ACM</em>, 27(6):594--602, 1984.
<P>
<DT><A NAME=LD90><STRONG>184</STRONG></A><DD>
S. Lakshmivarahan and S. K. Dhall.
 <em> Analysis and Design of Parallel Algorithms: Arithmetic and
  Matrix Problems</em>.
 McGraw-Hill, 1990.
<P>
<DT><A NAME=Lamport><STRONG>185</STRONG></A><DD>
L. Lamport.
 Time, clocks, and the ordering of events in a distributed system.
 <em> Commun. ACM</em>, 21(7):558--565, 1978.
<P>
<DT><A NAME=Lawson><STRONG>186</STRONG></A><DD>
H. Lawson.
 <em> Parallel Processing in Industrial Real-time Applications</em>.
 Prentice Hall, 1992.
<P>
<DT><A NAME=Leighton><STRONG>187</STRONG></A><DD>
F. T. Leighton.
 <em> Introduction to Parallel Algorithms and Architectures</em>.
 Morgan Kaufmann, 1992.
<P>
<DT><A NAME=LQ><STRONG>188</STRONG></A><DD>
M. Lemke and D. Quinlan.
 P++, a parallel C++ array class library for
  architecture-independent development of structured grid applications.
 In <em> Proc. Workshop on Languages, Compilers, and Runtime
  Environments for Distributed Memory Computers</em>. ACM, 1992.
<P>
<DT><A NAME=Levin><STRONG>189</STRONG></A><DD>
E. Levin.
 Grand challenges in computational science.
 <em> Commun. ACM</em>, 32(12):1456--1457, 1989.
<P>
<DT><A NAME=linkeller87><STRONG>190</STRONG></A><DD>
F. C. H. Lin and R. M. Keller.
 The gradient model load balancing method.
 <em> IEEE Trans. Software Eng.</em>, SE-13(1):32--38, 1987.
<P>
<DT><A NAME=Lo88><STRONG>191</STRONG></A><DD>
V. Lo.
 Heuristic algorithms for task assignment in distributed systems.
 <em> IEEE Trans. Computs.</em>, C-37(11):1384--1397, 1988.
<P>
<DT><A NAME=Loa92><STRONG>192</STRONG></A><DD>
C. Loan.
 <em> Computational Frameworks for the Fast Fourier Transform</em>.
 SIAM, 1992.
<P>
<DT><A NAME=Lovemanhpf><STRONG>193</STRONG></A><DD>
D. Loveman.
 High Performance Fortran.
 <em> IEEE Parallel and Distributed Technology</em>, 1(1):25--42, 1993.
<P>
<DT><A NAME=p4book><STRONG>194</STRONG></A><DD>
E. Lusk, R. Overbeek, et al.
 <em> Portable Programs for Parallel Processors</em>.
 Holt, Rinehard, and Winston, 1987.
<P>
<DT><A NAME=manber86><STRONG>195</STRONG></A><DD>
U. Manber.
 On maintaining dynamic information in a concurrent environment.
 <em> SIAM J. Computing</em>, 15(4):1130--1142, 1986.
<P>
<DT><A NAME=PCissue><STRONG>196</STRONG></A><DD>
O. McBryan.
 An overview of message passing environments.
 <em> Parallel Computing</em>, 20(4):417--444, 1994.
<P>
<DT><A NAME=MdV87><STRONG>197</STRONG></A><DD>
O. A. McBryan and E. F. V. de Velde.
 Hypercube algorithms and implementations.
 <em> SIAM J. Sci. and Stat. Computing</em>, 8(2):227--287, 1987.
<P>
<DT><A NAME=McConnell><STRONG>198</STRONG></A><DD>
S. McConnell.
 <em> Code Complete: A Practical Handbook of Software Construction</em>.
 Microsoft Press, 1993.
<P>
<DT><A NAME=Mead><STRONG>199</STRONG></A><DD>
C. Mead and L. Conway.
 <em> Introduction to VLSI Systems</em>.
 Addison-Wesley, 1980.
<P>
<DT><A NAME=Kali><STRONG>200</STRONG></A><DD>
P. Mehrotra and J. Van Rosendale.
 Programming distributed memory architectures using Kali.
 In <em> Advances in Languages and Compilers for Parallel Computing</em>.
  MIT Press, 1991.
<P>
<DT><A NAME=Meindl><STRONG>201</STRONG></A><DD>
J. D. Meindl.
 Chips for advanced computing.
 <em> Scientific American</em>, 257(4):78--88, 1987.
<P>
<DT><A NAME=mpi><STRONG>202</STRONG></A><DD>
Message Passing Interface Forum.
 Document for a standard message-passing interface.
 Technical report, University of Tennessee, Knoxville, Tenn.,
  1993.
<P>
<DT><A NAME=mpi1><STRONG>203</STRONG></A><DD>
Message Passing Interface Forum.
 MPI: A message passing interface.
 In <em> Proc. Supercomputing '93</em>, pages 878--883. IEEE Computer
  Society, 1993.
<P>
<DT><A NAME=MetcalfReid><STRONG>204</STRONG></A><DD>
M. Metcalf and J. Reid.
 <em> Fortran 90 Explained</em>.
 Oxford Science Publications, 1990.
<P>
<DT><A NAME=MB76><STRONG>205</STRONG></A><DD>
R. Metcalfe and D. Boggs.
 Ethernet: Distributed packet switching for local area networks.
 <em> Commun. ACM</em>, 19(7):711--719, 1976.
<P>
<DT><A NAME=Mich><STRONG>206</STRONG></A><DD>
J. Michalakes.
 Analysis of workload and load balancing issues in the NCAR
  community climate model.
 Technical Report ANL/MCS-TM-144, Mathematics and Computer Science
  Division, Argonne National Laboratory, Argonne, Ill., 1991.
<P>
<DT><A NAME=IPS2><STRONG>207</STRONG></A><DD>
B. Miller et al.
 IPS-2: The second generation of a parallel program measurement
  system.
 <em> IEEE Trans. Parallel and Distributed Syst.</em>, 1(2):206--217,
  1990.
<P>
<DT><A NAME=Miller91a><STRONG>208</STRONG></A><DD>
E. Miller and R. Katz.
 Input/output behavior of supercomputing applications.
 In <em> Proc. Supercomputing '91</em>, pages 567--576. ACM, 1991.
<P>
<DT><A NAME=MS92><STRONG>209</STRONG></A><DD>
R. Miller and Q. F. Stout.
 <em> Parallel Algorithms for Regular Architectures</em>.
 MIT Press, 1992.
<P>
<DT><A NAME=Milner><STRONG>210</STRONG></A><DD>
R. Milner.
 Calculi for synchrony and asynchrony.
 <em> Theoretical Computer Science</em>, 25:267--310, 1983.
<P>
<DT><A NAME=Vertex><STRONG>211</STRONG></A><DD>
nCUBE Corporation.
 <em> nCUBE 2 Programmers Guide, r2.0</em>, 1990.
<P>
<DT><A NAME=nCU90><STRONG>212</STRONG></A><DD>
nCUBE Corporation.
 <em> nCUBE 6400 Processor Manual</em>, 1990.
<P>
<DT><A NAME=nicolsaltz90><STRONG>213</STRONG></A><DD>
D. M. Nicol and J. H. Saltz.
 An analysis of scatter decomposition.
 <em> IEEE Trans. Computs.</em>, C-39(11):1337--1345, 1990.
<P>
<DT><A NAME=Nil80><STRONG>214</STRONG></A><DD>
N. Nilsson.
 <em> Principles of Artificial Intelligence</em>.
 Tioga Publishers, 1980.
<P>
<DT><A NAME=NSF91><STRONG>215</STRONG></A><DD>
Grand challenges: High performance computing and communications.
 A Report by the Committee on Physical, Mathematical and
  Engineering Sciences, NSF/CISE, 1800 G Street NW, Washington,
  DC 20550, 1991.
<P>
<DT><A NAME=NA91><STRONG>216</STRONG></A><DD>
D. Nussbaum and A. Agarwal.
 Scalability of parallel machines.
 <em> Commun. ACM</em>, 34(3):56--61, 1991.
<P>
<DT><A NAME=Paige><STRONG>217</STRONG></A><DD>
R. Paige and C. Kruskal.
 Parallel algorithms for shortest paths problems.
 In <em> Proc. 1989 Intl. Conf. on Parallel Processing</em>, pages 14--19,
  1989.
<P>
<DT><A NAME=Pancake><STRONG>218</STRONG></A><DD>
C. Pancake and D. Bergmark.
 Do parallel languages respond to the needs of scientific programmers?
 <em> Computer</em>, 23(12):13--23, 1990.
<P>
<DT><A NAME=express><STRONG>219</STRONG></A><DD>
Parasoft Corporation.
 <em> Express Version 1.0: A Communication Environment for Parallel
  Computers</em>, 1988.
<P>
<DT><A NAME=Parnas><STRONG>220</STRONG></A><DD>
D. Parnas.
 On the criteria to be used in decomposing systems into modules.
 <em> Commun. ACM</em>, 15(12):1053--1058, 1972.
<P>
<DT><A NAME=Parnas2><STRONG>221</STRONG></A><DD>
D. Parnas.
 Designing software for ease of extension and contraction.
 <em> IEEE Trans. Software Eng.</em>, SE-5(2):128--138, 1979.
<P>
<DT><A NAME=Parnas4><STRONG>222</STRONG></A><DD>
D. Parnas and P. Clements.
 A rational design process: How and why to fake it.
 <em> IEEE Trans. Software Eng.</em>, SE-12(2):251--257, 1986.
<P>
<DT><A NAME=Parnas3><STRONG>223</STRONG></A><DD>
D. Parnas, P. Clements, and D. Weiss.
 The modular structure of complex systems.
 <em> IEEE Trans. Software Eng.</em>, SE-11(3):259--266, 1985.
<P>
<DT><A NAME=Patel><STRONG>224</STRONG></A><DD>
J. Patel.
 Analysis of multiprocessors with private cache memories.
 <em> IEEE Trans. Computs.</em>, C-31(4):296--304, 1982.
<P>
<DT><A NAME=Pea84><STRONG>225</STRONG></A><DD>
J. Pearl.
 <em> Heuristics---Intelligent Search Strategies for Computer Problem
  Solving</em>.
 Addison-Wesley, 1984.
<P>
<DT><A NAME=PBG85><STRONG>226</STRONG></A><DD>
G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harey, W. J. Kleinfelder,
  K. P. McAuliffe, E. A. Melton, V. A. Norlton, and J. Weiss.
 The IBM research parallel processor prototype (RP3):
  Introduction and architecture.
 In <em> Proc. 1985 Intl Conf. on Parallel Processing</em>, pages
  764--771, 1985.
<P>
<DT><A NAME=NX2><STRONG>227</STRONG></A><DD>
P. Pierce.
 The NX/2 operating system.
 In <em> Proc. 3rd Conf. on Hypercube Concurrent Computers and
  Applications</em>, pages 384--390. ACM Press, 1988.
<P>
<DT><A NAME=PL94><STRONG>228</STRONG></A><DD>
J. Plank and K. Li.
 Performance results of <tt> ickp</tt>---A consistent checkpointer on
  the iPSC/860.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  686--693. IEEE Computer Society, 1994.
<P>
<DT><A NAME=IOPool><STRONG>229</STRONG></A><DD>
J. Pool et al.
 Survey of I/O intensive applications.
 Technical Report CCSF-38, CCSF, California Institute of Technology,
  1994.
<P>
<DT><A NAME=Pothen><STRONG>230</STRONG></A><DD>
A. Pothen, H. Simon, and K. Liou.
 Partitioning sparse matrices with eigenvectors of graphs.
 <em> SIAM J. Mat. Anal. Appl.</em>, 11(3):430--452, 1990.
<P>
<DT><A NAME=Pou86><STRONG>231</STRONG></A><DD>
D. Pountain.
 <em> A Tutorial Introduction to OCCAM Programming</em>.
 INMOS Corporation, 1986.
<P>
<DT><A NAME=Pre87><STRONG>232</STRONG></A><DD>
A research and development strategy for high performance computing.
 Office of Science and Technology Policy, Executive Office of the
  President, 1987.
<P>
<DT><A NAME=Pre89><STRONG>233</STRONG></A><DD>
The federal high performance computing program.
 Office of Science and Technology Policy, Executive Office of the
  President, 1989.
<P>
<DT><A NAME=Quinn><STRONG>234</STRONG></A><DD>
M. Quinn.
 Analysis and implementation of branch-and-bound algorithms on a
  hypercube multicomputer.
 <em> IEEE Trans. Computs.</em>, C-39(3):384--387, 1990.
<P>
<DT><A NAME=Quinn94><STRONG>235</STRONG></A><DD>
M. Quinn.
 <em> Parallel Computing: Theory and Practice</em>.
 McGraw-Hill, 1994.
<P>
<DT><A NAME=QD84><STRONG>236</STRONG></A><DD>
M. Quinn and N. Deo.
 Parallel graph algorithms.
 <em> Computing Surveys</em>, 16(3):319--348, 1984.
<P>
<DT><A NAME=QD86><STRONG>237</STRONG></A><DD>
M. Quinn and N. Deo.
 An upper bound for the speedup of parallel best-bound
  branch-and-bound algorithms.
 <em> BIT</em>, 26(1):35--43, 1986.
<P>
<DT><A NAME=RS90><STRONG>238</STRONG></A><DD>
S. Ranka and S. Sahni.
 <em> Hypercube Algorithms for Image Processing and Pattern
  Recognition</em>.
 Springer-Verlag, 1990.
<P>
<DT><A NAME=Rao><STRONG>239</STRONG></A><DD>
V. Rao and V. Kumar.
 Parallel depth-first search, part I: Implementation.
 <em> Intl. J. of Parallel Programming</em>, 16(6):501--519, 1987.
<P>
<DT><A NAME=Reed1><STRONG>240</STRONG></A><DD>
D. A. Reed.
 Experimental Performance Analysis of Parallel Systems:
  Techniques and Open Problems.
 In <em> Proc. 7th Intl Conf. on Modeling Techniques and Tools for
  Computer Performance Evaluation</em>, 1994.
<P>
<DT><A NAME=Reed2><STRONG>241</STRONG></A><DD>
D. A. Reed, R. A. Aydt, R. J. Noe, P. C. Roth, K. A. Shields, B. W. Schwartz,
  and L. F. Tavera.
 Scalable Performance Analysis: The Pablo Performance
  Analysis Environment.
 In <em> Proc. Scalable Parallel Libraries Conf.</em>, pages 104--113.
  IEEE Computer Society, 1993.
<P>
<DT><A NAME=RF89><STRONG>242</STRONG></A><DD>
D. A. Reed and R. M. Fujimoto.
 <em> Multicomputer Networks: Message-Based Parallel Processing</em>.
 MIT Press, 1989.
<P>
<DT><A NAME=RS94><STRONG>243</STRONG></A><DD>
A. Reinefeld and V. Schnecke.