2014
DOI: 10.1109/tetc.2013.2296537
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Scheduling for Real-Time Jobs in Energy Harvesting Computing Systems

Abstract: International audienceIn this paper, we study a scheduling problem, in which every job is associated with a release time, deadline, required computation time, and required energy. We focus on an important special case where the jobs execute on a uniprocessor system that is supplied by a renewable energy source and use a rechargeable storage unit with limited capacity. Earliest deadline first (EDF) is a class one online algorithm in the classical real-time scheduling theory where energy constraints are not cons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
57
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 70 publications
(57 citation statements)
references
References 26 publications
0
57
0
Order By: Relevance
“…Next, they develop a constant-factor approximation algorithm to solve the problem. Other related work include packet or job scheduling in the context of scheduling theory [17,18]. For example, [17] study the problem of real-time job scheduling in an energy harvesting system.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Next, they develop a constant-factor approximation algorithm to solve the problem. Other related work include packet or job scheduling in the context of scheduling theory [17,18]. For example, [17] study the problem of real-time job scheduling in an energy harvesting system.…”
Section: A Related Workmentioning
confidence: 99%
“…In the worst-case, x is increased by 1 every time, i.e., Now, to solve RAED-SCSB-COMMON with energy constraints, we reduce it, in polytime, to an 17 unweighted knapsack problem with cumulative capacity; that is, the capacity of the knapsack is not fixed to T but changes from one slot to another depending on the energy arrivals. Therefore, knowing the maximum accumulated capacity, we can apply PACK to obtain an optimal solution to RAED-SCSB-COMMON.…”
mentioning
confidence: 99%
“…the number of customers. Chetto [25] studied the scheduling for real-time jobs, which are executed on a uniprocessor system supplied by a renewable energy source. Wang et al [26] studied the energy-aware data allocation and task scheduling problem on multiprocessor system for real-time applications.…”
Section: Related Workmentioning
confidence: 99%
“…The studies toward scheduling as well as provisioning problem was investigated by Chetto et al [7], as it is directly associated with the drainage of energy supply. The author commented that if the scheduling is not performed effectively, the storage module depletes unnecessary power to perform a task.…”
Section: Related Workmentioning
confidence: 99%