Naga Raju Challa

Department of Communication Engineering

School of Electronics Engineering

Vellore Campus

Sunil Kumar Reddy T

Kumar P.R

Raj Kumar S.R.

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Power Aware-Based Workflow Model of Grid Computing Using Ant-Based Heuristic Approach

Advances in Intelligent Systems and Computing Big Data Analytics

International Journal of Communication Networks and Distributed Systems

Power aware framework for scheduling tasks in grid-based workflows

In recent scenarios, power consumption is critical for battery operated devices. There are wide varieties of implementations of dynamic voltage scaling (DVS) algorithm to reduce energy or power. This paper presents a framework called PERMA, power estimator and reducer for multi-core architectures. The PERMA estimates power consumption and suggests analytical procedure to reduce power consumption at basic block level rather than at region level using clock cycles of instructions for a particular architecture (x86). PERMA estimates execution time for each basic block for various voltage levels and chooses best out of these. Therefore, PERMA evaluates the extent to which the voltage can be varied for various Basic Blocks to reduce power consumption without degrading execution time. Finally, it is tested for matrix multiplication of various sizes. There is an improvement in the execution time up to 33.43% with PERMA and 21.89% without PERMA. © 2013 Inderscience Enterprises Ltd.

A framework for power estimation and reduction in multi-core architectures using basic block approach

In cloud computing environments, resources and infrastructure are provided as a service over internet on demand. The users are interested in reducing the service cost provided by the cloud service providers. Scheduling tasks of workflows play a vital role in determining performance of cloud computing systems. Workflows have many tasks in it and are interdependent on each other. Time critical workflows comprise of a collection of tasks which should be completed as early as possible so that other workflows get its turn. The budget involved in executing the time critical tasks is very high. The execution cost increases whenever we try to reduce the execution time. In this paper, we propose a method called versatile time-cost algorithm (VTCA) to schedule time critical workflows with minimum cost. VTCA will schedule the tasks to complete in earliest possible time as well as optimise the cost involved in resource provisioning. The results of experiments conducted using CloudSim simulator show that our scheduling policy minimises the completion time of workflows than other existing algorithms like min-min and fair max-min by 5% to 30% and it also reduces the costs by 5% to 35%. © 2013 Inderscience Enterprises Ltd.

Versatile time-cost algorithm (VTCA) for scheduling non-preemptive tasks of time critical workflows in cloud computing systems

Scheduling of tasks in cloud computing is an NP-hard optimization problem. Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing (HBB-LB), which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue. © 2013 Elsevier B.V.

Applied Soft Computing

Honey bee behavior inspired load balancing of tasks in cloud computing environments

2015 Second International Conference on Computing Technology and Information Management (ICCTIM)

Strategic oscillation for exploitation and exploration of ACS algorithm for job scheduling in static grid computing

Journal	Data powered by TypesetAdvances in Intelligent Systems and Computing Big Data Analytics
Publisher	Data powered by TypesetSpringer Singapore
ISSN	2194-5357
Open Access	0