PARED - Parallel Adaptive Unstructured Computation
PARED is an object oriented system for the adaptive solution of two- and three-dimensional PDEs on unstructured meshes in a distributed computing environment. PARED handles selective mesh refinement and coarsening, mesh repartitioning for load balancing, and interprocessor mesh migration, all under program control.
PARED runs on distributed memory parallel computers such as the IBM SP-2 and networks of workstations. Our design supports dynamically changing environment; elements and vertices (and the associated equations and unknowns) migrate between processors to balance the workload and references to remote elements and vertices are updated as new elements or vertices are created, deleted or moved to a new processor. Because of the flexible design used in PARED, at any time a numerical computation can be suspended and work reassigned to processors. Thus, PARED can easily react to variations in the underlying network topology and processor load. The complexity of this approach is hidden by the use of a global object space where remote object communication is facilitated by the use of proxies. Cached proxies are also used to reduce latency and communication overhead.
Adaptivity offers the potential to provide large increases in performance for problems with dissimilar physical scales by focusing the available computing power on the regions of high activity. Adaptation produces load imbalances among processors thereby creating the need for repartitioning the work load. Since adaptivity significantly increases the complexity of algorithms and software, new design techniques based on object-oriented technology are needed to cope with the complexity that arises.
PARED has been applied to the solution of a variety of problems including the Navier-Stokes equation in two and three dimensions.
Project status: Complete
Project Home Page: http://www.cs.brown.edu/people/jes/pared/home.html
Research Areas
| Parallel Computing |
People
| John E. Savage |
| Page Owner: Webmaster | Last Modified: Mon Oct 23 14:57:09 2006 |