✦ LIBER ✦

Memory sharing for interactive ray tracing on clusters

✍ Scribed by David E. DeMarle; Christiaan P. Gribble; Solomon Boulos; Steven G. Parker

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 621 KB
Volume: 31
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2005.02.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interactive-Rate Animation Generation by

Interactive-Rate Animation Generation by Parallel Progressive Ray-Tracing on Distributed-Memory Machines

✍ Amit Reisman; Craig Gotsman; Assaf Schuster 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 960 KB

We describe a dynamic load-balancing algorithm for ray-tracing by progressive refinement on a distributed-memory parallel computer. Parallelization of progressive ray-tracing for single images is difficult because of the inherent sequential nature of the sample location generation process, which is

A Transparent Distributed Shared Memory

A Transparent Distributed Shared Memory for Clustered Symmetric Multiprocessors

✍ Jyh-Biau Chang; Ce-Kuen Shieh; Tyng-Yeu Liang 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 368 KB

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

Algorithms for LU decomposition on a sha

Algorithms for LU decomposition on a shared memory multiprocessor

✍ John J Buoni; Paul A Farrell; Arden Ruttan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Efficient support for fine-grain paralle

Efficient support for fine-grain parallelism on shared-memory machines

✍ LOWENTHAL, DAVID K.; FREEH, VINCENT W.; ANDREWS, GREGORY R. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 2 views

A coarse-grain parallel program typically has one thread (task) per processor, whereas a finegrain program has one thread for each independent unit of work. Although there are several advantages to fine-grain parallelism, conventional wisdom is that coarse-grain parallelism is more efficient. This p

Parallel algorithms for QR decomposition

Parallel algorithms for QR decomposition on a shared memory multiprocessor

✍ K. Wright 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous