More parallel rendering, with some randomness.
IEEE CG&A
Traditionally, high computational costs have restricted high-fidelity interactive rendering to expensive shared-memory or dedicated distributed processors. Desktop grids offer a low-cost alternative by combining arbitrary computational resources connected to a network, such as the resources in a laboratory or an office. However, the prevalent interactive rendering algorithms can't seamlessly handle the variable computational power offered by a desktop grid's nondedicated resources. A proposed fault-tolerant algorithm renders high-fidelity images at an interactive rate that can handle variable resources. A conventional approach of rescheduling failed jobs in a volatile environment would inhibit performance when rendering at interactive rates because the time margins are small. Instead, this method uses quasi-random sampling along with image reconstruction. This video shows examples of scenes rendered on a desktop grid. 
No comments:
Post a Comment