Nor M lt always easy to assess the relevance of a new result to a particular problem.
Furthermore, changes in parallel computing technology have made some of the earlier work …

This paper describes a number of optimizations that can be used to support the efficient
execution of irregular problems on distributed memory parallel machines. These primitives …

We consider optimizations that are required for efficient execution of code segments that
consist of loops over distributed data structures. The PARTI execution time primitives are …

The performance of the Intel iPSC/860 hypercube and the Ncube 6400 hypercube are
compared with earlier hypercubes from Intel and Ncube. Computation and communication …

The complete exchange ('all-to-all personalized') communication pattern is at the heart of
numerous important multicomputer algorithms. Recent research has shown how this pattern …

Run‐time preprocessing plays a major role in many efficient algorithms in computer science,
as well as playing an important role in exploiting multiprocessor architectures. We give …

In this paper we present three broadcast algorithms and lower bounds on the three main
components of the broadcast time for 2-dimensional torus networks (wrap-around meshes) …

In compiling applications for distributed memory machines, runtime analysis is required
when data to be communicated cannot be determined at compile-time. One such class of …

Iteration space tiling is a common strategy used by parallelizing compilers and in
performance tuning of parallel codes. We address the problem of determining the tile size …

We propose a new efficient method to detect ellipses in binary or gray-scale images, called
restricted randomized Hough transform (RRHT). The key of RRHT is to restrict the scope of …