Speed scaling with power down scheduling for agreeable deadlines
نویسندگان
چکیده
منابع مشابه
Speed scaling with power down scheduling for agreeable deadlines
We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload wj and a release time rj . The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we woul...
متن کاملThroughput Maximization for Speed-Scaling with Agreeable Deadlines
We study the following energy-efficient scheduling problem. We are given a set of n jobs which have to be scheduled by a single processor whose speed can be varied dynamically. Each job Jj is characterized by a processing requirement (work) pj , a release date rj and a deadline dj . We are also given a budget of energy E which must not be exceeded and our objective is to maximize the throughput...
متن کاملNon-preemptive Throughput Maximization for Speed-Scaling with Power-Down
We consider the problem of scheduling a set of n jobs on a single processor. Each job is characterized by its release date rj , its deadline dj and its processing volume pj . The processor can vary its speed and can switch into a sleep state in order to reduce its energy consumption. No energy is consumed in this state, but a fixed amount of energy, equal to L, is required for a transition from...
متن کاملA 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
In 2005 Li et al. gave a φ-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines [12] with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek [7]. We claim that the algorithm by Li et al. can be slightly simplified, while retaining its competitive ratio. Then we introduce randomness to the modified algorithm and argue t...
متن کاملLow complexity scheduling algorithms to minimize the number of gaps for unit tasks with agreeable deadlines
Power management aims in reducing the energy consumed by computer systems while maintaining a good level of performance. One of the mechanisms used to save energy is the shut-down mechanism which puts the system into a sleep state when it is idle. No energy is consumed in this state, but a fixed amount of energy is required for a transition from the sleep state to the active state which is equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainable Computing: Informatics and Systems
سال: 2012
ISSN: 2210-5379
DOI: 10.1016/j.suscom.2012.10.003