Advanced search
Publication Cover
International Journal of Parallel, Emergent and Distributed Systems Volume 37, 2022 - Issue 4
Submit an article Journal homepage
158
Views
1
CrossRef citations to date
0
Altmetric
Research Article

An online fair resource allocation solution for fog computing

Jia He Suna Queen's University, School of Computing, Kingston, ON, CanadaCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0003-1785-3109
ORCID Icon,
Salimur Choudhuryb Department of Computer Science, Lakehead University, Orillia, ON, Canada
&
Kai Salomaaa Queen's University, School of Computing, Kingston, ON, Canada
Pages 456-477 | Received 21 Mar 2022, Accepted 30 Mar 2022, Published online: 11 Apr 2022

References

  • Markus A, Kertesz A. A survey and taxonomy of simulation environments modelling fog computing. Simul Model Pract Theory. 2020;101:102042.
  • Habibi P, Farhoudi M, Kazemian S, et al. Fog computing: a comprehensive architectural survey. IEEE Access. 2020;8:69105–69133.
  • Hosseinioun P, Kheirabadi M, Tabbakh SRK, et al. aTask scheduling approaches in fog computing: a survey. Trans Emerg Telecommun Technol. 2020: e3792.
  • Sabuncuoglu I, Bayız M. Analysis of reactive scheduling problems in a job shop environment. Eur J Oper Res. 2000;126(3):567–586.
  • Ouelhadj D, Petrovic S. A survey of dynamic scheduling in manufacturing systems. J Sched. 2009;12(4):417–431.
  • Wang Z, Zhang J, Yang S. An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evol Comput. 2019;51: 100594.
  • Bian S, Huang X, Shao Z. Online task scheduling for fog computing with multi-resource fairness. Hawaii USA. 2019 IEEE 90th Vehicular Technology Conference.2019.
  • Isard M, Prabhakaran V, Currey J, et al. Quincy: fair scheduling for distributed computing clusters. Montana, USA In Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles 2019.
  • Zaharia M, Borthakur D, Sen Sarma J, et al. Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. In: Proceedings of the 5th European Conference on Computer Systems. Paris, France; 2010. p. 265–278.
  • Zhang G, Shen F, Yang Y, et al. Fair task offloading among fog nodes in fog computing networks. In: 2018 IEEE International Conference on Communications (ICC). Kansis City, USA; 2018, p. 1–6.
  • Mukherjee M, Guo M, Lloret J, et al. Deadline-aware fair scheduling for offloaded tasks in fog computing with inter-fog dependency. IEEE Commun Lett. 2019;24:307–311.
  • Ghodsi A, Zaharia M, Hindman B, et al. Dominant resource fairness: fair allocation of multiple resource types. In: Nsdi, Vol. 11; 2011. p. 24–38.
  • Wang W, Li B, Liang B. Dominant resource fairness in cloud computing systems with heterogeneous servers. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications. Toronto, Canada; 2014. p. 583–591.
  • Östman A. Distributed dominant resource fairness using gradient overlay [unpublished master's thesis]. KTH Royal Institute of Technology; 2017.
  • Parkes DC, Procaccia AD, Shah N. Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans Econ Comput TEAC. 2015;3:1–22.
  • Korte B, Vygen J. Bin-packing. Berlin: Springer; 2012. p. 471–488.
  • Knuth DE. The art of computer programming. Vol. 3. Boston: Pearson Education; 1997.
  • Reiss JWC, Hellerstein JL. Google cluster-usage traces. 2020. Accessed September 2021. Available from: https://github.com/google/cluster-data
  • Arpaci-Dusseau RH, Arpaci-Dusseau AC. Operating systems: three easy pieces. Boston: Arpaci-Dusseau Books LLC; 2018.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.