Simple Competitive Request Scheduling Strategies

Simple Competitive Request Scheduling Strategies (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Petra Berenbrink , Marco Riedel , Christian Scheideler

Venue:	in 11th ACM Symposium on Parallel Architectures and Algorithms
Citations:	2 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Simple Competitive Request Scheduling Strategies	user correction - Legacy Corrections
AUTHOR NAME	Petra Berenbrink	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematics and Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	Paderborn University, 33095 Paderborn, Germany	user correction - Legacy Corrections
AUTHOR NAME	Marco Riedel	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematics and Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	Paderborn University, 33095 Paderborn, Germany	user correction - Legacy Corrections
AUTHOR NAME	Christian Scheideler	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematics and Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	Paderborn University, 33095 Paderborn, Germany	user correction - Legacy Corrections
ABSTRACT	In this paper we study the problem of scheduling real-time requests in distributed data servers. We assume the time to be divided into time steps of equal length called rounds. During every round a set of requests arrives at the system, and every resource is able to fulfill one request per round. Every request specifies two (distinct) resources and requires to get access to one of them. Furthermore, every request has a deadline of d, i.e. a request that arrives in round t has to be fulfilled during round t +d 1 at the latest. The number of requests which arrive during some round and the two alternative resources of every request are selected by an adversary. The goal is to maximize the number of requests that are fulfilled before their deadlines expire. We examine the scheduling problem in an online setting, i.e. new requests continuously arrive at the system, and we have to determine online an assignment of the requests to the resources in such a way that every resource has to fulfil...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	in 11th ACM Symposium on Parallel Architectures and Algorithms	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	33--42	INFERENCE
CITATIONS	19 found	ParsCit 1.0