Tightly-Coupled Multiprocessing for a Global Illumination Algorithm
| dc.contributor.author | Drettakis, George | en_US |
| dc.contributor.author | Fiume, Eugene | en_US |
| dc.contributor.author | Fournier, Alain | en_US |
| dc.date.accessioned | 2015-10-05T07:56:31Z | |
| dc.date.available | 2015-10-05T07:56:31Z | |
| dc.date.issued | 1990 | en_US |
| dc.description.abstract | A prevailing trend in computer graphics is the demand for increasingly realistic global illumination models and algorithms. Despite the fact that the computational power of uniprocessors is increasing, it is clear that much greater computational power is required to achieve satisfactory throughput. The obvious next step is to employ parallel processing. The advent of affordable, tightly-coupled multiprocessors makes such an approach widely available for the first time. We propose a tightly-coupled parallel decomposition of FIAT, a global illumination algorithm, based on space subdivision and power balancing, that we have recently developed. This algorithm is somewhat ambitious, and severely strains existing uniprocessor environments. We discuss techniques for reducing memory contention and maximising parallelism. We also present empirical data on the actual performance of our parallel solution. Since the model of parallel computation that we have employed is likely to persist for quite some time, our techniques are applicable to other algorithms based on space subdivision. | en_US |
| dc.description.seriesinformation | EG 1990-Technical Papers | en_US |
| dc.identifier.doi | 10.2312/egtp.19901031 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egtp.19901031 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Tightly-Coupled Multiprocessing for a Global Illumination Algorithm | en_US |