By Topic

Priority round-robin scheduling for very large virtual environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Faisstnauer, C. ; Tech. Univ. Wien, Austria ; Schmalstieg, D. ; Purgathofer, W.

In virtual environments containing a very large number of objects, the limited amount of available resources often proves to be a bottleneck, causing a competition for those resources, for example network bandwidth, processing power or the rendering pipeline. This leads to a degradation of the system's performance, as only a small number of elements can be granted the resource required. We present a generic scheduling algorithm that allows us to achieve a graceful degradation: it is output sensitive, minimizes the risk of starvation and enforces priorities based on a freely definable error metric. Hence it can be employed in virtual environments of almost any size, to schedule elements which are competing for a determined resource because of a bottleneck

Published in:

Virtual Reality, 2000. Proceedings. IEEE

Date of Conference:

2000