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

Randomized parallel list ranking for distributed memory multiprocessors

โœ Scribed by Frank Dehne; Siang W. Song


Book ID
110632450
Publisher
Springer
Year
1997
Tongue
English
Weight
707 KB
Volume
25
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Randomized parallel speedups for list ra
โœ Uzi Vishkin ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 946 KB

The following problem is considered: given a linked list of length n, compute the distance of each element of the linked list from the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O((n log n)/p + log n) time parallel algorithm using p

Compiling programs for distributed-memor
โœ David Callahan; Ken Kennedy ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer US ๐ŸŒ English โš– 962 KB

We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed

Parallel ELLPACK for shared memory multi
โœ Calvin J. Ribbens; George G. Pitts; Layne T. Watson ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 865 KB

This paper describes a parallel version of ELLPACK for shared memory multiprocessors. ELLPACK is a system for numerically solving elliptic PDEs. It consists of a very high level language for defining PDE problems and selecting methods of solution, and a library of approximately 50 problem solving mo