A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes

Biji Nair and S. Mary Saira Bhanu
Additional contact information
Biji Nair: National Institute of Technology
S. Mary Saira Bhanu: National Institute of Technology

Journal of Scheduling, 2022, vol. 25, issue 5, No 4, 547-565

Abstract: Abstract The fog server in a fog computing paradigm extends cloud services to latency-sensitive tasks by employing fog nodes (FNs) near user devices. The resource-constrained FNs face the challenge of meeting stringent deadlines of latency-sensitive tasks. The completion deadline of such tasks becomes critical on preemption. Task preemption is unavoidable in uncertain events, such as FN hostility, overloading, and mobility of the host FN or the user device. Rescheduling the task that is likely to face preemption is a better solution than terminating it. This paper proposes a rescheduling algorithm for the fog server to reschedule preempted tasks to FNs that can serve them to completion within their expected time. The rescheduling algorithm aims to attain a rescheduling list that guarantees the task deadline requirements. The brain-inspired rescheduling decision-making (BIRD) algorithm proposed in this paper uses the actor-critic reinforcement learning method for rescheduling preempted tasks to FNs. It mimics the decision-making model of the human brain to control voluntary motor activity. It guarantees the deadline requirement of the preempted task by ensuring the optimal performance of the FN through load balancing while rescheduling the preempted tasks to FNs. Experimental evaluation shows that the BIRD algorithm offers better FN selection than other scheduling policies such as first come first served (FCFS), greedy task allocation, task allocation based on least laxity, shortest job first (SJF), and earliest deadline first (EDF).

Keywords: Fog computing; Brain-inspired scheduling; Fog node; Reinforcement learning; Task rescheduling (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-022-00725-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:25:y:2022:i:5:d:10.1007_s10951-022-00725-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-022-00725-x

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().