📄 http:^^www.cs.washington.edu^research^projects^zpl^papers^
字号:
Date: Tue, 10 Dec 1996 03:29:08 GMTServer: NCSA/1.4.2Content-type: text/html<html><head> <title>ZPL Papers and Manuals</title></head><body><h1><!WA0><!WA0><!WA0><!WA0><img align=center src="http://www.cs.washington.edu/research/projects/zpl/images/zpl.logo.gif"> <a name="top">ZPL Papers and Manuals</a></h1><hr><h3>ZPL-specific Papers and manuals</h3><h4>Language Description Papers</h4><dl><dl><dt><!WA1><!WA1><!WA1><!WA1><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/zpl.html">ZPL: An Array Sublanguage</a> (August, 1993)<dd>Introduction to the ZPL language. Very old and somewhat out of date.<p><dt><!WA2><!WA2><!WA2><!WA2><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/guide.html">A ZPL Programming Guide</a> (July, 1996)<dd> An intuitive introduction to the language that walks through severalscientific programming examples. <p><dt><!WA3><!WA3><!WA3><!WA3><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/manual.html">ZPL Language Reference Manual (DRAFT)</a> (June, 1996)<dd>The most complete description of the language (includes an index).</dl></dl><h4>Implementation Papers</h4><dl><dl><dt><!WA4><!WA4><!WA4><!WA4><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/factor-join.html">Factor-Join: A Unique Approach to Compiling Array Languages for Parallel Machines</a> (May 1996)<dd>A framework for compiling array languages.<p><dt><!WA5><!WA5><!WA5><!WA5><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/compiler.html">The Implementation of a Machine-Independent Array Language</a> (November, 1995)<dd>Implementation of ZPL.</dl></dl><h4>Benchmark Performance Evaluation Papers</h4><dl><dl><p><dt><!WA6><!WA6><!WA6><!WA6><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/hpf.html">ZPL vs. HPF: A Comparison of Performance and Programming Style</a> (May, 1995)<dd>Compares ZPL and HPF using a set of NAS, NASA and GENESIS benchmark programs.<p><dt><!WA7><!WA7><!WA7><!WA7><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/perf.html">SIMPLE Performance Results in ZPL</a> (August, 1994)<dd>Performance comparisons against hand-coded programs.</dl></dl><h4>Real-world Applications of ZPL</h4><dl><dl><p><dt><!WA8><!WA8><!WA8><!WA8><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/siam.html">A Portable Parallel N-Body Solver</a> (1995)<dd> Describes how ZPL is used to solve n-body solver.<p><dt><!WA9><!WA9><!WA9><!WA9><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/ics.html">The Portable Parallel Implementation of Two Novel Mathematical BiologyAlgorithms in ZPL</a> (July, 1995)<dd> Describes how ZPL is used to solve two mathematical biology problems.</dl></dl><hr><h3> Foundations of ZPL</h3><h4> Machine Model Papers </h4><p><dl><dl><dt><!WA10><!WA10><!WA10><!WA10><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/cta.html">Type Architecture, Shared Memory and the Corollary of Modest Potential</a> (1986)<dd> Discusses the need for accurate abstract machine models when developing efficient algorithms. Introduces the CTA abstract machine model.<p></dl></dl><h4>Programming models -- shared- vs. nonshared-memory models</h4><dl><dl><dt><!WA11><!WA11><!WA11><!WA11><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/icpp.html">A Comparison of Programming Models for Shared Memory Multiprocessors</a> (1990)<dd> Empirical comparison of how the shared memory and non-shared memoryprogramming models effect the performance of programs on shared memorymultiprocessors.<p><dt><!WA12><!WA12><!WA12><!WA12><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/compare.html">A Comparison of Shared and Nonshared Memory Models of Parallel Computation</a> (1991)<dd> Theoretical comparison of the shared memory and non-shared memoryprogramming models and their influence on parallel algorithm performance.<p><dt><!WA13><!WA13><!WA13><!WA13><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/tango.html">On the Influence of Programming Models on Shared Memory Computer Performance</a> (1992)<dd> Experimental comparsion of shared memory and non-shared memory programmingmodels for three machines and two applications (LU decomposition and WATER).<p></dl></dl><h4>Programming models -- Abstractions and A-ZPL (formerly Orca C)</h4><dl><dl><dt><!WA14><!WA14><!WA14><!WA14><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/scalable.html">Scalable Abstractions for Parallel Programming</a> (1990)<dd> Introduces the notion of <em>ensembles</em> that provides scalability.<p><dt><!WA15><!WA15><!WA15><!WA15><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/flexible.html">A Flexible Communication Abstraction for Nonshared Memory Parallel Computing</a> (November, 1990)<dd> Introduces the notion of <em>port ensembles</em> that separates the specification of communication from computation.<p><dt><!WA16><!WA16><!WA16><!WA16><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/pa.html">Abstractions for Portable, Scalable Parallel Programming</a> (December, 1993)<dd> Extensive discussion of the Phase Abstractions programming model.<p><dt><!WA17><!WA17><!WA17><!WA17><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/foundations.html">Foundations of Practical Parallel Programming Languages </a> (1993)<dd> Describes the relation between ZPL and Orca C, and describes the underlyingmodels for these languages.<p><dt><!WA18><!WA18><!WA18><!WA18><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/magnum.html">A Portable Implementation of SIMPLE</a> (1991)<dd> Detailed description of how the SIMPLE CFD benchmark is written in Orca C.</dl></dl><h4>Optimized Interprocessor Communication</h4><dl><dl><p><dt><!WA19><!WA19><!WA19><!WA19><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/comm.html">Quantifying the Effects of Communication Optimizations</a> (May 1996)<dd>An evaluation of communication optimizations.<p><dt><!WA20><!WA20><!WA20><!WA20><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/ironman.html">IRONMAN: An Architecture Independent Communication Interface for Parallel Computers</a> (March 1996)<dd>A machine-independent interface for custom interprocessor communication.</dl></dl><h4>Miscellany</h4><dl><dl><p><dt><!WA21><!WA21><!WA21><!WA21><a href="http://www.cs.washington.edu/research/projects/zpl/papers/abstracts/ipps.html">Accommodating Polymorphic Data Decompositions in Explicitly ParallelPrograms</a> (April, 1994)<dd> Why message passing libraries alone are not sufficient for portability.</dl></dl></body><p> <inc srv "/research/projects/zpl/footer.html"><hr> <p><center>[<!WA22><!WA22><!WA22><!WA22><a href="http://www.cs.washington.edu/research/projects/zpl/">ZPL</a> | <!WA23><!WA23><!WA23><!WA23><a href="http://www.cs.washington.edu/">UW CSE</a> |<!WA24><!WA24><!WA24><!WA24><a href="http://www.cac.washington.edu:1183/">UW</a>]<address><!WA25><!WA25><!WA25><!WA25><A HREF="mailto:zpl-info@cs.washington.edu">zpl-info@cs.washington.edu</a></address></center></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -