Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Wait-free shared-memory irradiance caching

Tools
- Tools
+ Tools

Debattista, Kurt, Dubla, Piotr, Santos, Luis Paulo and Chalmers, Alan. (2011) Wait-free shared-memory irradiance caching. IEEE Computer Graphics and Applications, Vol.31 (No.5). pp. 66-78. ISSN 0272-1716

[img]
Preview
PDF
WRAP_Debattista_0673615-wmg-101111-ic_cga-2009-09-0101_debattista.pdf - Accepted Version - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Download (1842Kb)
Official URL: http://dx.doi.org/10.1109/MCG.2010.80

Abstract

Parallelizing rendering algorithms to exploit multiprocessor and multicore machines isn't straightforward. Certain methods require frequent synchronization among threads to obtain benefits similar to the sequential algorithm. One such algorithm is the irradiance cache (IC), an acceleration data structure that caches indirect diffuse irradiance values. In multicore systems, the threads must share the IC to achieve high efficiency. A proposed wait-free mechanism for accessing the shared IC doesn't use the common blocking or busy-waiting methods, thus avoiding most serialization and reducing contention. A comparison with two classic approaches-a lock-based mechanism and a local-write technique-on two systems with up to 24 cores shows that the wait-free approach significantly reduces synchronization overhead, thus improving performance. The Web extra PDF augments the article. The Web extra video is an animation that demonstrates the wait-free IC system running at close to interactive rates on an 8-core machine.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science > WMG (Formerly the Warwick Manufacturing Group)
Library of Congress Subject Headings (LCSH): Rendering (Computer graphics), Parallel processing (Electronic computers), Cache memory
Journal or Publication Title: IEEE Computer Graphics and Applications
Publisher: Institute of Electrical and Electronics Engineers
ISSN: 0272-1716
Date: September 2011
Volume: Vol.31
Number: No.5
Number of Pages: 13
Page Range: pp. 66-78
Identification Number: 10.1109/MCG.2010.80
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Fundação para a Ciência e a Tecnologia (FCT), Engineering and Physical Sciences Research Council (EPSRC)
Grant number: PT-DC/EIA/65965/2006 (FCT), EP/D069874/2 (EPSRC)
References: [DDSC09] DUBLA P., DEBATTISTA K., SANTOS L. P., CHALMERS A.: Wait-Free Shared-Memory Irradiance Cache. Debattista K., Weiskopf D., Comba J., (Eds.), Eurographics Association, pp. 57–64. [DSC06] DEBATTISTA K., SANTOS L. P., CHALMERS A.: Accelerating the irradiance cache through parallel component-based rendering. In Eurographics Symp. on Parallel Graphics and Visualization (2006). [Her09] HERLIHY M.: Technical perspective highly concurrent data structures. Commun. ACM 52, 5 (2009), 99–99. [HLM03] HERLIHY M., LUCHANGCO V., MOIR M.: Obstruction-free synchronization: Double-ended queues as an example. In ICDCS ’03: Proceedings of the 23rd In- ternational Conference on Distributed Computing Systems (Washington, DC, USA, 2003), IEEE Computer Society, p. 522. [HW90] HERLIHY M. P., WING J. M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (1990), 463–492. [KMG99] KOHOLKA R., MAYER H., GOLLER A.: MPI- parallelized Radiance on SGI CoW and SMP. In ParNum’99: 4th Int. ACPC Conf. (1999), pp. 549–558. [MBH02] MARR D., BINNS F., HILL D., HINTON G., KO- UFATY D., MILLER A., UPTON M.: Hyper-threading technol- ogy architecture and microarchitecture. Intel Technology Journal 6, 1 (February 2002), 4–15. [RCLL99] ROBERTSON D., CAMPBELL K., LAU S., LIGOCKI T.: Parallelization of radiance for real time interactive lighting vi- sualization walkthroughs. In ACM/IEEE Supercomputing (1999), ACM Press, p. 61. [War88] WARD G.: A ray tracing solution for diffuse interreflec- tion. Computer Graphics - SIGGRAPH’88 22, 4 (August 1988). [War94] WARD G.: The radiance lighting simulation and render- ing. Computer Graphics - SIGGRAPH’94 (1994). [WBS07] WALD I., BOULOS S., SHIRLEY P.: Ray tracing de- formable scenes using dynamic bounding volume hierarchies. ACM Trans. Graph. 26, 1 (2007), 6. [WMG07] WALD I., MARK W. R., GÜNTHER J., BOULOS S., IZE T., HUNT W., PARKER S. G., SHIRLEY P.: State of the art in ray tracing animated scenes. In STAR Proceedings of Eu- rographics 2007 (September 2007), Schmalstieg D., Bittner J., (Eds.), pp. 89–116.
URI: http://wrap.warwick.ac.uk/id/eprint/38885

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us