Performance oriented task-resource mapping and scheduling in fog computing environment

被引:17
|
作者
Subbaraj, Saroja [1 ]
Thiyagarajan, Revathi [1 ]
机构
[1] Mepco Schlenk Engn Coll, Dept Informat Technol, Sivakasi, India
来源
关键词
AHP; TOPSIS; Fog Computing; Scheduling; CLOUD; INTERNET;
D O I
10.1016/j.cogsys.2021.07.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Resource allocation and task scheduling is a complex task in fog computing environment because of the inherent heterogeneity among the fog devices. The proposed work attempts to solve the problem by using the popular multi criteria decision making methods such as AHP and TOPSIS. The goal of this paper is to propose a model for performance oriented task - resource mapping in a fog computing environment. MIPS, RAM & storage, uplink latency, downlink latency, uplink bandwidth, downlink bandwidth, trust, cost per MIPS, cost per memory, cost per storage and cost per bandwidth are the various performance characteristics considered in this work for task - resource mapping. Two different multi-criteria decision making methods are employed in order to assess the performance characteristics of the fog devices. In the first method, Analytic Hierarchy Process (AHP) is used for both priority weight calculation and ranking of fog devices. In the second method, AHP is used for priority weight calculation, based on the weights yielded by AHP, Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) algorithm is executed in order to rank the fog devices. Then the fog devices can be allocated to the tasks based on its rank. Furthermore, a motivational example is also demonstrated to validate the proposed method. Simulation results show that the proposed technique exhibits superior performance over other scheduling algorithms in the fog environment by incorporating performance, security, and cost metrics into scheduling decisions.
引用
收藏
页码:40 / 50
页数:11
相关论文
共 50 条
  • [1] Performance oriented task-resource mapping and scheduling in fog computing environment
    Subbaraj, Saroja
    Thiyagarajan, Revathi
    Cognitive Systems Research, 2021, 70 : 40 - 50
  • [2] TRAP: task-resource adaptive pairing for efficient scheduling in fog computing
    Navjeet Kaur
    Ashok Kumar
    Rajesh Kumar
    Cluster Computing, 2022, 25 : 4257 - 4273
  • [3] TRAP: task-resource adaptive pairing for efficient scheduling in fog computing
    Kaur, Navjeet
    Kumar, Ashok
    Kumar, Rajesh
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2022, 25 (06): : 4257 - 4273
  • [4] Task-resource scheduling problem
    Anna Gorbenko
    Vladimir Popov
    International Journal of Automation and Computing, 2012, 9 (4) : 429 - 441
  • [5] Task-resource Scheduling Problem
    Gorbenko, Anna
    Popov, Vladimir
    INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING, 2012, 9 (04) : 429 - 441
  • [6] Task-resource Scheduling Problem
    Anna Gorbenko
    Vladimir Popov
    International Journal of Automation & Computing , 2012, (04) : 429 - 441
  • [7] Optimization of makespan and resource utilization in the fog computing environment through task scheduling algorithm
    Vijayalakshmi, R.
    Vasudevan, V.
    Kadry, Seifedine
    Kumar, R. Lakshmana
    INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING, 2020, 18 (01)
  • [8] RAPTS: resource aware prioritized task scheduling technique in heterogeneous fog computing environment
    Hussain, Mazhar
    Nabi, Said
    Hussain, Mushtaq
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (09): : 13353 - 13377
  • [9] An Overview of Task Scheduling Approaches in Fog Computing Environment
    Batra, Salil
    Singh, Aman
    PROCEEDINGS OF THE 2021 FIFTH INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC 2021), 2021, : 701 - 707
  • [10] Task Scheduling and Resource Balancing of Fog Computing in Smart Factory
    Ming-Tuo Zhou
    Tian-Feng Ren
    Zhi-Ming Dai
    Xin-Yu Feng
    Mobile Networks and Applications, 2023, 28 : 19 - 30