We present an efficient \(\theta(\log N)\) implementation of Batcher's odd-even merge on a SIMD hypercube. (The hypercube model assumes that all communications are restricted to one fixed dimension at a time.) The best previously known implementation of odd-even merge on a SIMD hypercube requires \(
Efficient mapping and implementation of matrix algorithms on a hypercube
โ Scribed by Vladimir Cherkassky; Ross Smith
- Publisher
- Springer US
- Year
- 1988
- Tongue
- English
- Weight
- 864 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, a novel and efยฎcient implementation of the marching cubes (MC) algorithm is presented for the reconstruction of anatomical structures from real three-dimensional medical data. The proposed approach is based on a generic rule, able to triangulate all 15 standard cube conยฎgurations used
Previous studies by the authors and their co-workers show that the structure of equations representing shape Memory Alloy (SMA) constitutive behaviour can be very similar to those of rate-independent plasticity models. For example, the Boyd-Lagoudas polynomial hardening model has a stress-elastic st
In this paper, we improve the multi-dimensional THINC (tangent of hyperbola for interface capturing) scheme [F. Xiao, Y. Honma, T. Kono, A simple algebraic interface capturing scheme using hyperbolic tangent function, Int. J. Numer. Meth. Fluid. 48 (2005) 1023]. The THINC scheme is a VOF (volume of