Results 1  10
of
1,536
Equilibria of Online Scheduling Algorithms
"... Abstract We describe a model for competitive online scheduling algorithms. Two servers, each with a single observable queue, compete for customers. Upon arrival, each customer strategically chooses the queue with minimal expected wait time. Each scheduler wishes to maximize its number of customers, ..."
Abstract
 Add to MetaCart
Abstract We describe a model for competitive online scheduling algorithms. Two servers, each with a single observable queue, compete for customers. Upon arrival, each customer strategically chooses the queue with minimal expected wait time. Each scheduler wishes to maximize its number of customers
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
, 2005
"... In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract

Cited by 349 (32 self)
 Add to MetaCart
at the underlying layers. However, the scheduling component in this optimal crosslayer congestion control scheme has to solve a complex global optimization problem at each time, and is hence too computationally expensive for online implementation. In this paper, we study how the performance of cross
Scheduling to Minimize Average Completion Time: Offline and Online Algorithms
, 1996
"... Timeindexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of singlemachine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good wo ..."
Abstract

Cited by 227 (24 self)
 Add to MetaCart
Timeindexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of singlemachine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good
An optimal online algorithm for metrical task systems
 JOURNAL OF THE ACM
, 1992
"... In practice, almost all dynamic systems require decisions to be made online, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general online decision algorithm is developed. It is shown that, for an importan ..."
Abstract

Cited by 209 (8 self)
 Add to MetaCart
task processing costs and state transition costs incurred. An online scheduling algorithm is one that chooses s, only knowing T1 Tz ~.. T’. Such an algorithm is wcompetitive if, on any input task sequence, its cost is within an additive constant of w times the optimal offline schedule cost
Dynamic and Aggressive Scheduling Techniques for PowerAware RealTime Systems
, 2001
"... In this paper, we address poweraware scheduling of periodic hard realtime tasks using dynamic voltage scaling. Our solution includes three parts: (a) a static (offline) solution to compute the optimal speed, assuming worstcase workload for each arrival, (b) an online speed reduction mechanism t ..."
Abstract

Cited by 204 (24 self)
 Add to MetaCart
In this paper, we address poweraware scheduling of periodic hard realtime tasks using dynamic voltage scaling. Our solution includes three parts: (a) a static (offline) solution to compute the optimal speed, assuming worstcase workload for each arrival, (b) an online speed reduction mechanism
Speed is as Powerful as Clairvoyance
 Journal of the ACM
, 1995
"... We consider several well known nonclairvoyant scheduling problems, including the problem of minimizing the average response time, and besteffort firm realtime scheduling. It is known that there are no deterministic online algorithms for these problems with bounded (or even polylogarithmic in the n ..."
Abstract

Cited by 211 (26 self)
 Add to MetaCart
We consider several well known nonclairvoyant scheduling problems, including the problem of minimizing the average response time, and besteffort firm realtime scheduling. It is known that there are no deterministic online algorithms for these problems with bounded (or even polylogarithmic
Online Scheduling
, 2003
"... In this chapter, we summarize research efforts on several different problems that fall under the rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over time, and generally must schedule the jobs without any knowledge of the future. The lack of knowledge of th ..."
Abstract

Cited by 62 (5 self)
 Add to MetaCart
In this chapter, we summarize research efforts on several different problems that fall under the rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over time, and generally must schedule the jobs without any knowledge of the future. The lack of knowledge
Online Interval Scheduling
 In Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms
, 1994
"... We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to "schedule " it. Overlapping intervals may not be ..."
Abstract

Cited by 89 (1 self)
 Add to MetaCart
We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to "schedule " it. Overlapping intervals may
Optimal timecritical scheduling via resource augmentation.
 In Proc. of the 29th ACM Symposium on Theory of Computing,
, 1997
"... Abstract We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of scheduling environments. When viewed from the perspective of traditional worstcase analysis, no good ..."
Abstract

Cited by 158 (6 self)
 Add to MetaCart
, no good online algorithms exist for these problems, and for some variants no good offline algorithms exist unless P = "P. We study these problems using a relaxed notion of competitive analysis, introduced by Kalyanasundaram and Pruhs, in which the online algorithm is allowed more resources than
Results 1  10
of
1,536