Parallel vertex-to-vertex radiosity on a distributed shared memory system

Citations of this article
Mendeley users who have this article in their library.
Get full text


In this paper we describe the paralld implementation of the Vertex-To-Vertex Radiosity method on a cluster of PC hosts with a Distributed Shared Memory interface (DSM). We first explain how we use stochastic rays to compute the Form-Factor. We then proceed to describe the implementation of this method on top of the MILLIPEDE system, a virtual parallel machine that runs on top of available distributed environments. We discuss a step-by-step process for exploiting MILLIPEDE'S optimization mechanisms. Despite the relatively slow communication medium, the optimization process leads from initial slowdown to high speedups.




Bar-Lev, A., Itzkovitz, A., Raviv, A., & Schuster, A. (1998). Parallel vertex-to-vertex radiosity on a distributed shared memory system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1457 LNCS, pp. 238–250). Springer Verlag.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free