ONLINE ALGORITHMS

OVERVIEW

[Previous] [This] [Next] [Top] [Bot]

Introduction

This can be formulated as an online scheduling problem: each request for visual data is served at some "quality level" (also called Quality-of-Service or QoS Level).

We can measure the QoS by the amount of data that is sent - this can be varied by reducing the resolution or the coverage of the visual data (in case we use foveating type techniques).

In order to see what can be achieved here, it is important to understand a class of algorithms called competitive online algorithms, first introduced by Sleator and Tarjan. We illustrate the ideas here by studying the paging problem.

Next we study a ``scalable scheduling'' problem introduced by Chang and Yap [] motivated by visualization. We introduce two algorithms FirstFit and LastFit, both of which can be shown to be 2-competitive.

[Previous] [This] [Next] [Top] [Bot]

General Issues

[Previous] [This] [Next] [Top] [Bot]

Overview of System

[Previous] [This] [Next] [Top] [Bot]

Introduction to Threads

[Previous] [This] [Next] [Top] [Bot]

Attribute Objects

File translated from T_EX by T_TH, version 3.01.
On 11 Dec 2001, 15:05.