Please use this identifier to cite or link to this item:
Title: Collaborative high-fidelity rendering over peer-to-peer networks
Authors: Bugeja, Keith
Debattista, Kurt
Spina, Sandro
Chalmers, A.
Keywords: Rendering (Computer graphics)
Computer graphics
Peer-to-peer architecture (Computer networks)
Issue Date: 2014
Citation: Bugeja, K., Debattista, K., Spina, S., & Chalmers, A. (2014). Collaborative high-fidelity rendering over peer-to-peer networks. In PGV'14 Proceedings of the 14th Eurographics Symposium on Parallel Graphics and Visualization, United Kingdom. 9-16.
Abstract: Due to the computational expense of high-fidelity graphics, parallel and distributed systems have frequently been employed to achieve faster rendering times. The form of distributed computing used, with a few exceptions such as the use of GRID computing, is limited to dedicated clusters available to medium to large organisations. Recently, a number of applications have made use of shared resources in order to alleviate costs of computation. Peer-to-peer computing has arisen as one of the major models for off-loading costs from a centralised computational entity to benefit a number of peers participating in a common activity. This work introduces a peer-to-peer collaborative environment for improving rendering performance for a number of peers where the program state, that is the result of some computation among the participants, is shared. A peer that computes part of this state shares it with the others via a propagation mechanism based on epidemiology. In order to demonstrate this approach, the traditional irradiance cache algorithm is extended to account for sharing over a network within the collaborative framework introduced. Results, which show an overall speed-up with little overheads, are presented for scenes in which a number of peers navigate shared virtual environments.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
  Restricted Access
370.74 kBAdobe PDFView/Open Request a copy

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.