| dc.contributor.author | Roth, Marcus | en_US |
| dc.contributor.author | Reiners, Dirk | en_US |
| dc.contributor.editor | Alan Heirich and Bruno Raffin and Luis Paulo dos Santos | en_US |
| dc.date.accessioned | 2014-01-26T16:30:49Z | |
| dc.date.available | 2014-01-26T16:30:49Z | |
| dc.date.issued | 2006 | en_US |
| dc.identifier.isbn | 3-905673-40-1 | en_US |
| dc.identifier.issn | 1727-348X | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/EGPGV/EGPGV06/119-126 | en_US |
| dc.description.abstract | The core advantage of sort last rendering is the theoretical nearly linear scalability in the number of rendering nodes, which makes it very attractive for very large polygonal and volumetric models. The disadvantage of sort last rendering is that a final image composition step is necessary in which a huge amount of data has to be transferred between the rendering nodes. Even with gigabit or faster networks the image composition introduces an overhead that makes it impractical to use sort last parallel rendering for interactive applications on large clusters. This paper describes the Sorted Pipeline Composition algorithm that reduces the amount of data that needs to be transferred by an order of magnitude and results in a frame rate that is at least twice as high as the widely used binary swap image composition algorithm. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.2 [Computer Graphics]: Graphics SystemsDistributed/ networked graphics; | en_US |
| dc.title | Sorted Pipeline Image Composition | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Parallel Graphics and Visualization | en_US |
