Home > Research > Publications & Outputs > A cache-based approach toward improved scheduli...

Electronic data

  • Cache_paper(10-01-20)

    Rights statement: This is the peer reviewed version of the following article: Khan, OA, Malik, SUR, Baig, FM, et al. A cache‐based approach toward improved scheduling in fog computing. Softw: Pract Exper. 2020; 1– 13. https://doi.org/10.1002/spe.2824 which has been published in final form at https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2824 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.

    Accepted author manuscript, 1.19 MB, PDF document

    Embargo ends: 12/04/21

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A cache-based approach toward improved scheduling in fog computing

Research output: Contribution to journalJournal article

E-pub ahead of print
  • O.A. Khan
  • S.U.R. Malik
  • F.M. Baig
  • S.U. Islam
  • H. Pervaiz
  • H. Malik
  • S.H. Ahmed
Close
<mark>Journal publication date</mark>12/04/2020
<mark>Journal</mark>Software: Practice and Experience
Number of pages13
Publication StatusE-pub ahead of print
Early online date12/04/20
<mark>Original language</mark>English

Abstract

Fog computing is a promising technique to reduce the latency and power consumption issues of the Internet of Things (IoT) ecosystem by enabling storage and computational resource close to the end-user devices with additional benefits such as improved execution time and processing. However, with an increase in IoT devices, the resource allocation and job scheduling became a complicated and cumbersome task due to limited and heterogeneous resources along with the locality restriction in such computing environment. Therefore, this paper proposes a cache-based approach for efficient resource allocation in fog computing environment, while maintaining the quality of service. The proposed algorithm is realized using iFogSim simulator and a comprehensive comparison is presented with the traditional First Come First Served and Shortest Job First policies. The performance evaluation revealed that with the proposed scheme the execution time, latency, processing delays and power consumption decreased by 38%, 11.1%, 6%, and 17.8%, respectively, as compared to those of the traditional schemes. 

Bibliographic note

This is the peer reviewed version of the following article: Khan, OA, Malik, SUR, Baig, FM, et al. A cache‐based approach toward improved scheduling in fog computing. Softw: Pract Exper. 2020; 1– 13. https://doi.org/10.1002/spe.2824 which has been published in final form at https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2824 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.