4.6 Article

Resource Allocation and Task Offloading for Heterogeneous Real-Time Tasks With Uncertain Duration Time in a Fog Queueing System

Journal

IEEE ACCESS
Volume 7, Issue -, Pages 9912-9925

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2891130

Keywords

Fog computing; processing optimization; real-time task; resource allocation; Lyapunov optimization

Funding

  1. Guangdong Science Technology Project [2017A010101027, 2015B010131004]
  2. National Nature Science Foundation of China [61671208, 61673182]
  3. NFS of Guangdong [2017A030312006, 2015A030310287]
  4. Guangdong Intellectual Property Office Project [2018-10-1]

Ask authors/readers for more resources

Fog computing has become the primary infrastructure on the Internet for improving the quality of service. We consider a fog queueing system with limited infrastructure resources to accommodate real-time tasks with heterogeneities in task types and execution deadlines. Owing to the uncertain execution duration, such a fog system should jointly consider fog resource allocation and a task offloading to satisfy the deadline requirements. To consider the task heterogeneity, a parallel virtual queue model is applied to buffer each type of task in a separate queue. Subsequently, we use a framework, including three parallel algorithms, namely, offloading, buffering, and resource allocation, to improve resource allocation balance, throughput, and task completion ratio. The task offloading is decided according to the task urgencies in terms of the laxity times, which accounts for the deadline, estimated execution time, and transmission delay to the cloud. The buffering process rearranges the arriving tasks based on their laxity time and the estimated task execution time at the fog tier. The resource allocation uses an adaptive queue weight based on the Lyapunov drift to avoid task starvation that may lead to a long queueing delay for tasks with long execution time. The simulation results indicate that our proposed policies can avoid task starvation and yields a tradeoff between high throughput and a high task completion ratio.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available