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

Mobile Jacobi schemes for parallel computation

โœ Scribed by J.J. Modi; J.D. Pryce

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
360 KB
Volume
12
Category
Article
ISSN
0898-1221

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

A mobility-aware dynamic database cachin
A mobility-aware dynamic database caching scheme for wireless mobile computing and communications
โœ George Y. Liu; Gerald Q. Maguire ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 990 KB

This paper describes a mobility-aware dynamic database caching scheme for wireless mobile computing and communications. A mobile-floating agent scheme is proposed, in which caching techniques are cognizant of the mobile nature of mobile users and the location-sensitive nature of mobile systems. The