vistit the homepage Vienna University of TechnologyTECHNISCHE UNIVERSITÄT WIEN
Institut für Computergraphik und Algorithmen
Arbeitsbereich Computergraphik

Home  -   People  -   Courses  -   Research  -   Events  -   Resources  -   Jobs

 

Christian Faisstnauer, Dieter Schmalstieg, Werner Purgathofer
Priority Round-Robin Scheduling for Very Large Virtual Environments
TR-186-2-99-18, August 1999 [ paper]
Information
  • Publication Type: Technical Report
  • Keywords: LOD, graceful degradation, very large virtual environments, round robin, priority, output sensitive, scheduling

Abstract
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. In this paper we present a generic scheduling algorithm that allows 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.

Additional Files and Images
Additional files:
paper
paper





BibTeX
Download BibTeX-Entry
@techreport\{Faisstnauer-1999-Pri,
  title =      "Priority Round-Robin Scheduling for Very Large
               Virtual
Environments",
  author =     "Christian Faisstnauer and Dieter Schmalstieg and Werner
               Purgathofer",
  year =       "1999",
  abstract =   "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. In this paper we
               present a generic scheduling algorithm that allows 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.",
  address =    "Favoritenstrasse 9-11/186, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  month =      aug,
  number =     "TR-186-2-99-18",
  keywords =   "LOD, graceful degradation, very large virtual environments,
               round robin, priority, output sensitive, scheduling",
  URL =        "http://www.cg.tuwien.ac.at/research/publications/1999/Faisstnauer-1999-Pri/",
}

Computer Graphics Group / Research / Publications / 1999 / Faisstnauer-1999-Pri
Maintained by webmaster.
Last update on 30. Nov 04.
Comments to webmaster (at) cg.tuwien.ac.at.
get back to the index

Favoritenstrasse 9-11 / E186, A-1040 Wien, Austria
Tel. +43 (1) 58801-18602, Fax +43 (1) 58801-18698
www.cg.tuwien.ac.at