Evidence map›Paper›PMID 39300104›Full record

ArticleScientific reports2024

Efficient deep reinforcement learning based task scheduler in multi cloud environment.

Sudheer Mangalampalli, Ganesh Reddy Karri, M V Ratnamani, Sachi Nandan Mohanty, Bander A Jabr, Yasser A Ali, Shahid Ali, Barno Sayfutdinovna Abdullaeva

Abstract read
In one paragraph

Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Sudheer MangalampalliDepartment of CSE, Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal, India. ms.sudheer@manipal.edu.
Ganesh Reddy KarriSchool of Computer Science and Engineering, VIT-AP University, Amaravati, AP, 522237, India.
M V RatnamaniAditya Institute of Technology and Management, Tekkali, Srikakulam, AP, 530021, India.
Sachi Nandan MohantySchool of Computer Science and Engineering, VIT-AP University, Amaravati, AP, 522237, India.
Bander A JabrDepartment of Computer Engineering, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, 11543, Riyadh, Saudi Arabia.
Yasser A AliDepartment of Computer Engineering, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, 11543, Riyadh, Saudi Arabia.
Shahid AliBattery Management System, Research and Development Center, EVE Lithium Energy Company, Huizhou, People's Republic of China. alikhan@pku.edu.cn.
Barno Sayfutdinovna AbdullaevaDepartment of Mathematics and Information Technologies, Vice-Rector for Scientific Affairs, Tashkent State Pedagogical University, Tashkent, Uzbekistan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Task scheduling problem (TSP) is huge challenge in cloud computing paradigm as number of tasks comes to cloud application platform vary from time to time and all the tasks consists of variable length, runtime capacities. All these tasks may generated from various heterogeneous resources which comes onto cloud console directly effects the performance of cloud paradigm with increase in makespan, energy consumption, resource costs. Traditional task scheduling algorithms cannot handle these type of complex workloads in cloud paradigm. Many authors developed Task Scheduling algorithms by using metaheuristic techniques, hybrid approaches but all these algorithms give near optimal solutions but still TSP is a highly challenging and dynamic scenario as it resembles NP hard problem. Therefore, to tackle the TSP in cloud computing paradigm and schedule the tasks in an effective way in cloud paradigm, we formulated Adaptive Task scheduler which segments all the tasks comes to cloud console as sub tasks and fed these to the scheduler which is modeled by Improved Asynchronous Advantage Actor Critic Algorithm(IA3C) to generate schedules. This scheduling process is carried out in two stages. In first stage, all incoming tasks are segmented as sub tasks. After segmentation, all these sub tasks according to their size, execution time, communication time are grouped together and fed to the (ATSIA3C) scheduler. In the second stage, it checks for the above said constraints and disperse them onto the corresponding suitable processing capacity VMs resided in datacenters. Proposed ATSIA3C is simulated on Cloudsim. Extensive simulations are conducted using both fabricated worklogs and as well as realtime supercomputing worklogs. Our proposed mechanism evaluated over baseline algorithms i.e. RATS-HM, AINN-BPSO, MOABCQ. From results it is evident that our proposed ATSIA3C outperforms existing task schedulers by improving makespan by 70.49%. Resource cost is improved by 77.42%. Energy Consumption is improved over compared algorithms 74.24% in multi cloud environment by proposed ATSIA3C.

Indexed as

Cloud computingDeep reinforcement learningMakespanResource costTask scheduling

Identifiers

PMID39300104
PMCPMC11413365

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.