File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Adaptive parallel rendering on multiprocessors and workstation clusters

TitleAdaptive parallel rendering on multiprocessors and workstation clusters
Authors
KeywordsCluster Of Workstations
Computer Graphics
Load Balancing
Mpi Programming
Parallel Rendering
Polygon Rasterization
Scalable Performance
Speedup And Efficiency
Supersampling
Symmetric Multiprocessors
Issue Date2001
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2001, v. 12 n. 3, p. 241-258 How to Cite?
AbstractThis paper presents the design and performance of a new parallel graphics renderer for 3D images. This renderer is based on an adaptive supersampling approach that works for time/space-efficient execution on two classes of parallel computers. Our rendering scheme takes subpixel supersamples only along polygon edges. This leads to a significant reduction in rendering time and in buffer memory requirements. Furthermore, we offer a balanced rasterization of all transformed polygons. Experimental results prove these advantages on both a shared-memory SGI multiprocessor server and a Unix cluster of Sun workstations. We reveal performance effects of the new rendering scheme on subpixel resolution, polygon number, scene complexity, and memory requirements. The balanced parallel renderer demonstrates scalable performance with respect to increase in graphic complexity and in machine size. Our parallel renderer outperforms Crow's scheme in benchmark experiments performed. The improvements are made in three fronts: 1) reduction in rendering time, 2) higher efficiency with balanced workload, and 3) adaptive to available buffer memory size. The balanced renderer can be more cost-effectively embedded within many 3D graphics algorithms, such as those for edge smoothing and 3D visualization. Our parallel renderer is MPI-coded, offering high portability and cross-platform performance. These advantages can greatly improve the QoS in 3D imaging and in real-time interactive graphics.
Persistent Identifierhttp://hdl.handle.net/10722/155143
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590

 

DC FieldValueLanguage
dc.contributor.authorLin, WSen_US
dc.contributor.authorLau, RWHen_US
dc.contributor.authorHwang, Ken_US
dc.contributor.authorLin, Xen_US
dc.contributor.authorCheung, PYSen_US
dc.date.accessioned2012-08-08T08:32:03Z-
dc.date.available2012-08-08T08:32:03Z-
dc.date.issued2001en_US
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2001, v. 12 n. 3, p. 241-258en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://hdl.handle.net/10722/155143-
dc.description.abstractThis paper presents the design and performance of a new parallel graphics renderer for 3D images. This renderer is based on an adaptive supersampling approach that works for time/space-efficient execution on two classes of parallel computers. Our rendering scheme takes subpixel supersamples only along polygon edges. This leads to a significant reduction in rendering time and in buffer memory requirements. Furthermore, we offer a balanced rasterization of all transformed polygons. Experimental results prove these advantages on both a shared-memory SGI multiprocessor server and a Unix cluster of Sun workstations. We reveal performance effects of the new rendering scheme on subpixel resolution, polygon number, scene complexity, and memory requirements. The balanced parallel renderer demonstrates scalable performance with respect to increase in graphic complexity and in machine size. Our parallel renderer outperforms Crow's scheme in benchmark experiments performed. The improvements are made in three fronts: 1) reduction in rendering time, 2) higher efficiency with balanced workload, and 3) adaptive to available buffer memory size. The balanced renderer can be more cost-effectively embedded within many 3D graphics algorithms, such as those for edge smoothing and 3D visualization. Our parallel renderer is MPI-coded, offering high portability and cross-platform performance. These advantages can greatly improve the QoS in 3D imaging and in real-time interactive graphics.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_US
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_US
dc.subjectCluster Of Workstationsen_US
dc.subjectComputer Graphicsen_US
dc.subjectLoad Balancingen_US
dc.subjectMpi Programmingen_US
dc.subjectParallel Renderingen_US
dc.subjectPolygon Rasterizationen_US
dc.subjectScalable Performanceen_US
dc.subjectSpeedup And Efficiencyen_US
dc.subjectSupersamplingen_US
dc.subjectSymmetric Multiprocessorsen_US
dc.titleAdaptive parallel rendering on multiprocessors and workstation clustersen_US
dc.typeArticleen_US
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_US
dc.identifier.authorityCheung, PYS=rp00077en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/71.914755en_US
dc.identifier.scopuseid_2-s2.0-0035269720en_US
dc.identifier.volume12en_US
dc.identifier.issue3en_US
dc.identifier.spage241en_US
dc.identifier.epage258en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLin, WS=23025085400en_US
dc.identifier.scopusauthoridLau, RWH=7103010017en_US
dc.identifier.scopusauthoridHwang, K=7402426691en_US
dc.identifier.scopusauthoridLin, X=8208832700en_US
dc.identifier.scopusauthoridCheung, PYS=7202595335en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats