Revisiting Parallel Rendering for Shared Memory Machines

dc.contributor.authorNouanesengsy, Boonthanomeen_US
dc.contributor.authorAhrens, Jamesen_US
dc.contributor.authorWoodring, Jonathanen_US
dc.contributor.authorShen, Han-Weien_US
dc.contributor.editorTorsten Kuhlen and Renato Pajarola and Kun Zhouen_US
dc.date.accessioned2014-01-26T16:57:04Z
dc.date.available2014-01-26T16:57:04Z
dc.date.issued2011en_US
dc.description.abstractIncreasing the core count of CPUs to increase computational performance has been a significant trend for the better part of a decade. This has led to an unprecedented availability of large shared memory machines. Programming paradigms and systems are shifting to take advantage of this architectural change, so that intra-node parallelism can be fully utilized. Algorithms designed for parallel execution on distributed systems will also need to be modified to scale in these new shared and hybrid memory systems. In this paper, we reinvestigate parallel rendering algorithms with the goal of finding one that achieves favorable performance in this new environment.We test and analyze various methods, including sort-first, sort-last, and a hybrid scheme, to find an optimal parallel algorithm that maximizes shared memory performance.en_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US
dc.identifier.isbn978-3-905674-32-3en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV11/031-040en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.1 [Computer Graphics]: Hardware Architecture- Parallel processingen_US
dc.titleRevisiting Parallel Rendering for Shared Memory Machinesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
031-040.pdf
Size:
1.22 MB
Format:
Adobe Portable Document Format