This dissertation examines the performance of genetic algorithm (GA) hybrids that use local
search to solve global optimization problems. GAs are a class of adaptive global sampling …

We discuss inverse spacefilling partitioning (ISP), a partitioning strategy for non-uniform
scientific computations running on distributed memory MIMD parallel computers. We …

Numerical simulation promises new insight in science and engineering. In ad dition to the
traditional ways to perform research in science, that is laboratory experiments and …

Balanced partitioning of non-uniform data in a high dimensional space is much more di cult
than partitioning the non-uniform data projected onto a line. For dynamic problems which …

The goal of producing architecture-independent parallel programs is complicated by the
competing need for high performance. The ZPL programming language achieves both goals …

In adaptive irregular problems, data arrays are accessed via indirection arrays, and data
access patterns change during computation. Parallelizing such problems on distributed …

The problem of simulating the hydrodynamics and the acoustic waves inside wind musical
instruments such as the recorder, the organ, and the flute is considered. The problem is …

Examines the effects of relaxed synchronization on both the numerical and parallel
efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically …

Adaptive hp finite element methods (FEM), in which both grid size h and local polynomial
order p are dynamically altered, generate computations that require dynamic and irregular …

In this paper, we propose a topological metaphor for computations: computing consists in
moving through a path in a data space and making some elementary computations along …