scholarly journals Scheduling Parallel Work ow Applications with Energy-Aware on a Cloud Platform

Author(s):  
Thanawut Thanavanich ◽  
Putchong Uthayopas

An inefficient energy consumption of computing resources in a large cloud datacenter is a very important issue since the energy cost is now a major part of the operating expense. In this paper, the challenge of scheduling a parallel application on a cloud platform to achieve both time and energy efficiency is addressed by two new proposed algorithms Enhancing Heterogonous Earliest Finish Time (EHEFT) and Enhancing Critical Path on a Processor (ECPOP). The objective of these two algorithms is to reduce the energy consumption while achieving the best execution makespan. The algorithms use a metric that identifies and turns off the inefficient processors to reduce energy consumption. Then, the application tasks are rescheduled on fewer processors to obtain better energy efficiency. The experimental results from the simulation using real-world application workload show that the proposed algorithms not only reduce the energy consumption, but also maintain an acceptable scheduling quality. Thus, these algorithms can be employed to substantially reduce the operating cost in a large cloud computing system.

2015 ◽  
Vol 8 (1) ◽  
pp. 206-210 ◽  
Author(s):  
Yu Junyang ◽  
Hu Zhigang ◽  
Han Yuanyuan

Current consumption of cloud computing has attracted more and more attention of scholars. The research on Hadoop as a cloud platform and its energy consumption has also received considerable attention from scholars. This paper presents a method to measure the energy consumption of jobs that run on Hadoop, and this method is used to measure the effectiveness of the implementation of periodic tasks on the platform of Hadoop. Combining with the current mainstream of energy estimate formula to conduct further analysis, this paper has reached a conclusion as how to reduce energy consumption of Hadoop by adjusting the split size or using appropriate size of workers (servers). Finally, experiments show the effectiveness of these methods as being energy-saving strategies and verify the feasibility of the methods for the measurement of periodic tasks at the same time.


Author(s):  
Shiv Prakash ◽  
Deo Prakash Vidyarthi

Consumption of energy in the large computing system is an important issue not only because energy sources are depleting fast but also due to the deteriorating environmental conditions. A computational grid is a large heterogeneous distributed computing platform which consumes enormous energy in the task execution. Energy-aware job scheduling, in the computational grid, is an important issue that has been addressed in this work. If the tasks are properly scheduled, keeping the optimal energy concern, it is possible to save the energy consumed by the system in the task execution. The prime objective, in this work, is to schedule the dependent tasks of a job, on the grid nodes with optimal energy consumption. Energy consumption is estimated with the help of Dynamic Voltage Frequency Scaling (DVFS). Makespan, while optimizing the energy consumption, is also taken care of in the proposed model. GA is applied for the purpose and therefore the model is named as Energy Aware Genetic Algorithm (EAGA). Performance evaluation of the proposed model is done using GridSim simulator. A comparative study with other existing models viz. min-min and max-min proves the efficacy of the proposed model.


Author(s):  
Zhaolin Wang ◽  
Zhezhuang Xu ◽  
Renxu Xie ◽  
Haotian Yan

Location service is an efficient solution to handle actor mobility in wireless sensor and actor networks. Geographic hashing location service (GHLS) is a flat hashing-based protocol which has better energy efficiency than other location service protocols. Nevertheless, GHLS suffers from unbalanced energy consumption due to the fixed hashed region. In this paper, we propose a new protocol termed as GHLS-R<sup>2</sup> to achieve load balance in two aspects: location server rotation and energy-aware geographic routing. Simulation results show that GHLS-R<sup>2</sup> protocol can effectively balance the energy consumption, and hence prolong the network lifetime significantly.


2017 ◽  
Vol 102 ◽  
pp. 103-114 ◽  
Author(s):  
Dinh-Mao Bui ◽  
YongIk Yoon ◽  
Eui-Nam Huh ◽  
SungIk Jun ◽  
Sungyoung Lee

2021 ◽  
Vol Volume 34 - 2020 - Special... ◽  
Author(s):  
Simon Pierre Dembele ◽  
Ladjel Bellatreche ◽  
Carlos Ordonez ◽  
Nabil Gmati ◽  
Mathieu Roche ◽  
...  

Soumission à Episciences International audience Computers and electronic machines in businesses consume a significant amount of electricity, releasing carbon dioxide (CO2), which contributes to greenhouse gas emissions. Energy efficiency is a pressing concern in IT systems, ranging from mobile devices to large servers in data centers, in order to be more environmentally responsible. In order to meet the growing demands in the awareness of excessive energy consumption, many initiatives have been launched on energy efficiency for big data processing covering electronic components, software and applications. Query optimizers are one of the most power consuming components of a DBMS. They can be modified to take into account the energetical cost of query plans by using energy-based cost models with the aim of reducing the power consumption of computer systems. In this paper, we study, describe and evaluate the design of three energy cost models whose values of energy sensitive parameters are determined using the Nonlinear Regression and the Random Forests techniques. To this end, we study in depth the operating principle of the selected DBMS and present an analysis comparing the performance time and energy consumption of typical queries in the TPC benchmark. We perform extensive experiments on a physical testbed based on PostreSQL, MontetDB and Hyrise systems using workloads generatedusing our chosen benchmark to validate our proposal. Les ordinateurs et les machines électroniques des entreprises consomment une quantité importante d’électricité, libérant ainsi du dioxyde de carbone (CO2), qui contribue aux émissions de gaz à effet de serre. L’efficacité énergétique est une préoccupation urgente dans les systèmesinformatiques, partant des équipements mobiles aux grands serveurs dans les centres de données, afin d’être plus respectueux envers l’environnement. Afin de répondre aux exigences croissantes en matière de sensibilisation à l’utilisation excessive de l’énergie, de nombreuses initiatives ont été lancées sur l’efficacité énergétique pour le traitement des données massives couvrant les composantsélectroniques, les logiciels et les applications. Les optimiseurs de requêtes sont l’un des composants les plus énergivores d’un SGBD. Ils peuvent être modifiés pour prendre en compte le coût énergétique des plans des requêtes à l’aide des modèles de coût énergétiques intégrés dans l’optimiseur dans le but de réduire la consommation électrique des systèmes informatiques. Dans cet article, nousétudions, décrivons et évaluons la conception de trois modèles de coût énergétique dont les valeurs des paramètres sensibles à l’énergie sont définis en utilisant la technique de la Régression non linéaire et la technique des forêts aléatoires. Pour ce fait, nous menons une étude approfondie du principe de fonctionnement des SGBD choisis et présentons une analyse des performances en termes de temps et énergie sur des requêtes typiques du benchmarks TPC-H. Nous effectuons des expériences approfondies basées sur les systèmes PostgreSQL, MonetDB et Hyrise en utilisant un jeu de données généré à partir du benchmarks TPC-H afin de valider nos propositions.


Author(s):  
John Broderick ◽  
Dawn Tilbury ◽  
Ella Atkins

This paper presents a method to compare area coverage paths in the context of energy efficiency. We examine cover-age paths created from the Boustrophedon Decomposition and Spanning Tree methods in an optimal control setting. Our cost function weights the force inputs to drive the robot and the currently uncovered region. We derive an optimal traversal of the path in a point-to-point manner. In particular, we introduce a meas function that represents the percentage of the area that is still to be visited. The effect of meas on the optimal traversal is derived. Trade-offs between area covered versus the time and energy required are presented. A simple trajectory modification allows the vehicle to continue moving through a turn to reduce energy consumption.


Author(s):  
Poria Pirozmand ◽  
Ali Asghar Rahmani Hosseinabadi ◽  
Maedeh Farrokhzad ◽  
Mehdi Sadeghilalimi ◽  
Seyedsaeid Mirkamali ◽  
...  

AbstractThe cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods.


Author(s):  
Juan P. Silva ◽  
Ernesto Dufrechou ◽  
Pabl Ezzatti ◽  
Enrique S. Quintana-Ortí ◽  
Alfredo Remón ◽  
...  

The high performance computing community has traditionally focused uniquely on the reduction of execution time, though in the last years, the optimization of energy consumption has become a main issue. A reduction of energy usage without a degradation of performance requires the adoption of energy-efficient hardware platforms accompanied by the development of energy-aware algorithms and computational kernels. The solution of linear systems is a key operation for many scientific and engineering problems. Its relevance has motivated an important amount of work, and consequently, it is possible to find high performance solvers for a wide variety of hardware platforms. In this work, we aim to develop a high performance and energy-efficient linear system solver. In particular, we develop two solvers for a low-power CPU-GPU platform, the NVIDIA Jetson TK1. These solvers implement the Gauss-Huard algorithm yielding an efficient usage of the target hardware as well as an efficient memory access. The experimental evaluation shows that the novel proposal reports important savings in both time and energy-consumption when compared with the state-of-the-art solvers of the platform.


Author(s):  
Xiaohong Wang

With the vigorous development of information technology, cloud computing, as a distributed computing technology, has become a research hotspot in the industry. The cloud computing system has a huge resource pool. In order to meet user-specific quality of service requests, it needs to perform reasonable scheduling of various tasks. Under the premise of ensuring high computing performance and better service quality in the cloud computing environment, system energy efficiency optimization has become a key issue to be promoted in the promotion of cloud computing. The research purpose of this paper is to study the fuzzy decoupling energy efficiency optimization algorithm in cloud computing environment. This paper designs a fuzzy decoupling energy efficiency optimization scheme.


Sign in / Sign up

Export Citation Format

Share Document