Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

An improved list-based task scheduling algorithm for fog computing environment

Published: 01 July 2021 Publication History

Abstract

A high-performance execution of programs predominately depends on the efficient scheduling of tasks. An application consists of a sequence of tasks that can be represented as a directed acyclic graph (DAG). The tasks in the DAG have precedence constraints between them and each task has a different timeline on different processors. In this paper, a new list-based scheduling algorithm is proposed which schedules the tasks which are represented as a DAG structure. The main focus of this algorithm is to schedule the tasks to the suitable processing node in fog environment as the fog nodes have limited processing capacity. The assignment of tasks on the fog node should consider both the computation cost of the node and the execution finishing time of the node. The proposed algorithm has three phases. (1) the level sorting phase, where the independent tasks are identified (2) in the Task prioritization phase the proposed algorithm assigns priority to the task which has more successors so that more tasks in the next level can start their execution and (3) in the task selection phase a balanced combination of local optimal and global optimal approach is considered to assign a task to a suitable processor which further enhances the processor selection phase results in minimizing both the makespan and overall computation cost of the processors. Extensive experiments are carried out using randomly generated graphs and graphs from the real-world to analyze the performance of the proposed algorithm. The results show that the proposed algorithm outperforms all other well-known algorithms like predict earliest finish time, heterogeneous earliest finish time algorithm, minimal optimistic processing time, and SDBBATS in terms of performance matrices like average scheduling length ratio, speedup, and makespan.

References

[1]
Bonomi F, Milito R, Zhu J, Addepalli S (2012) Fog computing and its role in the internet of things. In: Proceedings of the first edition of the MCC workshop on mobile cloud computing, MCC ’12, New York, NY, USA, 2012. ACM, pp 13–16
[2]
Agarwal S, Yadav S, and Yadav A An efficient architecture and algorithm for resource provisioning in fog computing MCEP 2016
[3]
Kwok Y and Ahmed I Dynamic critical-path scheduling: an effective technique for allocation task graphs to multi-processors IEEE Trans Parallel Distrib Syst 1996 7 5 506-521
[4]
Topcuoglu H, Hariri S, and Wu M Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Trans Parallel Distrib Syst 2002 13 3 260-274
[5]
Ilavarasan E, Thambidurai P, Mahilmannan R (2005) Performance effective task scheduling algorithm for heterogeneous computing system. In: The 4th internationalsymposium on parallel and distributed computing. IEEE, pp 28–38
[6]
Luiz F, Bittencourt RS, Edmundo RMM (2010) Dag cheduling using a lookahead variant of the heterogeneous earliestfinish time algorithm. In: 18th Euromicro international conferenceon parallel, distributed and network-based processing (PDP). IEEE, pp 27–34
[7]
Shetti KR, Fahmy SA, Bretschneider T ( 2013) Optimization of the HEFT algorithm for a CPU-GPU environment. In: IEEE parallel and distributed computing. applications and technologies (PDCAT). International conference on, pp 212–218
[8]
Arabnejad H and Barbosa JG List scheduling algorithm for heterogeneous systems by an optimistic cost table IEEE Trans Parallel Distrib Syst 2014 25 3 682-694
[9]
Hong H, Tsai P, Hsu C (2016) Dynamic module deployment in a fog computing platform. In: 2016 18th Asia–Pacific network operations and management symposium (APNOMS), Kanazawa, 2016, pp 1–6
[10]
Pham X, Huh E (2016) Towards task scheduling in a cloud-fog computing system. In: Proceedings of the 2016 18th Asia–Pacific network operations and management symposium (APNOMS), Kanazawa, Japan, 5–7 October 2016, pp 1–4
[11]
Taneja M, Davy A (2017) Resource aware placement of IoTapplication modules in fog-cloud computing paradigm. In: Integrated network and service management (IM), 2017 IFIP/IEEE symposium on.IEEE, pp 1222–1228
[12]
Yang Y, Zhao S, Zhang W, Chen Y, Luo X, and Wang J DEBTS: delay energy balanced task scheduling in homogeneous fog networks IEEE Internet Things J 2018 5 2094-2106
[13]
Tejaswini C, Melody M, Teng-Sheng M (2018) Prioritized task scheduling in fog computing. ACM SE '18 March 29–31, 2018, Richmond, KY, USA
[14]
Amir K, Abdelhakim H, El Mostapha A (2019) On the fog-cloud cooperation: how fog computing can address latency concerns of IoT application. In: 2019 fourth international conference on fog and mobile edge computing (FMEC), IEEE, pp 166–172
[15]
Zahra R, Mahboobe R, Mohsen N (2019) LAMP: a hybrid fog-cloud latency-aware module placement algorithm for IoT applications. In: 5th conference on knowledge-based engineering and innovation (KBEI), Iran University of Science and Technology, IEEE, Tehran, Iran, pp 845–850
[16]
Shahzad Arif M, Iqbal Z, Tariq R, Aadil F, and Awais M Parental prioritization-based task scheduling in heterogeneous systems Arab J Sci Eng 2019 44 3943-3952
[17]
Tang X, Li K, Liao G, and Li R List scheduling with duplication for heterogeneous computing systems J Parallel Distrib Comput 2010 70 4 323-329
[18]
Ijaz S and Ullah Munir E MOPT: list-based heuristic for scheduling workfows in cloud environment J Supercomput 2009 75 3740-3768
[19]
Munir EU, Mohsin S, Hussain A, Nisar MW, Ali S (2013) SDBATS: a novel algorithm for task scheduling in heterogeneous computing systems. In: Proceedings of IEEE IPDPS workshops (IPDPSW), 2013
[20]
AlEbrahim S and Ahmad I Task scheduling for heterogeneous computing systems J Supercomput 2017 73 2313-2338
[21]
Ilavarasan E and Thambidura P Low complexity performance effective task scheduling algorithm for heterogeneous computing environments J Comput Sci 2007 3 2 94-103
[22]
Ahmad I and Kwok YK On exploiting task duplication in parallel program scheduling IEEE Trans Parallel Distrib Syst 1998 9 9 872-892
[23]
Baskiyar S and Dickinson C Scheduling directed a-cyclic graph on a bounded set of heterogeneous processors using task duplication J Parallel Distrib Comput 2005 65 911-921
[24]
Agarwal A, Kumar P (2009) Economical duplication based task scheduling for heterogeneous and homogeneous computing systems. In: IEEE international advance computing conference, 2009, pp 6–7
[25]
Boeres C, Filho JV, Rebello VEF (2004) A cluster based strategy for scheduling task on heterogeneous processors. In: Proceedings of 16th symposium on computer architecture and high performance computing (SBAC-PAD), 2004, pp 214–221
[26]
Cirou B, Jeannot E (2001) Triplet: a clustering scheduling algorithm for heterogeneous systems. In: International conference on parallel processing workshops, pp 231–236
[27]
Kanemitsu H, Hanada M, and Nakazato H Clustering-based task scheduling in a large number of heterogeneous processors IEEE Trans Parallel Distrib Syst 2016 27 11 3144-3157 (2)
[28]
Bonomi F, Milito R, Natarajan P, Zhu J (2014) Fog computing: A platform for internet of things and analytics. In: Big data and internet of things: a roadmap for smart environments. Springer, pp 169–186
[29]
Masood A, Ullah Munir E, Mustafa Rafique M, Khan SU (2015) HETS: heterogeneous edge and task scheduling algorithm for heterogeneous computing systems. In: 2015 IEEE 17th international conference on high performance computing and communications (HPCC)
[30]
Singh S, Chiu Y, Tsai Y, Yang J (2016) Mobile edge fog computing in 5G era: architecture and implementation. In: IEEE international computer symposium (ICS), pp 731–735
[31]
Cisco Systems (2016) Fog computing and the internet of things: extend the cloud to where the things are, p 6. http://www.cisco.com. Accessed 10 Jan 2019
[32]
Sakellariou R, Zhao H (2004) A hybrid heuristic for dag scheduling on heterogeneous systems. In: 18th international symposium on parallel and distributed processing. IEEE, p 111
[33]
Guoqi X, Renfa L, and Keqin L Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems JPDC 2015 83 C 1-12
[34]
Shirahata K, Sato H, Matsuoka S (2010) Hybrid map task scheduling for gpu-based heterogeneous clusters. In: Cloud computing technology and science (CloudCom), pp 733–740
[35]
Zhao H, Sakellariou R (2003) An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. In: Euro-Par 2003. Parallel processing. Springer, pp 189–194
[36]
Ahmed A, Ahmed E ( 2016) A survey on mobile edge computing. In: Intelligent systems and control (ISCO). 10th international conference on. IEEE, pp 1–8
[37]
Satyanarayanan M The emergence of edge computing Computer 2017 50 1 30-39
[38]
Datta SK, Bonnet C, Haerri J (2015) Fog computing architecture to enable consumer centric internet of things services. In: International symposium on consumer electronics (ISCE), pp 1–2
[39]
Pahl C, Lee B, (2015) Containers and clusters for edge cloud architectures—a technology review. In: Future internet of things and cloud (FiCloud). 3rd international conference on. IEEE, pp 379–386
[40]
Tao Y and Gerasoulis A ADSC: scheduling parallel tasks on an unbounded number of processors IEEE TPDS 1994 5 9 951-967
[41]
Gulzar Ahmad S, Ullah Munir E, Nisar W (2011) A segmented approach for dag scheduling in heterogeneous environment. In: 12th international conference on parallel and distributed computing. Applications and technologies (PDCAT). IEEE, pp 362–367
[42]
Grewe D, O’Boyle MFP (2011) A static task partitioning approach for heterogeneous systems using opencl. In: Proceedings of the 20th international conference on compiler construction, vol 201. Springer, pp 286–305.
[43]
Canon L-C, Jeannot E, Sakellariou J, and Zhang W Comparative evaluation of the robustness of dag scheduling heuristics Grid Comput 2008
[44]
Chen H, Liu XZG, and Pedrycz W Ushncertainty-aware online scheduling for real-time workflows in cloud service environment IEEE Trans Serv Comput 2017 10 6 929-941
[45]
Prasad Rima B and Maier M Workflow scheduling in multi-tenant cloud computing environments IEEE Trans Parallel Distrib Syst 2017 28 1 290-304
[46]
Rodriguez MA and Buyya R Scheduling dynamic workloads in multi-tenant scientific workflow as a service platforms Future Gener Comput Syst 2018 79 739-750
[47]
Li X, Qian L, and Ruiz R Cloud workflow scheduling with deadlines and time slot availability IEEE Trans Serv Comput 2016 11 2 329-340
[48]
Liu Z, Yang X, Yang Y, Wang K, and Mao G DATS: dispersive stable task scheduling in heterogeneous fog networks IEEE Internet Things J 2019 6 2 3423-3436
[49]
Li H, Louis-Claude C, Henri C, Yves R, and Frederic V Checkpointing workflows for fail-stop errors IEEE Trans Comput 2018 67 8 1105-1120
[50]
Vaquero LM and Rodero-Merino L Finding your way in the fog: towards a comprehensive definition of fog computing SIGCOMM Comput Commun Rev 2014 44 5 27-32

Cited By

View all
  • (2024)Multiprocessor Task Scheduling Optimization for Cyber-Physical System Using an Improved Salp Swarm Optimization AlgorithmSN Computer Science10.1007/s42979-023-02517-25:1Online publication date: 8-Jan-2024
  • (2024)An efficient resource allocation of IoT requests in hybrid fog–cloud environmentThe Journal of Supercomputing10.1007/s11227-023-05586-580:4(4600-4624)Online publication date: 1-Mar-2024
  • (2024)RAPTS: resource aware prioritized task scheduling technique in heterogeneous fog computing environmentCluster Computing10.1007/s10586-024-04612-227:9(13353-13377)Online publication date: 1-Dec-2024
  • Show More Cited By

Index Terms

  1. An improved list-based task scheduling algorithm for fog computing environment
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Computing
      Computing  Volume 103, Issue 7
      Jul 2021
      258 pages

      Publisher

      Springer-Verlag

      Berlin, Heidelberg

      Publication History

      Published: 01 July 2021
      Accepted: 02 March 2021
      Received: 10 December 2019

      Author Tags

      1. Directed acyclic graphs
      2. Makespan
      3. List scheduling
      4. Fog environment
      5. Task scheduling

      Author Tags

      1. 68W10
      2. 68W15

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 10 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Multiprocessor Task Scheduling Optimization for Cyber-Physical System Using an Improved Salp Swarm Optimization AlgorithmSN Computer Science10.1007/s42979-023-02517-25:1Online publication date: 8-Jan-2024
      • (2024)An efficient resource allocation of IoT requests in hybrid fog–cloud environmentThe Journal of Supercomputing10.1007/s11227-023-05586-580:4(4600-4624)Online publication date: 1-Mar-2024
      • (2024)RAPTS: resource aware prioritized task scheduling technique in heterogeneous fog computing environmentCluster Computing10.1007/s10586-024-04612-227:9(13353-13377)Online publication date: 1-Dec-2024
      • (2024)A multiobjective optimization of task workflow scheduling using hybridization of PSO and WOA algorithms in cloud-fog computingCluster Computing10.1007/s10586-024-04522-327:8(10921-10952)Online publication date: 1-Nov-2024
      • (2024)AI-based & heuristic workflow scheduling in cloud and fog computing: a systematic reviewCluster Computing10.1007/s10586-024-04442-227:8(10265-10298)Online publication date: 1-Nov-2024
      • (2024)A new approach for service activation management in fog computing using Cat Swarm Optimization algorithmComputing10.1007/s00607-024-01302-0106:11(3537-3572)Online publication date: 4-Jul-2024
      • (2023)Resource Management in Cloud and Cloud-influenced Technologies for Internet of Things ApplicationsACM Computing Surveys10.1145/357172955:12(1-37)Online publication date: 2-Mar-2023
      • (2023)A Memory-Constraint-Aware List Scheduling Algorithm for Memory-Constraint Heterogeneous Muti-Processor SystemIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.322937334:4(1082-1099)Online publication date: 1-Apr-2023
      • (2023)Fault-tolerant scheduling of graph-based loads on fog/cloud environments with multi-level queues and LSTM-based workload predictionComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2023.109964235:COnline publication date: 1-Nov-2023
      • (2023)PPTS-PSO: a new hybrid scheduling algorithm for scientific workflow in cloud environmentMultimedia Tools and Applications10.1007/s11042-023-14739-w82:21(33015-33038)Online publication date: 4-Mar-2023
      • Show More Cited By

      View Options

      View options

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media