File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Parallel Progressive Radiosity with Adaptive Meshing

TitleParallel Progressive Radiosity with Adaptive Meshing
Authors
Issue Date1997
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal Of Parallel And Distributed Computing, 1997, v. 42 n. 1, p. 30-41 How to Cite?
AbstractProgressive radiosity is widely used for realistic image synthesis in computer graphics applications. High-quality image generation usually requires radiosity with adaptive patch refinement to account for global illumination effects from irregular objects whose proximity varies in a 3D space. Parallelizing such an algorithm is difficult since computation cost for each object varies from one iteration to another depending on the location of dynamically selected shooting patches. Dynamic load balancing is required but its overhead is high for distributed memory systems. This paper presents an efficient parallel algorithm for progressive radiosity, which adopts a static processor assignment strategy to take advantages of a hierarchical computation structure in this problem, minimize communication and balance dynamic load. Our experiments on a Meiko CS-2 distributed memory machine show that this algorithm has achieved good speedups for the tested cases. © 1997 Academic Press.
Persistent Identifierhttp://hdl.handle.net/10722/152295
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYu, Yen_US
dc.contributor.authorIbarra, OHen_US
dc.contributor.authorYang, Ten_US
dc.date.accessioned2012-06-26T06:37:00Z-
dc.date.available2012-06-26T06:37:00Z-
dc.date.issued1997en_US
dc.identifier.citationJournal Of Parallel And Distributed Computing, 1997, v. 42 n. 1, p. 30-41en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/10722/152295-
dc.description.abstractProgressive radiosity is widely used for realistic image synthesis in computer graphics applications. High-quality image generation usually requires radiosity with adaptive patch refinement to account for global illumination effects from irregular objects whose proximity varies in a 3D space. Parallelizing such an algorithm is difficult since computation cost for each object varies from one iteration to another depending on the location of dynamically selected shooting patches. Dynamic load balancing is required but its overhead is high for distributed memory systems. This paper presents an efficient parallel algorithm for progressive radiosity, which adopts a static processor assignment strategy to take advantages of a hierarchical computation structure in this problem, minimize communication and balance dynamic load. Our experiments on a Meiko CS-2 distributed memory machine show that this algorithm has achieved good speedups for the tested cases. © 1997 Academic Press.en_US
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_US
dc.relation.ispartofJournal of Parallel and Distributed Computingen_US
dc.titleParallel Progressive Radiosity with Adaptive Meshingen_US
dc.typeArticleen_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1006/jpdc.1997.1309en_US
dc.identifier.scopuseid_2-s2.0-0038877290en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0038877290&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume42en_US
dc.identifier.issue1en_US
dc.identifier.spage30en_US
dc.identifier.epage41en_US
dc.identifier.isiWOS:A1997XT26300004-
dc.publisher.placeUnited Statesen_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats