WorldCat Identities

Johnsson, S. L.

Overview
Works: 16 works in 17 publications in 1 language and 17 library holdings
Roles: Author
Publication Timeline
.
Most widely held works by S. L Johnsson
Spanning balanced trees in Boolean cubes by Yale University( Book )

2 editions published between 1987 and 1988 in English and held by 2 WorldCat member libraries worldwide

The improvement in data transfer time over the familiar binomial tree routing is a factor of n/2 for concurrent communication on all ports and one-to-all personalized communication and all-to-all broadcasting. For all-to-all personalized communication on all ports concurrently, the improvement is of order O([square root n]). Distributed routing algorithms defining the spanning balanced n-tree are given. The balanced n-tree is not unique, and a few definitions of n-trees that are effectively edge-disjoint are provided. Some implementation issues are also discussed. Binary numbers obtained from each other through rotation form necklaces that are full if the period is equal to the length of the number; otherwise, they are degenerate
Generation of layouts from circuit schematics : a graph theoretic approach by T Ng( Book )

1 edition published in 1985 in English and held by 1 WorldCat member library worldwide

Matrix multiplication on hypercubes using full bandwidth and constant storage by Chi-Tang Ho( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

Matrix multiplication on Boolean cubes using generic communication primitives by Yale University( Book )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

Binary cube emulation of butterfly networks encoded by Gray code by Thomas J. Watson IBM Research Center( Book )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

Multiplication of arbitrarily shaped matrices on boolean cubes using the full communications bandwidth by Yale University( Book )

1 edition published in 1989 in English and held by 1 WorldCat member library worldwide

Band matrix systems solvers on ensemble architectures by S. L Johnsson( Book )

1 edition published in 1985 in English and held by 1 WorldCat member library worldwide

Distributed RC delay line model and MOS PLA timing estimation by Yale University( Book )

1 edition published in 1989 in English and held by 1 WorldCat member library worldwide

A data parallel finite element method for computational fluid dynamics on the connection machine system by Harvard University( Book )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

Performance comparisons are also carried out with the vector computers Cray Y-MP and Convex C-1."
Matrix transposition on Boolean n-cube configured ensemble architectures by Yale University( Book )

1 edition published in 1986 in English and held by 1 WorldCat member library worldwide

QED on the connection machine by Yale University( Book )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

Optimal algorithms for stable dimension permutations on boolean cubes by Yale University( Book )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

Multiple tridiagonal systems, the alternating direction methods and boolean cube configured multiprocessors by Yale University( Book )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

Directions in high performance computations by Yale University( Book )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

Algorithms for matrix transposition on boolean n-cube configured ensemble architectures by Yale University( Book )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

Efficient Load Balance & Locality of Reference for Unstructured Grid & Particle Simulations on Massively Parallel Processors( )

1 edition published in 1995 in English and held by 0 WorldCat member libraries worldwide

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 log(2 over 2) N) algorithm for Legendre and Spherical transforms. We have also derived an algebraic framework for describing permutations frequently used in scientific computation. The framework allows for a rigorous analysis of the communication requirements of parallel algorithms and is also very useful in address computations during compilation or in run time systems. For efficient data motion, or remote references, we have also further validated the potential benefits of ROMM routing
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.69 for Distribute ... to 0.99 for Efficient ...)

Languages
English (17)