5,987 research outputs found
Synthesis, structure and power of systolic computations
AbstractA variety of problems related to systolic architectures, systems, models and computations are discussed. The emphases are on theoretical problems of a broader interest. Main motivations and interesting/important applications are also presented. The first part is devoted to problems related to synthesis, transformations and simulations of systolic systems and architectures. In the second part, the power and structure of tree and linear array computations are studied in detail. The goal is to survey main research directions, problems, methods and techniques in not too formal a way
FFT for the APE Parallel Computer
We present a parallel FFT algorithm for SIMD systems following the `Transpose
Algorithm' approach. The method is based on the assignment of the data field
onto a 1-dimensional ring of systolic cells. The systolic array can be
universally mapped onto any parallel system. In particular for systems with
next-neighbour connectivity our method has the potential to improve the
efficiency of matrix transposition by use of hyper-systolic communication. We
have realized a scalable parallel FFT on the APE100/Quadrics massively parallel
computer, where our implementation is part of a 2-dimensional hydrodynamics
code for turbulence studies. A possible generalization to 4-dimensional FFT is
presented, having in mind QCD applications.Comment: 17 pages, 13 figures, figures include
Systolic and Hyper-Systolic Algorithms for the Gravitational N-Body Problem, with an Application to Brownian Motion
A systolic algorithm rhythmically computes and passes data through a network
of processors. We investigate the performance of systolic algorithms for
implementing the gravitational N-body problem on distributed-memory computers.
Systolic algorithms minimize memory requirements by distributing the particles
between processors. We show that the performance of systolic routines can be
greatly enhanced by the use of non-blocking communication, which allows
particle coordinates to be communicated at the same time that force
calculations are being carried out. Hyper-systolic algorithms reduce the
communication complexity at the expense of increased memory demands. As an
example of an application requiring large N, we use the systolic algorithm to
carry out direct-summation simulations using 10^6 particles of the Brownian
motion of the supermassive black hole at the center of the Milky Way galaxy. We
predict a 3D random velocity of 0.4 km/s for the black hole.Comment: 33 pages, 10 postscript figure
Systolic geometry of translation surfaces
Let be a translation surface of genus with cone points
with cone angle at , where
. In this paper we investigate the systolic landscape of
these translation surfaces for fixed genus.Comment: 25 pages, 4 figures. Added explicit computations of systoles in the
graph of saddle connections for origamis in H(1,1) and a criterion to decide
whether such systoles define systoles on the translation surfac
- …