Pillareddy Vamsheedhar Reddy

Dr. Pillareddy Vamsheedhar Reddy


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PRPillareddy Vamsheedhar Reddy
Pillareddy Vamsheedhar Reddy
GKGanesh Reddy Karri
Ganesh Reddy Karri
Cloud computing is a prominent approach for complex scientific and business workflow applications in the pay-as-you-go model. Workflow scheduling poses a challenge in cloud computing due to its widespread applications in physics, astronomy, bioinformatics, and healthcare, etc. Resource allocation for workflow scheduling is problematic due to the computationally intensive nature of the workflow, the interdependence of tasks, and the heterogeneity of cloud resources. During resource allocation, the time and cost of execution are significant issues in the cloud-computing environment, which can potentially degrade the service quality that is provided to end users. This study proposes a method focusing on makespan, average utilization, and cost. The authors propose a task’s dynamic priority for workflow scheduling using MONWS, which uses the min-max algorithm to minimize the finish time and maximize resource utilization by calculating the dynamic threshold value for scheduling tasks on virtual machines. When the experimental results were compared to existing algorithms, MONWS achieved a 35% improvement in makespan, an 8% increase in maximum average cloud utilization, and a 4% decrease in cost.

11 April 2023 in IEEE Access
Verified
Journal Article
Open access
PRPillareddy Vamsheedhar Reddy
Pillareddy Vamsheedhar Reddy
GKGanesh Reddy Karri
Ganesh Reddy Karri
Cloud computing is a promising platform for running massive workflow applications based on a pay-per-use model. In cloud computing, the reduction of energy consumption and providing security to workflow scheduling are the key research areas. The primary focus of the existing algorithms, viz., particle swarm optimization (PSO), crow Search optimization (CSO) and Other non-metaheuristic algorithms like Round Robbin(RR), SJF, Min-Min, Min-Max etc., is based on the execution time and cost of the workflow applications as a budget constraint. However, these algorithms failed to adequately determine energy consumption, resource utilization, and security in workflow scheduling. To address this issue, a multi-objective scheduling framework is proposed. In this paper, the framework performs dynamic workflow scheduling using universal unique identification- Blake (UUID-Blake), Manhattan Distance-Partition around algorithm (MD-PAM), Linear Scaling-Crow Search Optimization (LS-CSO), Anova-Recurrent Neural Network. The implementation of this framework was achieved in three phases (Phase 1, Phase 2, and Phase 3). Phase 1 is about user registration and authentication using UUID-Blake, which enhances security by allowing legitimate users into the cloud environment. Phase 2 deals with clustering and resource monitoring using MD-PAM and A-RNN, to reduce makespan the similar tasks are clustered using task length and maximize the resource utilization by predicting the resource availability. Phase 3 deals with the scheduling of dynamic workflows using LS-CSO by selecting suitable virtual machines. We have considered the heterogeneous computing scheduling problem (HCSP) and grid workload archive (GWA)-T-12 Bitbrains datasets for comparing our proposed framework with existing works. Based on the result analysis, the proposed LS-SCO outperformed when compared with the algorithms CSO,PSO and RR has achieved better performance.

15 September 2025 in Sensors
Verified
Journal Article
Open access
PDF file
Sudheer MangalampalliSudheer Mangalampalli
Sudheer Mangalampalli
PRPillareddy Vamsheedhar Reddy
Pillareddy Vamsheedhar Reddy
GKGanesh Reddy Karri
Ganesh Reddy Karri
GTGayathri Tippani
Gayathri Tippani
KHKota Harini
Kota Harini
The number of IoT devices has been increasing at a rapid rate, and the advent of information-intensive Internet of Multimedia Things (IoMT) applications has placed serious challenges on computing infrastructure, especially for latency, energy efficiency, and responsiveness to tasks. The legacy cloud-centric approach cannot meet such requirements because it suffers from local latency and central resource allocation. To overcome such limitations, fog computing proposes a decentralized model by reducing latency and bringing computation closer to data sources. However, effective scheduling of tasks within heterogeneous and resource-limited fog environments is still an NP-hard problem, especially in multi-criteria optimization and priority-sensitive situations. This research work proposes a new simulated annealing (SA)-based task scheduling framework to perform multi-objective optimization for fog computing environments. The proposed model minimizes makespan, energy consumption, and execution cost, and integrates a priority-aware penalty function to provide high responsiveness to high-priority tasks. The SA algorithm searches the scheduling solution space by accepting potentially sub-optimal configurations during the initial iterations and further improving towards optimality as the temperature decreases. Experimental analyses on benchmark datasets obtained from Google Cloud Job Workloads demonstrate that the proposed approach outperforms ACO, PSO, I-FASC and M2MPA approaches in terms of makespan, energy consumption, execution cost, and reliability at all task volume scales. These results confirm the proposed SA-based scheduler as a scalable and effective solution for smart task scheduling within fog-enabled IoT infrastructures.

13 August 2024
Verified
Book Chapter
Closed access
PDF file
Santhosh Kumar MedishettiSanthosh Kumar Medishetti
Santhosh Kumar Medishetti
PRPillareddy Vamsheedhar Reddy
Pillareddy Vamsheedhar Reddy
BMBushra Muneeb
Bushra Muneeb
SPSudha Rani Palakuri
Sudha Rani Palakuri
UGUma Maheshwari Garela
Uma Maheshwari Garela
KKK. Vamshi Krishna
K. Vamshi Krishna