Multi-level parallel scheduling of dependent-tasks using graph-partitioning and hybrid approaches over edge-cloud
An efficient scheduling of dependent-tasks over edge-cloud is the key for achieving better utilization of computational resources and timely completion of interdependent tasks for scientific as well as defence-oriented applications. Many applications comprise several tasks that are dependent in natu...
Published in: | Soft Computing |
---|---|
Main Author: | Kaur M.; Kadam S.; Hannoon N. |
Format: | Article |
Language: | English |
Published: |
Springer Science and Business Media Deutschland GmbH
2022
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127804420&doi=10.1007%2fs00500-022-07048-1&partnerID=40&md5=b98fb5897c01b8d735112fab96e02625 |
Similar Items
-
EETS: An energy-efficient task scheduler in cloud computing based on improved DQN algorithm
by: Hou H.; Ismail A.
Published: (2024) -
Energy efficient task scheduling based on deep reinforcement learning in cloud environment: A specialized review
by: Hou H.; Agos Jawaddi S.N.; Ismail A.
Published: (2024) -
Whale Optimization Algorithm (WOA) for Task Scheduling Problem in Multi-Processors Environment
by: Suliman S.I.; Khalish M.N.; Yusof Y.W.M.; Rahman F.Y.A.
Published: (2024) -
On the chromaticity of complete multipartite graphs with certain edges added
by: Lau G.C.; Peng Y.H.
Published: (2009) -
On friendly index sets of the edge-gluing of complete graph and cycles
by: Lau G.-C.; Gao Z.-B.; Lee S.-M.; Sun G.-Y.
Published: (2016)