Zobrazeno 1 - 10
of 12
pro vyhledávání: '"S. L. Johnsson"'
Autor:
S. L. Johnsson, C.-T. Ho
Publikováno v:
IBM Journal of Research and Development. 38:31-46
Hyper-pyramids contain pyramids as proper subgraphs. We show that a P(k.d) hyper-pyramid can be embedded in a Boolean cube with minimal expansion and dilation. In addition to expansion, dilation, and congestion we also characterize the embedding with
Autor:
Dragan Mirkovic, S. L. Johnsson
The main accomplishments during this grant period are in the following areas: (1) Fast parallel algorithms for Legendre and spherical transforms. The accomplishments in this area effectively break down into two subareas, namely: (a) Development of fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e10d68e6df77fe2753cf7a3179c42dca
https://doi.org/10.21236/ada387330
https://doi.org/10.21236/ada387330
Autor:
S. L. Johnsson
During the contract period our main results are a computer code for fast parallel algorithms for particle systems interacting with long range forces, analysis of the error characteristics of the chosen method, and a parallel implementation of a O(N l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5db21c6e74ed4bc58bbaa349c79ff5e1
https://doi.org/10.21236/ada311016
https://doi.org/10.21236/ada311016
Publikováno v:
Concurrency: Practice and Experience. 1:219-237
One data-independent and one data-dependent algorithm for the computation of image histograms on parallel computers are presented, analysed and implemented on the Connection Machine system CM-2. The data-dependent algorithm has a lower requirement on
Autor:
S. L. Johnsson, P. Olsson
Publikováno v:
SC
Explicit methods for the solution of fluid flow problems are of considerable interest in supercomputing. These methods parallelize well. The treatment of the boundaries is of particular interest both with respect to the numeric behavior of the soluti
Publikováno v:
SC
We describe a radix-2 FFT implementation on the Connection Machine. The FFT implementation pipelines successive FFT stages to make full use of the communication capability of the network interconnecting processors, when there are multiple elements as
Autor:
K. K. Mathur, S. L. Johnsson
Publikováno v:
SC
A data parallel formulation of the finite element method is described. The data structures and the algorithms for stiffness matrix generation and the solution of the equilibrium equations are presented briefly. The generation of the elemental stiffne
Publikováno v:
Proceedings of the third conference on Hypercube concurrent computers and applications.
Physicists believe that the world is described in terms of gauge theories. A popular technique for investigating these theories is to discretize them onto a lattice and simulate numerically by a computer, yielding so-called lattice gauge theory. Such
Publikováno v:
SC
A data parallel implementation of the multiplication of matrices of arbitrary shapes and sizes is presented. A systolic algorithm based on a rectangular processor layout is used by the implementation. All processors contain submatrices of the same si