Interactive-Rate Animation Generation by Parallel Progressive Ray-Tracing on Distributed-Memory Machines |
| |
| Affiliation: | 1. Instituto Federal da Paraíba (UAI-IFPB), Brazil;2. Centro de Informática, Universidade Federal de Pernambuco (CIn-UFPE), Brazil;3. Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, (NOVA LINCS), Portugal;1. Centre for Biomedical Ethics, Yong Loo Lin School of Medicine, National University of Singapore, Singapore;2. Department of Primary Health Care and General Practice, University of Otago, Otago, New Zealand;3. Department of Primary Care Medicine, Faculty of Medicine, University of Malaya, Kuala Lumpur, Malaysia;4. WHO Collaborating Centre for Infectious Disease Epidemiology and Control, School of Public Health, The University of Hong Kong, Hong Kong Special Administrative Region, China;5. Laboratory of Data Discovery for Health Limited, Hong Kong Science and Technology Park, Hong Kong Special Administrative Region, China;6. University of Malaya Medical Centre, Faculty of Medicine, Kuala Lumpur, Malaysia;7. Faculty of Law, University of Malaya, Kuala Lumpur Malaysia;8. Medical Research Ethics Committee, University of Malaya Medical Centre, Kuala Lumpur, Malaysia;9. Saw Swee Hock School of Public Health, National University of Singapore and National University Health System, Singapore, Singapore;10. London School of Hygiene & Tropical Medicine, London, England, United Kingdom |
| |
| Abstract: | 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 optimized (and different) for any given image. Parallelization of progressive ray-tracing when generating image sequences at a fixed interactive rate is even more difficult, because of the time and synchronization constraints imposed on the system. The fixed frame rate requirement complicates matters and even renders meaningless traditional measures of parallel system performance (e.g., speedup). We show how to overcome these problems, which, to the best of our knowledge, have not been treated before. Exploiting the temporal coherence between frames enables us to both accelerate rendering and improve the load-balance throughout the sequence. Our dynamic load-balance algorithm combines local and global methods to account not only for rendering performance, but also for communication overhead and synchronization issues. The algorithm is shown to be robust to the harsh environment imposed by a time-critical application, such as the one we consider. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
