Monika Yadav
Research Subjects
Monika Yadav has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Atul Mishra
JC Bose University of Science and Technology, YMCA, Faridabad, India
4 shared publications - Arushi Sharma
The NORTHCAP University
1 shared publication Atul Mishra
J.C. Bose University of Science and Technology, YMCA, Faridabad, India
1 shared publication- Bhavay Makkar
The NORTHCAP University
1 shared publication - Krati Arora
The NORTHCAP University
1 shared publication - Sahil
The NORTHCAP University
1 shared publication
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 75-88
Security Implications of Quantum Computation in Cloud Environment
- 2 September 2026
- Published by Springer Nature
- p. 75-88
Security Implications of Quantum Computation in Cloud Environment
- 2 January 2026
- Published by Springer Nature
- p. 13-24
Workflow Scheduling in Cloud Computing: Challenges & Opportunities
- 2 January 2026
- Published by Springer Nature
- p. 13-24
Workflow Scheduling in Cloud Computing: Challenges & Opportunities
- Open Access
- 20 September 2025
- Published by Springer Nature in Discover Computing
- Vol. 28 (1) , 1-39
Energy-efficient workflow scheduling using dynamic task clustering for sustainable cloud computing
- 20 September 2025
- Published by Springer Nature in Discover Computing
- Vol. 28 (1) , 1-39
Open AccessEnergy-efficient workflow scheduling using dynamic task clustering for sustainable cloud computing
- 28 January 2025
- Published by Springer Nature
- p. 293-307
Enhancing Workflow Efficiency: Innovative Workload Clustering in Cloud Environments
- 28 January 2025
- Published by Springer Nature
- p. 293-307
Enhancing Workflow Efficiency: Innovative Workload Clustering in Cloud Environments
- 19 September 2024
- Published by Springer Nature
- p. 29-39
A Hybrid Approach for Scalable Load Balancing Using Virtual Machine Migration and Dynamic Resource Allocation
- 19 September 2024
- Published by Springer Nature
- p. 29-39
A Hybrid Approach for Scalable Load Balancing Using Virtual Machine Migration and Dynamic Resource Allocation
- Open Access
- 17 January 2023
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 12 (1) , 1-14
An enhanced ordinal optimization with lower scheduling overhead based novel approach for task scheduling in cloud computing environment
Efficient utilization of available computing resources in Cloud computing is one of the most challenging problems for cloud providers. This requires the design of an efficient and optimal task-scheduling strategy that can play a vital role in the functioning and overall performance of the cloud computing system. Optimal Schedules are specifically needed for scheduling virtual machines in fluctuating & unpredictable dynamic cloud scenario. Although there exist numerous approaches for enhancing task scheduling in the cloud environment, it is still an open issue. The paper focuses on an improved & enhanced ordinal optimization technique to reduce the large search space for optimal scheduling in the minimum time to achieve the goal of minimum makespan. To meet the current requirement of optimal schedule for minimum makespan, ordinal optimization that uses horse race conditions for selection rules is applied in an enhanced reiterative manner to achieve low overhead by smartly allocating the load to the most promising schedule. This proposed ordinal optimization technique and linear regression generate optimal schedules that help achieve minimum makespan. Furthermore, the proposed mathematical equation, derived using linear regression, predicts any future dynamic workload for a minimum makespan period target.
- 17 January 2023
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 12 (1) , 1-14
Open AccessAn enhanced ordinal optimization with lower scheduling overhead based novel approach for task scheduling in cloud computing environment
Efficient utilization of available computing resources in Cloud computing is one of the most challenging problems for cloud providers. This requires the design of an efficient and optimal task-scheduling strategy that can play a vital role in the functioning and overall performance of the cloud computing system. Optimal Schedules are specifically needed for scheduling virtual machines in fluctuating & unpredictable dynamic cloud scenario. Although there exist numerous approaches for enhancing task scheduling in the cloud environment, it is still an open issue. The paper focuses on an improved & enhanced ordinal optimization technique to reduce the large search space for optimal scheduling in the minimum time to achieve the goal of minimum makespan. To meet the current requirement of optimal schedule for minimum makespan, ordinal optimization that uses horse race conditions for selection rules is applied in an enhanced reiterative manner to achieve low overhead by smartly allocating the load to the most promising schedule. This proposed ordinal optimization technique and linear regression generate optimal schedules that help achieve minimum makespan. Furthermore, the proposed mathematical equation, derived using linear regression, predicts any future dynamic workload for a minimum makespan period target.