http:^^www.cs.washington.edu^research^projects^zpl^intro^overview.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 352 行 · 第 1/2 页

to make decisions based on how the program will be executed, but to be
machine independent (portable) the programmer must avoid reliance on any
particular machine facilities.  The relationships of this approach to others
have been described [Snyder95], and feasibility studies indicate that the
approach works [Lin92].</p>

<p>The Phase Abstractions programming model recognizes three different
"programming levels":</p>

<ul>
<li>Process or "X" level -- a composition of instructions,</li>
<li>Phase or "Y" level -- a composition of processes into a parallel 
                        algorithm,</li>
<li>Problem or "Z" level -- a composition of phases to solve the overall 
                          application.</li>
</ul>

<p>The letter name of this highest, problem solving programming level
motivates the language's name.</p>

<p><i>Learning the Language</i>.  A simple introduction of some of the basic
ZPL concepts is available online as a <!WA4><!WA4><!WA4><!WA4><a
href="http://www.cs.washington.edu/research/projects/zpl/walk-through/">Walk-through</a> of a ZPL program.  A tutorial
introduction to programming in ZPL is available as the ZPL Programmer's
Guide.  The ZPL Language Manual defines the language specifics.  Sample
programs and scientific research papers are also available.</p>

<p><i>Writing Your First Program</i>.  Perhaps the simplest way to write and
run a ZPL program on YOUR Unix machine is to use the <!WA5><!WA5><!WA5><!WA5><a
href="http://www.cs.washington.edu/research/projects/zpl/web-compiler">Web Compiler</a>.  You paste a ZPL program (your own or
one of ours) into a window, and click "compile." The program is packaged up
and sent to a machine at the UW CSE Department.  It is compiled into ANSI C
and returned to you.  A "make" of this file will result in an executable that
can be run on your sequential computer.</p>

<p><i>Parallel Use of ZPL</i>.  To run on a parallel computer ZPL must first
be targeted to that parallel computer.  This is an operation that is
typically NOT performed by ZPL applications programmers, but is
straightforward for parallel computer systems administrators.  The present
platforms on which ZPL runs are

<ul>
<li>Intel Paragon</li>
<li>Cray Research T3D</li>
<li>Kendal Square Research KSR-2</li>
<li>PVM running on a scientific workstation</li>
<li>Sequential Unix platforms.</li>
</ul>

For information on targeting to a new platform, click here.</p>

<p>Once ZPL has been targeted to your type of parallel computer and the
libraries installed at your facility, you are ready to use ZPL in parallel.
It is NOT necessary to install the ZPL compiler on your workstation, because
for the near term all ZPL compilation will be performed at the University of
Washington.  This is to assist in rapidly disseminating compiler improvements
to the user community.  (You can't have a stale version of the compiler!)
However, we provide some software that you WILL want to install on your
workstation which will simplify this remote compilation, and give you the
convenience similar to compiling locally.</p>

<p>To learn more about running ZPL in parallel, click here.</p>

<hr>

<h2>ZPL Fact Sheet</h2>

<p><b>Name</b>.  ZPL is short for the Z (level) Programming Language; see
discussion of programming model, above.</p>

<p><b>Origin</b>.  ZPL was designed and implemented by the Orca Project of
the Computer Science and Engineering Department at the University of
Washington.</p>

<p><b>Type</b>.  ZPL uses the array abstraction to implement a dataparallel
programming model; it is a standalone subset of Advanced ZPL.</p>

<p><b>History</b>.  Implementation of the ZPL compiler began in March 1993.
It generated code approximately 15 months later.  ZPL will be officially
"released" during the fourth quarter, 1995.</p>

<p><b>Approach</b>.  ZPL is translated into a conventional abstract syntax
tree representation on which program analysis and optimizations are
performed.  ANSI C code is generated as the object code.  This C program is
machine independent, and implements certain operations in abstract form.
This code is compiled using the native C compiler on the target machine with
custom libraries.  In this second compilation the abstract operations are
customized to the specific platform.  </p>

<p><b>Team</b>.  The creators of ZPL are: Brad Chamberlain, Sung-Eun Choi,
Marios Dikaiakos, George Forman, E Christopher Lewis, Calvin Lin, Larry
Snyder, and W. Derrick Weathersby with assistance from Ruth Anderson and Kurt
Partridge.</p>

<p><b>Funding</b>.  The foundational research for the ZPL compiler was funded
in part by the Office of Naval Research N00014-89-J-1368.  The compiler
itself was funded in part by the Advanced Research Projects Agency,
N00014-92-J-1824.</p>

<hr>

<h2>References</h2>

<p>[Dikaiakos] M.D. Dikaiakos, C. Lin, D. Manoussaki and D. Woodward.  "The
Portable Parallel Implementation of Two Novel Mathematical Biology Algorithms
in ZPL," <em> the 9th Int'l Conference on Supercomputing, </em> pp. 365-374,
1995.</p>

<p>[Gannon] D. Gannon and J. Panetta, "Restructuring Simple for the CHiP
Architecture," <i>Parallel Computing,</i> 3:305-326, 1986 </p>

<p>[Greenlaw90] R. Greenlaw and L. Snyder, "Achieving Speedups for APL on an
SIMD Distributed Memory Machine," <i>Int'l J. of Parallel Programming,</i>
19(2):111-117, 1990 </p>

<p>[Griswold90] W. G. Griswold, G. A. Harrison, D. Notkin, and L. Snyder,
"Scalable Abstractions for Parallel Programming," <i>Proc. 5th Distributed
Memory Computer Conference,</i> IEEE, pp. 1008-1016, 1990</p>

<p>[Lee92] J. Lee, C. Lin and L. Snyder, "Programming SIMPLE for Parallel
Portability," <i>Languages and Compilers for Parallel Computing</i>, Uptal
Banerjee, David Gelernter, Alexamdru Nicolau and David Padua, eds, pp. 84-98,
1992.</p>

<p>[Lewis] E. Lewis, C. Lin, L. Snyder and G. Turkiyyah.  "A Portable
Parallel N-Body Solver,"<em> the 7th SIAM Conference on Parallel Processing
for Scientific Computing</em> pp.  331-336. 1995.</p>

<p>[Lin92] C. Lin, <i>The portability of parallel programs across MIMD
computers</i>, Ph.D. Dissertation, University of Washington, 1992.</p>

<p>[Lin90] C. Lin and L. Snyder, "A comparison of programming models for
shared memory multiprocessors," <i>Proceedings of the International
Conference on Parallel Processing,</i> pp. II 163-180, 1990.</p>

<p>[Lin94] C. Lin and L. Snyder, "SIMPLE Performance Results in ZPL,"
<i>Languages and Compilers for Parallel Computing</i>, K. Pingali, U.
Banerjee, D. Gelernter, A. Nicolau, and D. Padua, eds, pp. 361-375, 1994.</p>

<p><!WA6><!WA6><!WA6><!WA6><a
href="http://www.cs.washington.edu:80/research/projects/zpl/papers/abstracts/hpf.html">[Lin95]</a>
C. Lin, L. Snyder, R. Anderson, B. Chamberlain, S. Choi, G. Forman, E.
Lewis, and W. D. Weathersby.  <i>ZPL vs. HPF: A Comparison of Performance and
Programming Style</i>, CSE Technical Report, University of Washington, 1994.

<p>[Snyder94] L. Snyder, "Foundations of Practical Parallel Programming
Languages," in J. Ferrante and A. J. G Hey (eds.), <i>Portability and
performance for parallel processing,</i> John Wiley and Sons, Ltd., pp. 1-19,
1994.<p>

<p>[Snyder86] L. Snyder.  "Type Architecture, Shared Memory and the Corollary
of Modest Potential," <em> Annual Review of Computer Science, </em> pp.
1:289-317. 1986.</p>

<p>[Snyder95]L. Snyder, "Experimental Validation of Models of Parallel
Computation," in A. Hofmann and J. van Leeuwen, <i>Lecture Notes in Computers
Science</i>, V. 1000, Springer-Verlag, 1995.  </p>


</body>
<p> 
<inc srv "/research/projects/zpl/footer.html">
<hr> <p>
<center>
[
<!WA7><!WA7><!WA7><!WA7><a href="http://www.cs.washington.edu/research/projects/zpl/">ZPL</a> | 
<!WA8><!WA8><!WA8><!WA8><a href="http://www.cs.washington.edu/">UW CSE</a> |
<!WA9><!WA9><!WA9><!WA9><a href="http://www.cac.washington.edu:1183/">UW</a>
]
<address>
<!WA10><!WA10><!WA10><!WA10><A HREF="mailto:[e-mail]">[e-mail]</a>
</address>
</center>

</html>