node132.html

Design and building parallel program

 Work-load balancing in highly parallel depth-first search.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  773--780. IEEE Computer Society, 1994.
<P>
<DT><A NAME=Ries><STRONG>244</STRONG></A><DD>
B. Ries, R. Anderson, W. Auld, D. Breazeal, K. Callaghan, E. Richards, and
  W. Smith.
 The Paragon performance monitoring environment.
 In <em> Proc. Supercomputing '93</em>, pages 850--859. IEEE Computer
  Society, 1993.
<P>
<DT><A NAME=RP89><STRONG>245</STRONG></A><DD>
A. Rogers and K. Pingali.
 Process decomposition through locality of reference.
 In <em> Proc. SIGPLAN '89 Conf. on Program Language Design and
  Implementation</em>. ACM, 1989.
<P>
<DT><A NAME=RICN88><STRONG>246</STRONG></A><DD>
K. Rokusawa, N. Ichiyoshi, T. Chikayama, and H. Nakashima.
 An efficient termination detection and abortion algorithm for
  distributed processing systems.
 In <em> Proc. 1988 Intl. Conf. on Parallel Processing: Vol. I</em>,
  pages 18--22, 1988.
<P>
<DT><A NAME=RSW90><STRONG>247</STRONG></A><DD>
M. Rosing, R. B. Schnabel, and R. P. Weaver.
 The DINO parallel programming language.
 Technical Report CU-CS-501-90, Computer Science Department,
  University of Colorado at Boulder, Boulder, Col., 1990.
<P>
<DT><A NAME=SS88><STRONG>248</STRONG></A><DD>
Y. Saad and M. H. Schultz.
 Topological properties of hypercubes.
 <em> IEEE Trans. Computs.</em>, C-37:867--872, 1988.
<P>
<DT><A NAME=SS89><STRONG>249</STRONG></A><DD>
Y. Saad and M. H. Schultz.
 Data communication in hypercubes.
 <em> J. Parallel and Distributed Computing</em>, 6:115--135, 1989.
<P>
<DT><A NAME=SE87><STRONG>250</STRONG></A><DD>
P. Sadayappan and F. Ercal.
 Nearest-neighbor mapping of finite element graphs onto processor
  meshes.
 <em> IEEE Trans. Computs.</em>, C-36(12):1408--1424, 1987.
<P>
<DT><A NAME=Saltz2><STRONG>251</STRONG></A><DD>
J. Saltz, H. Berryman, and J. Wu.
 Multiprocessors and runtime compilation.
 <em> Concurrency: Practice and Experience</em>, 3(6):573--592, 1991.
<P>
<DT><A NAME=Schwartz><STRONG>252</STRONG></A><DD>
J. Schwartz.
 Ultracomputers.
 <em> ACM Trans. Program. Lang. Syst.</em>, 2(4):484--521, 1980.
<P>
<DT><A NAME=Seitz1><STRONG>253</STRONG></A><DD>
C. L. Seitz.
 Concurrent VLSI architectures.
 <em> IEEE Trans. Computs.</em>, C-33(12):1247--1265, 1984.
<P>
<DT><A NAME=Cosmic><STRONG>254</STRONG></A><DD>
C. L. Seitz.
 The cosmic cube.
 <em> Commun. ACM</em>, 28(1):22--33, 1985.
<P>
<DT><A NAME=Seitz><STRONG>255</STRONG></A><DD>
C. L. Seitz.
 Multicomputers.
 In C.A.R. Hoare, editor, <em> Developments in Concurrency and
  Communication</em>. Addison-Wesley, 1991.
<P>
<DT><A NAME=Shep><STRONG>256</STRONG></A><DD>
M. S. Shephard and M. K. Georges.
 Automatic three-dimensional mesh generation by the finite octree
  technique.
 <em> Int. J. Num. Meth. Engng.</em>, 32(4):709--749, 1991.
<P>
<DT><A NAME=SDR><STRONG>257</STRONG></A><DD>
J. Shoch, Y. Dalal, and D. Redell.
 Evolution of the Ethernet local computer network.
 <em> Computer</em>, 15(8):10--27, 1982.
<P>
<DT><A NAME=Simon><STRONG>258</STRONG></A><DD>
H. Simon.
 Partitioning of unstructured problems for parallel processing.
 <em> Computing Systems in Engineering</em>, 2(2/3):135--148, 1991.
<P>
<DT><A NAME=SHG93><STRONG>259</STRONG></A><DD>
J. Singh, J. L. Hennessy, and A. Gupta.
 Scaling parallel programs for multiprocessors: Methodology and
  examples.
 <em> IEEE Computer</em>, 26(7):42--50, 1993.
<P>
<DT><A NAME=Sin89><STRONG>260</STRONG></A><DD>
M. Singhal.
 Deadlock detection in distributed systems.
 <em> Computer</em>, 22(11):37--48, 1989.
<P>
<DT><A NAME=CCPPTut><STRONG>261</STRONG></A><DD>
P. Sivilotti and P. Carlin.
 A tutorial for CC++.
 Technical Report CS-TR-94-02, Caltech, 1994.
<P>
<DT><A NAME=Skj1><STRONG>262</STRONG></A><DD>
A. Skjellum.
 The Multicomputer Toolbox: Current and future directions.
 In <em> Proc. Scalable Parallel Libraries Conf.</em>, pages 94--103. IEEE
  Computer Society, 1993.
<P>
<DT><A NAME=slconf><STRONG>263</STRONG></A><DD>
A. Skjellum, editor.
 <em> Proc. 1993 Scalable Parallel Libraries Conf.</em>
 IEEE Computer Society, 1993.
<P>
<DT><A NAME=slconf2><STRONG>264</STRONG></A><DD>
A. Skjellum, editor.
 <em> Proc. 1994 Scalable Parallel Libraries Conf.</em>
 IEEE Computer Society, 1994.
<P>
<DT><A NAME=Skj2><STRONG>265</STRONG></A><DD>
A. Skjellum, N. Doss, and P. Bangalore.
 Writing libraries in MPI.
 In <em> Proc. Scalable Parallel Libraries Conf.</em>, pages 166--173.
  IEEE Computer Society, 1993.
<P>
<DT><A NAME=zipcode><STRONG>266</STRONG></A><DD>
A. Skjellum, S. Smith, N. Doss, A. Leung, and M. Morari.
 The design and evolution of Zipcode.
 <em> Parallel Computing</em>, 20:565--596, 1994.
<P>
<DT><A NAME=Smi93><STRONG>267</STRONG></A><DD>
J. R. Smith.
 <em> The Design and Analysis of Parallel Algorithms</em>.
 Oxford University Press, 1993.
<P>
<DT><A NAME=Snyder><STRONG>268</STRONG></A><DD>
L. Snyder.
 Type architectures, shared memory, and the corollary of modest
  potential.
 <em> Ann. Rev. Comput. Sci.</em>, 1:289--317, 1986.
<P>
<DT><A NAME=Sto93><STRONG>269</STRONG></A><DD>
H. S. Stone.
 <em> High-Performance Computer Architectures</em>.
 Addison-Wesley, third edition, 1993.
<P>
<DT><A NAME=CPP2><STRONG>270</STRONG></A><DD>
B. Stroustrup.
 <em> The C++ Programming Language</em>.
 Addison-Wesley, second edition, 1991.
<P>
<DT><A NAME=S94><STRONG>271</STRONG></A><DD>
C. Stunkel, D. Shea, D. Grice, P. Hochschild, and M. Tsao.
 The SP1 high-performance switch.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  150--157. IEEE Computer Society, 1994.
<P>
<DT><A NAME=SB90><STRONG>272</STRONG></A><DD>
R. Suaya and G. Birtwistle, editors.
 <em> VLSI and Parallel Computation</em>.
 Morgan Kaufmann, 1990.
<P>
<DT><A NAME=SSOGPPOPP93><STRONG>273</STRONG></A><DD>
J. Subhlok, J. Stichnoth, D. O'Hallaron, and T. Gross.
 Exploiting task and data parallelism on a multicomputer.
 In <em> Proc. 4th ACM SIGPLAN Symp. on Principles and Practice of
  Parallel Programming</em>. ACM, 1993.
<P>
<DT><A NAME=SN93><STRONG>274</STRONG></A><DD>
X.-H. Sun and L. M. Ni.
 Scalable problems and memory-bounded speedup.
 <em> J. Parallel and Distributed Computing</em>, 19(1):27--37, 1993.
<P>
<DT><A NAME=PVM1><STRONG>275</STRONG></A><DD>
V. Sunderam.
 PVM: A framework for parallel distributed computing.
 <em> Concurrency: Practice and Experience</em>, 2(4):315--339, 1990.
<P>
<DT><A NAME=Sup91><STRONG>276</STRONG></A><DD>
Supercomputer Systems Division, Intel Corporation.
 <em> Paragon XP/S Product Overview</em>, 1991.
<P>
<DT><A NAME=Swarz><STRONG>277</STRONG></A><DD>
P. Swarztrauber.
 Multiprocessor FFTs.
 <em> Parallel Computing</em>, 5:197--210, 1987.
<P>
<DT><A NAME=Tab91><STRONG>278</STRONG></A><DD>
D. Tabak.
 <em> Advanced Multiprocessors</em>.
 McGraw-Hill, 1991.
<P>
<DT><A NAME=TT85><STRONG>279</STRONG></A><DD>
A. Tantawi and D. Towsley.
 Optimal load balancing in distributed computer systems.
 <em> J. ACM</em>, 32(2):445--465, 1985.
<P>
<DT><A NAME=occam2><STRONG>280</STRONG></A><DD>
R. Taylor and P. Wilson.
 Process-oriented language meets demands of distributed processing.
 <em> Electronics</em>, Nov. 30, 1982.
<P>
<DT><A NAME=Thi90a><STRONG>281</STRONG></A><DD>
Thinking Machines Corporation.
 <em> The CM-2 Technical Summary</em>, 1990.
<P>
<DT><A NAME=CMF><STRONG>282</STRONG></A><DD>
Thinking Machines Corporation.
 <em> CM Fortran Reference Manual, version 2.1</em>, 1993.
<P>
<DT><A NAME=CMSSL><STRONG>283</STRONG></A><DD>
Thinking Machines Corporation.
 <em> CMSSL for CM Fortran Reference Manual, version 3.0</em>, 1993.
<P>
<DT><A NAME=TB86><STRONG>284</STRONG></A><DD>
A. Thomasian and P. F. Bay.
 Analytic queuing network models for parallel processing of task
  systems.
 <em> IEEE Trans. Computs.</em>, C-35(12):1045--1054, 1986.
<P>
<DT><A NAME=Tufte><STRONG>285</STRONG></A><DD>
E. Tufte.
 <em> The Visual Display of Quantitative Information</em>.
 Graphics Press, 1983.
<P>
<DT><A NAME=Ullman><STRONG>286</STRONG></A><DD>
J. Ullman.
 <em> Computational Aspects of VLSI</em>.
 Computer Science Press, 1984.
<P>
<DT><A NAME=DOE1><STRONG>287</STRONG></A><DD>
Building an advanced climate model: Program plan for the CHAMMP climate
  modeling program.
 U.S. Department of Energy, 1990.
 Available from National Technical Information Service, U.S. Dept of
  Commerce, 5285 Port Royal Rd, Springfield, VA 22161.
<P>
<DT><A NAME=Val90a><STRONG>288</STRONG></A><DD>
L. Valiant.
 A bridging model for parallel computation.
 <em> Commun. ACM</em>, 33(8):103--111, 1990.
<P>
<DT><A NAME=Geijn91><STRONG>289</STRONG></A><DD>
R. A. van de Geijn.
 Efficient global combine operations.
 In <em> Proc. 6th Distributed Memory Computing Conf.</em>, pages
  291--294. IEEE Computer Society, 1991.
<P>
<DT><A NAME=vdV><STRONG>290</STRONG></A><DD>
E. F. van de Velde.
 <em> Concurrent Scientific Computing</em>.
 Number 16 in Texts in Applied Mathematics. Springer-Verlag, 1994.
<P>
<DT><A NAME=Wal91><STRONG>291</STRONG></A><DD>
Y. Wallach.
 <em> Parallel Processing and Ada</em>.
 Prentice-Hall, 1991.
<P>
<DT><A NAME=Wash><STRONG>292</STRONG></A><DD>
W. Washington and C. Parkinson.
 <em> An Introduction to Three-Dimensional Climate Modeling</em>.
 University Science Books, 1986.
<P>
<DT><A NAME=Williams><STRONG>293</STRONG></A><DD>
R. Williams.
 Performance of dynamic load balancing algorithms for unstructured
  mesh calculations.
 <em> Concurrency: Practice and Experience</em>, 3(5):457--481, 1991.
<P>
<DT><A NAME=Wimer2><STRONG>294</STRONG></A><DD>
S. Wimer, I. Koren, and I. Cederbaum.
 Optimal aspect ratios of building blocks in VLSI.
 In <em> Proc. 25th ACM/IEEE Design Automation Conf.</em>, pages 66--72,
  1988.
<P>
<DT><A NAME=Wirth><STRONG>295</STRONG></A><DD>
N. Wirth.
 Program development by stepwise refinement.
 <em> Commun. ACM</em>, 14(4):221--227, 1971.
<P>
<DT><A NAME=Wol89><STRONG>296</STRONG></A><DD>
M. Wolfe.
 <em> Optimizing Supercompilers for Supercomputers</em>.
 MIT Press, 1989.
<P>
<DT><A NAME=Wor90><STRONG>297</STRONG></A><DD>
P. H. Worley.
 The effect of time constraints on scaled speedup.
 <em> SIAM J. Sci. and Stat. Computing</em>, 11(5):838--858, 1990.
<P>
<DT><A NAME=Wor91><STRONG>298</STRONG></A><DD>
P. H. Worley.
 Limits on parallelism in the numerical solution of linear PDEs.
 <em> SIAM J. Sci. and Stat. Computing</em>, 12(1):1--35, 1991.
<P>
<DT><A NAME=Worlton><STRONG>299</STRONG></A><DD>
J. Worlton.
 Characteristics of high-performance computers.
 In <em> Supercomputers: Directions in Technology and its
  Applications</em>, pages 21--50. National Academy Press, 1989.
<P>
<DT><A NAME=ansistandardF77><STRONG>300</STRONG></A><DD>
X3J3 Subcommittee.
 <em> American National Standard Programming Language Fortran
  (X3.9-1978)</em>.
 American National Standards Institute, 1978.
<P>
<DT><A NAME=AIMS><STRONG>301</STRONG></A><DD>
J. Yan, P. Hontalas, S. Listgarten, et al.
 The Automated Instrumentation and Monitoring System (AIMS)
  reference manual.
 NASA Technical Memorandum 108795, NASA Ames Research Center, Moffett
  Field, Calif., 1993.
<P>
<DT><A NAME=ZiBGSUPERB><STRONG>302</STRONG></A><DD>
H. Zima, H.-J. Bast, and M. Gerndt.
 SUPERB: A tool for semi-automatic MIMD/SIMD parallelization.
 <em> Parallel Computing</em>, 6:1--18, 1988.
<P>
<DT><A NAME=ZimaBook><STRONG>303</STRONG></A><DD>
H. Zima and B. Chapman.
 <em> Supercompilers for Parallel and Vector Computers</em>.
 Addison-Wesley, 1991.
</DL>
<P>
<HR>
<P><ADDRESS>
<I>&#169 Copyright 1995 by <A href="msgs0.htm#6" tppabs="http://www.dit.hcmut.edu.vn/books/system/par_anl/tppmsgs/msgs0.htm#6">Ian Foster</a></I>
</ADDRESS>
</BODY>