hard deadline
Recently Published Documents


TOTAL DOCUMENTS

34
(FIVE YEARS 2)

H-INDEX

12
(FIVE YEARS 0)

Author(s):  
Weijun Tang ◽  
Rongbin Zhang ◽  
Suili Feng




2020 ◽  
Vol 19 (9) ◽  
pp. 2160-2173 ◽  
Author(s):  
Arvin Hekmati ◽  
Peyvand Teymoori ◽  
Terence D. Todd ◽  
Dongmei Zhao ◽  
George Karakostas


2020 ◽  
Vol 63 (10) ◽  
pp. 1537-1546
Author(s):  
Rola El Osta ◽  
Maryline Chetto ◽  
Hussein El Ghor

Abstract We consider the problem of real-time scheduling in uniprocessor devices powered by energy harvesters. In particular, we focus on mixed sets of tasks with time and energy constraints: hard deadline periodic tasks and soft aperiodic tasks without deadlines. We present an optimal aperiodic servicing algorithm that minimizes the response times of aperiodic tasks without compromising the schedulability of hard deadline periodic tasks. The server, called Slack Stealing with energy Preserving (SSP), is designed based on a slack stealing mechanism that profits whenever possible from available spare processing time and energy. We analytically establish the optimality of SSP. Our simulation results validate our theoretical analysis.



2020 ◽  
Vol 160 ◽  
pp. 614-622
Author(s):  
Arvin Hekmati ◽  
Peyvand Teymoori ◽  
Terence D. Todd ◽  
Dongmei Zhao ◽  
George Karakostas




Sign in / Sign up

Export Citation Format

Share Document