Tightly-Coupled Multiprocessing for a Global Illumination Algorithm

dc.contributor.authorDrettakis, Georgeen_US
dc.contributor.authorFiume, Eugeneen_US
dc.contributor.authorFournier, Alainen_US
dc.date.accessioned2015-10-05T07:56:31Z
dc.date.available2015-10-05T07:56:31Z
dc.date.issued1990en_US
dc.description.abstractA 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.seriesinformationEG 1990-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19901031en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19901031en_US
dc.publisherEurographics Associationen_US
dc.titleTightly-Coupled Multiprocessing for a Global Illumination Algorithmen_US
Files