Proceedings of the IEEE symposium on Parallel rendering最新文献

Remote interactive visualization and analysis (RIVA) using parallel supercomputers 使用并行超级计算机的远程交互式可视化和分析(RIVA)

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218340

Peggy Li, W. Duquette, D. Curkendall

引用次数: 7

Synchronization for a multi-port frame buffer on a mesh-connected multicomputer 网格连接多计算机上多端口帧缓冲区的同步

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218341

Bin Wei, Gordon Stoll, D. Clark, E. Felten, Kai Li, P. Hanrahan

引用次数: 9

A load balanced SIMD polygon renderer 一个负载平衡的SIMD多边形渲染器

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218338

S. Whitman

引用次数: 7

Real-time volume rendering on shared memory multiprocessors using the shear-warp factorization 基于剪切-翘曲分解的共享内存多处理器实时体绘制

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218331

P. Lacroute

{"title":"Real-time volume rendering on shared memory multiprocessors using the shear-warp factorization","authors":"P. Lacroute","doi":"10.1145/218327.218331","DOIUrl":"https://doi.org/10.1145/218327.218331","url":null,"abstract":"This paper presents a new parallel volume rendering algorithm that can render 2563 voxel medical data sets at over 10 Hz and 1283 voxel data sets at over 30 Hz on a 16-processor Silicon Graphics Challenge. The algorithm achieves these results by minimizing each of the three components of execution time: computation time, synchronization time, and data communication time. Computation time is low because the parallel algorithm is based on the recentlyreported shear-warp serial volume rendering algorithm which is over five times faster than previous serial algorithms. Synchronization time is minimized by using dynamic load balancing and a task partition that minimizes synchronization events. Data communication costs are low because the algorithm is implemented for sharedmemory multiprocessors, a class of machines with hardware support for low-latency fine-grain communication and hardware caching to hide latency. We draw two conclusions from our implementation. First, we find that on shared-memory architectures data redistribution and communication costs do not dominate rendering time. Second, we find that cache locality requirements impose a limit on parallelism in volume rendering algorithms. Specifically, our results indicate that shared-memory machines with hundreds of processors would be useful only for rendering very large data sets. CR Categories: D.1.3 [Concurrent Programming]: Parallel Programming; 1.3.3 [Computer Graphics]: Picture/Image Generation--Display Algorithms; L3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism. Additional","PeriodicalId":101947,"journal":{"name":"Proceedings of the IEEE symposium on Parallel rendering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122536402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 121

Fast volume rendering using an efficient, scalable parallel formulation of the shear-warp algorithm 快速体渲染使用一个有效的，可扩展的并行公式的剪切-翘曲算法

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218330

M. Amin, A. Grama, Vineet Singh

{"title":"Fast volume rendering using an efficient, scalable parallel formulation of the shear-warp algorithm","authors":"M. Amin, A. Grama, Vineet Singh","doi":"10.1145/218327.218330","DOIUrl":"https://doi.org/10.1145/218327.218330","url":null,"abstract":"This paper presents a fast and scalable parallel algorithm for volume rendering and its implementation on distributed-memory parallel computers. This parallel algorithm is based on the shear-warp algorithm of Lacroute and Levoy. Coupled with optimizations that exploit coherence in the volume and image space, the shear-warp algorithm is currently acknowledged to be the fastest sequential volume rendering algorithm. We have designed a memory efficient parallel formulation of this algorithm that (1) drastically reduces communication requirements by using a novel data partitioning scheme and (2) improves multi-frame performance with an adaptive load-balancing technique. All the optimizations of the Lacroute-Levoy algorithm are preserved in the parallel formulation. The paper also provides an analytical model of performance for the parallel formulation that shows that it is possible to sustain excellent performance across a wide range of practical problem sizes and number of processors. Our implementation, running on a 128 processor TMC CM-5 distributed-memory parallel computer, renders a 256 voxel medical data set at 12 frames/sec.","PeriodicalId":101947,"journal":{"name":"Proceedings of the IEEE symposium on Parallel rendering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131455012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 49

Proceedings of the IEEE symposium on Parallel rendering IEEE并行渲染研讨会论文集

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327

S. Uselton, M. Cox, C. Wittenbrink

引用次数: 2

Efficient parallel global illumination using density estimation 使用密度估计的高效并行全局照明

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218336

David Zareski, B. Wade, Philip M. Hubbard, P. Shirley

{"title":"Efficient parallel global illumination using density estimation","authors":"David Zareski, B. Wade, Philip M. Hubbard, P. Shirley","doi":"10.1145/218327.218336","DOIUrl":"https://doi.org/10.1145/218327.218336","url":null,"abstract":"This paper presents a multi-computer, parallel version of the recently-proposed \"Density Estimation\" (DE) global illumination method, designed for computing solutions of environments with high geometric complexity (as many as hundreds of thousands of initial surfaces). In addition to the diffuse inter-reflections commonly handled by conventional radiosity methods, this new method can also handle energy transport involving arbitrary non-diffuse surfaces. Output can either be Gouraud-shaded elements for interactive walkthroughs, or ray-traced images for higher quality still frames. The key difference of the DE algorithm from conventional radiosity, in germs of its ability to parallelize efficiently, is its microscopic wew of energy transport, which avoids the O(n 2) pairwise surface interactions of most previous macroscopic radiosity algorithms (i.e.. those without clustering). Parallel DE is implemented as two separate parallel programs which perform different phases of the DE method. The first program performs the particle-tracing phase, and the second performs the density-estimation and rneshing phases. Each parallel program consists of a single master task and multiple worker tasks executing on separate workstations connected over a local area network. Communication is performed using the PVM software package and a shared file system. The goal of this effort is to provide a near-linear speedup for solutions to existing environment models using tens of processors. The parallel efficiency of the first program has been measured to be above 90% for as many as 16 workers. and the parallel efficiency of the second program has been measured to be above 70% for as many as 12 workers. C R","PeriodicalId":101947,"journal":{"name":"Proceedings of the IEEE symposium on Parallel rendering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121403029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25

Load balancing for a parallel radiosity algorithm 一种并行辐射算法的负载平衡

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218335

W. Stürzlinger, G. Schaufler, J. Volkert

引用次数: 14

Image composition methods for sort-last polygon rendering on 2-D mesh architectures 二维网格结构上排序多边形绘制的图像合成方法

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218337

Tong-Yee Lee, C. Raghavendra, J. Nicholas

引用次数: 18

Implementation results and analysis of a parallel progressive radiosity 平行渐进式辐射的实现结果及分析

Proceedings of the IEEE symposium on Parallel rendering Pub Date : 1995-12-01 DOI: 10.1145/218327.218334

P. Guitton, J. Roman, Gilles Subrenat

引用次数: 15