Three paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scienti c computation | a nonlinear, structured-grid partial di erential equation boundary value problem | using the same algorithm on the same hardware. All of the paradigms | parallel languages represented by the Portland Group's HPF, (semi-)automated serial-to-parallel source-tosource translation represented by CAPTools from the University of Greenwich, and parallel libraries represented by Argonne's PETSc | are found to be easy to use for this problem class, and all are reasonably e ective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under any paradigm includes speci cation of the data partitioning, corresponding to a geometrically simple decomposition of the domain of the PDE. Programming in SPMD style for the PETSc library requires writing only the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (a ne global-to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm as a starting point, introduction of concurrency through subdomain blocking (a task similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Programming with CAPTools involves feeding the same sequential implementation to the CAPTools interactive parallelization system, and guiding the source-to-source code transformation by responding to various queries about quantities knowable only at runtime. Results representative of \the state of the practice" for a scaled sequence of structured grid problems are given on three of the most important contemporary high-performance platforms: the IBM SP, the SGI Origin 2000, and the CRAY T3E.