Exploitation of image parallelism for ray tracing 3D scenes on 2D mesh multicomputers

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Ray tracing is a well known technique to generate life-like images based on models of light shading, reflection, and refraction. The massive computation and memory demands of ray tracing complex scenes have long motivated researchers to use parallel processing in reducing the ray tracing time. This paper gives a study of parallel implementation of a ray tracing algorithm on a distributed memory parallel computer. The computational cost of rendering pixels and patterns of data access can not be predicted until runtime. To efficiently parallelize such an application, the issues of database partition, data management and load balancing must be addressed. In this paper, we discuss the ways of database partition and propose a dynamic data management scheme which can exploit image coherence to reduce data communication time. A global load balancing mechanism is presented to ensure a good load balance among processors during ray tracing time. The success of our implementation depends crucially on a number of parameters which are experimentally evaluated.

Original languageEnglish
Pages (from-to)1993-2015
Number of pages23
JournalParallel Computing
Volume23
Issue number13
Publication statusPublished - 1997 Dec 15

Fingerprint

Multicomputers
Ray Tracing
Ray tracing
Exploitation
Parallelism
Mesh
Data Management
Load Balancing
Information management
Resource allocation
Light refraction
Partition
Light reflection
Data storage equipment
Load Balance
Shading
Data Communication
Distributed Memory
Refraction
Parallel Computers

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Cite this

@article{cbc4ee7f43fc4a7fa4450259749bb215,
title = "Exploitation of image parallelism for ray tracing 3D scenes on 2D mesh multicomputers",
abstract = "Ray tracing is a well known technique to generate life-like images based on models of light shading, reflection, and refraction. The massive computation and memory demands of ray tracing complex scenes have long motivated researchers to use parallel processing in reducing the ray tracing time. This paper gives a study of parallel implementation of a ray tracing algorithm on a distributed memory parallel computer. The computational cost of rendering pixels and patterns of data access can not be predicted until runtime. To efficiently parallelize such an application, the issues of database partition, data management and load balancing must be addressed. In this paper, we discuss the ways of database partition and propose a dynamic data management scheme which can exploit image coherence to reduce data communication time. A global load balancing mechanism is presented to ensure a good load balance among processors during ray tracing time. The success of our implementation depends crucially on a number of parameters which are experimentally evaluated.",
author = "Tong-Yee Lee",
year = "1997",
month = "12",
day = "15",
language = "English",
volume = "23",
pages = "1993--2015",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "13",

}

Exploitation of image parallelism for ray tracing 3D scenes on 2D mesh multicomputers. / Lee, Tong-Yee.

In: Parallel Computing, Vol. 23, No. 13, 15.12.1997, p. 1993-2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Exploitation of image parallelism for ray tracing 3D scenes on 2D mesh multicomputers

AU - Lee, Tong-Yee

PY - 1997/12/15

Y1 - 1997/12/15

N2 - Ray tracing is a well known technique to generate life-like images based on models of light shading, reflection, and refraction. The massive computation and memory demands of ray tracing complex scenes have long motivated researchers to use parallel processing in reducing the ray tracing time. This paper gives a study of parallel implementation of a ray tracing algorithm on a distributed memory parallel computer. The computational cost of rendering pixels and patterns of data access can not be predicted until runtime. To efficiently parallelize such an application, the issues of database partition, data management and load balancing must be addressed. In this paper, we discuss the ways of database partition and propose a dynamic data management scheme which can exploit image coherence to reduce data communication time. A global load balancing mechanism is presented to ensure a good load balance among processors during ray tracing time. The success of our implementation depends crucially on a number of parameters which are experimentally evaluated.

AB - Ray tracing is a well known technique to generate life-like images based on models of light shading, reflection, and refraction. The massive computation and memory demands of ray tracing complex scenes have long motivated researchers to use parallel processing in reducing the ray tracing time. This paper gives a study of parallel implementation of a ray tracing algorithm on a distributed memory parallel computer. The computational cost of rendering pixels and patterns of data access can not be predicted until runtime. To efficiently parallelize such an application, the issues of database partition, data management and load balancing must be addressed. In this paper, we discuss the ways of database partition and propose a dynamic data management scheme which can exploit image coherence to reduce data communication time. A global load balancing mechanism is presented to ensure a good load balance among processors during ray tracing time. The success of our implementation depends crucially on a number of parameters which are experimentally evaluated.

UR - http://www.scopus.com/inward/record.url?scp=0031355880&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031355880&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031355880

VL - 23

SP - 1993

EP - 2015

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 13

ER -