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

Design of parallel algorithms for a distributed memory hypercube

โœ Scribed by EL Zapata; OG Plata; FF Rivera

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
852 KB
Volume
16
Category
Article
ISSN
0141-9331

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Towards Structured Parallel Computing on
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
โœ Feng Gao ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho

Parallel implementation of a ray tracing
Parallel implementation of a ray tracing algorithm for distributed memory parallel computers
โœ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 145 KB ๐Ÿ‘ 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Design and Performance of Parallel and D
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut
โœ Steven Homer; Marcus Peinado ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

We develop and experiment with a new parallel algorithm to approximate the maximum weight cut in a weighted undirected graph. Our implementation starts with the recent (serial) algorithm of Goemans and Williamson for this problem. We consider several different versions of this algorithm, varying the