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

Multiprogramming a distributed-memory multiprocessor

โœ Scribed by Leuze, Michael R. ;Dowdy, Lawrence W. ;Park, Kee Hyun

Book ID
112068993
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
677 KB
Volume
1
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A preconditioned Conjugate Gradient Meth
A preconditioned Conjugate Gradient Method on a distributed memory multiprocessor
โœ R. Bru; C. Corral; J. Mas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

This paper discusses preconditioners for the Conjugate Gradient Method which are based on splittings of the system matrix. Conditions for the convergence are given, and particular splittings are chosen in order to implement the method on a distributed memory multiprocessor.

Investigating the sparse simplex algorit
Investigating the sparse simplex algorithm on a distributed memory multiprocessor
โœ I. Maros; G. Mitra ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

There is a sustained interest in improving the computational performance of the sparse simplex (SSX) method for linear programs. Although there have been some investigations covering SSX on parallel computing platforms the performance results have not been particularly encouraging. While it is possi