Speed scaling with power down scheduling for agreeable deadlines

Details Speed scaling with power down scheduling for agreeable deadlines Speed scaling with power down scheduling for agreeable deadlines

2011-11-15

arxiv.org/abs/1111.3398v1

Computer Science

Data Structures and Algorithms

Scientific paper

We consider the problem of scheduling a set of n jobs, each one specified by
a release time, a deadline and a workload, on a single processor. The objective
is to minimize the overall consumed energy, by adapting the processor speed and
by shutting down the processor when appropriate. We provide an O(n^3) algorithm
computing the optimal schedule in the case of agreeable deadlines.

Affiliated with

Also associated with

No associations

Rating

Speed scaling with power down scheduling for agreeable deadlines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Speed scaling with power down scheduling for agreeable deadlines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speed scaling with power down scheduling for agreeable deadlines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708051