In this paper we present fast parallel algorithms for remapping a class of irregular and adaptive problems on coarse-grained distributed memory machines. We show that the remapping of these applications, using simple index-based mapping algorithm, can be reduced to sorting a nearly sorted list of integers or merging an unsorted list of integers with a sorted list of integers. By using the algor...

This paper presents the algorithms for cmvsim, a program for performing the transient simulation of grid based analog signal processors on a massively parallel computer. A grid-based equation formulation approach and a block-diagonal preconditioned CGS algorithm are described, and it is shown how they are used to eeciently perform transient simulation using the massively parallel Connection Mac...

In this paper, we present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An e cient formulation of tree search on a SIMD machine comprises of two major components: (i) a triggering mechanism, which determines when the search space redistribution must occur to balance search space ove...

Multi-stage stochastic programs are typically extremely large, and can be prohibitively expensive to solve on the computer. In this paper we develop an algorithm for multistage programs that integrates the primal-dual row-action framework with prox-imal minimization. The algorithm exploits the structure of stochastic programs with network recourse, using a suitable problem formulation based on ...

We present experimental results for parallelizing two breadth-rst search-based applications on Thinking Machine's CM-5 by using two diierent message-passing paradigms, one based on send/receive and the other based on active messages. The parallelization of these applications requires ne-grained communication. Our results show that the active messages-based implementation gives signiicant improv...

This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume renderer use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 MPP.

In this paper I describe and extend a new DNA computing paradigm introduced in Blumberg [4] for building massively parallel machines in the DNA-computing models described by Adelman [1, 2], Cai et. al.[5], and Liu et. al.[8]. Employing only DNA operations which have been reported as successfully performed, I present an implementation of a Connection Machine [7], a SIMD (single-instruction multi...

In this paper, we study the classical problem of preprocessing a set of points to answer nearest neighbor queries on a large spatial database, assuming a coarse grained parallel processor is available. We implement a known randomized prepro-cessing scheme which can answer these nearest neighbor queries very fast on such a machine. We present some practical performance results of our preliminary...

This paper demonstrates that scalability and competitive eeciency can be achieved for unstructured grid nite element applications on distributed memory machines, such as the Connection Machine CM-5 system. The eeciency of nite element solvers is analyzed through two applications: an implicit computational aerodynamics application and an explicit solid mechanics application. Scalability of mesh ...

Dontjc. T.. Th. Lippert. N. Petkm and K Schilling. Statistical anabsis of simulation-generated time s,.,ries: Systolic vs. semi-s~,stolic correlation on the (~nnection Machine. Parallel Computing 18 (1992) 575-588. Autocorrelalion becomes an increasingl.v importan~ t~)l to verify imprm*ements in the state of the simulational ~rt in Latice Gauge Theory'..%mi-s.vstolic and full-~stolic algorithms...