๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New Jacobi-sets for parallel computations

โœ Scribed by M Mantharam; P.J Eberlein

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
929 KB
Volume
19
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Ring Ordering Algorithm for E
A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations
โœ B.B. Zhou; R.P. Brent ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 141 KB

In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. An efficient parallel ring Jacobi ordering for computing singular value decomposition is described. This ordering can generate n(n -1)/2 different index pairs

RCC-Full: An Effective Network for Paral
RCC-Full: An Effective Network for Parallel Computations
โœ Mounir Hamdi; Richard W. Hall ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 484 KB

A new interconnection network is proposed for the construction of a massively parallel computer system. The systematic construction of this interconnection network, denoted RCC-FULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully interco