An efficient algorithm for monitoring virtual machines in clouds

Cloud computing systems consist of a pool of Virtual Machines (VMs), which are installed physically on the provider's set up. The main aim of the VMs is to offer the service to the end users. With the current increasing demand for the cloud VMs, there is always a huge requirement to secure the cloud systems. To keep these cloud systems secured, they need a continuous and a proper monitoring. For the purpose of monitoring, several algorithms are available with FVMs. FVM is a forensic virtual machine which monitors the threats among the VMs. Our formulated algorithm runs on FVM. In this paper, we formulate the Random-Start-Round-Robin algorithm for monitoring inside FVM

Iso-energy-efficiency: An approach to power-constrained parallel computation

Future large scale high performance supercomputer systems require high energy efficiency to achieve exaflops computational power and beyond. Despite the need to understand energy efficiency in high-performance systems, there are few techniques to evaluate energy efficiency at scale. In this paper, we propose a system-level iso-energy-efficiency model to analyze, evaluate and predict energy-performance of data intensive parallel applications with various execution patterns running on large scale power-aware clusters. Our analytical model can help users explore the effects of machine and application dependent characteristics on system energy efficiency and isolate efficient ways to scale system parameters (e.g. processor count, CPU power/frequency, workload size and network bandwidth) to balance energy use and performance. We derive our iso-energy-efficiency model and apply it to the NAS Parallel Benchmarks on two power-aware clusters. Our results indicate that the model accurately predicts total system energy consumption within 5% error on average for parallel applications with various execution and communication patterns. We demonstrate effective use of the model for various application contexts and in scalability decision-making

3E: Energy-Efficient Elastic Scheduling for Independent Tasks in Heterogeneous Computing Systems

Reducing energy consumption is a major design constraint for modern heterogeneous computing systems to minimize electricity cost, improve system reliability and protect environment. Conventional energy-efficient scheduling strategies developed on these systems do not sufficiently exploit the system elasticity and adaptability for maximum energy savings, and do not simultaneously take account of user expected finish time. In this paper, we develop a novel scheduling strategy named energy-efficient elastic (3E) scheduling for aperiodic, independent and non-real-time tasks with user expected finish times on DVFS-enabled heterogeneous computing systems. The 3E strategy adjusts processors’ supply voltages and frequencies according to the system workload, and makes trade-offs between energy consumption and user expected finish times. Compared with other energy-efficient strategies, 3E significantly improves the scheduling quality and effectively enhances the system elasticity

A hybrid genetic algorithm with mapreduce technique for cloud computing energy efficiency

Computer clouds generally comprise large power-consuming data centers as they are designed to support the elasticity and scalability required by customers. However, while cloud computing reduces energy consumption for customers, it is an issue for providers who have to deal with increasing demand and performance expectations. This creates the need for mechanisms to improve the energy-efficiency of cloud computing data centers while maintaining desired levels of performance. This research seeks to formulate a hybrid algorithm based on Genetic algorithm and MapReduce algorithm techniques to further promote energy efficiency in the cloud computing platform. The function of the MapReduce algorithm is to optimize scheduling performance which is one of the more efficient techniques for handling large data in servers. Genetic algorithm is effective in optimally measuring the value of operations and allows for the minimization of energy efficiency where it includes the formula for single optimization energy efficiency. A series of simulations were developed to evaluate the effectiveness of the proposed algorithm. The evaluation results show the amount of Information Technology equipment power required for Power Usage Effectiveness values to optimize energy usage where the performance of the proposed algorithm is 6% better than the previous genetic algorithm and 5% better than Hadoop MapReduce scheduling on low load conditions. On the other hand, the proposed algorithm improved energy efficiency in comparison with the previous work

An Efficient Biobjective Heuristic for Scheduling Workflows on Heterogeneous DVS-Enabled Processors

Energy consumption has recently become a major concern to multiprocessor computing systems, of which the primary performance goal has traditionally been reducing execution time of applications. In the context of scheduling, there have been increasing research interests on algorithms using dynamic voltage scaling (DVS), which allows processors to operate at lower voltage supply levels at the expense of sacrificing processing speed, to acquire a satisfactory trade-off between quality of schedule and energy consumption. The problem considered in this paper is to find a schedule for a workflow, which is normally a precedence constrained application, on a bounded number of heterogeneous DVS-enabled processors, so as to minimize both makespan (overall execution time of the application) and energy consumption. A fast and efficient heuristic is proposed and evaluated using simulation with two real-world applications as well as randomly generated ones