Hybrid Sort-First and Sort-Last Parallel Rendering with a Cluster of PCs

dc.contributor.authorSamanta, Rudrajiten_US
dc.contributor.authorFunkhouser, Thomasen_US
dc.contributor.authorLi, Kaien_US
dc.contributor.authorSingh, Jaswinder Palen_US
dc.contributor.editorI. Buck and G. Humphreys and P. Hanrahanen_US
dc.date.accessioned2013-10-28T09:57:05Z
dc.date.available2013-10-28T09:57:05Z
dc.date.issued2000en_US
dc.description.abstractWe investigate a new hybrid of sort-first and sort-last approach for parallel polygon rendering, using as a target platform a cluster of PCs. Unlike previous methods that statically partition the 3D model and/or the 2D image, our approach performs dynamic, viewdependent and coordinated partitioning of both the 3D model and the 2D image. Using a specific algorithm that follows this approach, we show that it performs better than previous approaches and scales better with both processor count and screen resolution. Overall, our algorithm is able to achieve interactive frame rates with efficiencies of 55.0% to 70.5% during simulations of a system with 64 PCs. While it does have potential disadvantages in client-side processing and in dynamic data management which also stem from its dynamic, view-dependent nature these problems are likely to diminish with technology trends in the future.en_US
dc.description.seriesinformationSIGGRAPH/Eurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn1-58113-257-3en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH00/097-108en_US
dc.publisherThe Eurographics Associationen_US
dc.titleHybrid Sort-First and Sort-Last Parallel Rendering with a Cluster of PCsen_US
Files