A comparative study on resource allocation and energy efficient job scheduling strategies in large-scale parallel computing systems

In the large-scale parallel computing environment, resource allocation and energy efficient techniques are required to deliver the quality of services (QoS) and to reduce the operational cost of the system. Because the cost of the energy consumption in the environment is a dominant part of the owner’s and user’s budget. However, when considering energy efficiency, resource allocation strategies become more difficult, and QoS (i.e., queue time and response time) may violate. This paper therefore is a comparative study on job scheduling in large-scale parallel systems to: (a) minimize the queue time, response time, and energy consumption and (b) maximize the overall system utilization. We compare thirteen job scheduling policies to analyze their behavior. A set of job scheduling policies includes (a) priority-based, (b) first fit, (c) backfilling, and (d) window-based policies. All of the policies are extensively simulated and compared. For the simulation, a real data center workload comprised of 22385 jobs is used. Based on results of their performance, we incorporate energy efficiency in three policies i.e., (1) best result producer, (2) average result producer, and (3) worst result producer. We analyze the (a) queue time, (b) response time, (c) slowdown ratio, and (d) energy consumption to evaluate the policies. Moreover, we present a comprehensive workload characterization for optimizing system’s performance and for scheduler design. Major workload characteristics including (a) Narrow, (b) Wide, (c) Short, and (d) Long jobs are characterized for detailed analysis of the schedulers’ performance. This study highlights the strengths and weakness of various job scheduling polices and helps to choose an appropriate job scheduling policy in a given scenario.     

Energy and resource efficient workflow scheduling in a virtualized cloud environment

High energy consumption (EC) is one of the leading and interesting issue in the cloud environment. The optimization of EC is generally related to scheduling problem. Optimum scheduling strategy is used to select the resources or tasks in such a way that system performance is not violated while minimizing EC and maximizing resource utilization (RU). This paper presents a task scheduling model for scheduling the tasks on virtual machines (VMs). The objective of the proposed model is to minimize EC, maximize RU, and minimize workflow makespan while preserving the task’s deadline and dependency constraints. An energy and resource efficient workflow scheduling algorithm (ERES) is proposed to schedule the workflow tasks to the VMs and dynamically deploy/un-deploy the VMs based on the workflow task’s requirements. An energy model is presented to compute the EC of the servers. Double threshold policy is used to perceive the server’ status i.e. overloaded/underloaded or normal. To balance the workload on the overloaded/underloaded servers, live VM migration strategy is used. To check the effectiveness of the proposed algorithm, exhaustive simulation experiments are conducted. The proposed algorithm is compared with power efficient scheduling and VM consolidation (PESVMC) algorithm on the accounts of RU, energy efficiency and task makespan. Further, the results are also verified in the real cloud environment. The results demonstrate the effectiveness of the proposed ERES algorithm.

     

Energy efficient job scheduling with workload prediction on cloud data center

Data centers are the backbone of cloud infrastructure platform to support large-scale data processing and storage. More and more business-to-consumer and enterprise applications are based on cloud data center. However, the amount of data center energy consumption is inevitably lead to high operation costs. The aim of this paper is to comprehensive reduce energy consumption of cloud data center servers, network, and cooling systems. We first build an energy efficient cloud data center system including its architecture, job and power consumption model. Then, we combine the linear regression and wavelet neural network techniques into a prediction method, which we call MLWNN, to forecast the cloud data center short-term workload. Third, we propose a heuristic energy efficient job scheduling with workload prediction solution, which is divided into resource management strategy and online energy efficient job scheduling algorithm. Our extensive simulation performance evaluation results clearly demonstrate that our proposed solution has good performance and is very suitable for low workload cloud data center.     

DENS: data center energy-efficient network-aware scheduling

In modern data centers, energy consumption accounts for a considerably large slice of operational expenses. The existing work in data center energy optimization is focusing only on job distribution between computing servers based on workload or thermal profiles. This paper underlines the role of communication fabric in data center energy consumption and presents a scheduling approach that combines energy efficiency and network awareness, named DENS. The DENS methodology balances the energy consumption of a data center, individual job performance, and traffic demands. The proposed approach optimizes the tradeoff between job consolidation (to minimize the amount of computing servers) and distribution of traffic patterns (to avoid hotspots in the data center network).     

Hierarchical genetic-based grid scheduling with energy optimization

An optimization of power and energy consumptions is the important concern for a design of modern-day and future computing and communication systems. Various techniques and high performance technologies have been investigated and developed for an efficient management of such systems. All these technologies should be able to provide good performance and to cope under an increased workload demand in the dynamic environments such as Computational Grids (CGs), clusters and clouds. In this paper we approach the independent batch scheduling in CG as a bi-objective minimization problem with makespan and energy consumption as the scheduling criteria. We use the Dynamic Voltage Scaling (DVS) methodology for scaling and possible reduction of cumulative power energy utilized by the system resources. We develop two implementations of Hierarchical Genetic Strategy-based grid scheduler (Green-HGS-Sched) with elitist and struggle replacement mechanisms. The proposed algorithms were empirically evaluated versus single-population Genetic Algorithms (GAs) and Island GA models for four CG size scenarios in static and dynamic modes. The simulation results show that proposed scheduling methodologies fairly reduce the energy usage and can be easily adapted to the dynamically changing grid states and various scheduling scenarios.     

P-Aware: a proportional multi-resource scheduling strategy in cloud data center

Concentrating on a single resource cannot efficiently cope with the overall high utilization of resources in cloud data centers. Nowadays multiple resource scheduling problem is more attractive to researchers. Some studies achieve progresses in multi-resource scenarios. However, these previous heuristics have obvious limitations in complex software defined cloud environment. Focusing on energy conservation and load balancing, we propose a preciousness model for multiple resource scheduling in this paper. We give the formulation of the problem and propose an innovative strategy (P-Aware). In P-Aware, a special algorithm PMDBP (Proportional Multi-dimensional Bin Packing) is applied in the multi-dimensional bin packing approach. In this algorithm, multiple resources are consumed in a proportional way. Structure and details of PMDBP are discussed in this paper. Extensive experiments demonstrate that our strategy outperforms others both in efficiency and load balancing. Now P-Aware has been implemented in the resource management system in our cooperative company to cut energy consumption and reduce resource contention.     

Multi-prediction based scheduling for hybrid workloads in the cloud data center

Cloud computing can leverage over-provisioned resources that are wasted in traditional data centers hosting production applications by consolidating tasks with lower QoS and SLA requirements. However, the dramatic fluctuation of workloads with lower QoS and SLA requirements may impact the performance of production applications. Frequent task eviction, killing and rescheduling operations also waste CPU cycles and create overhead. This paper aims to schedule hybrid workloads in the cloud data center to reduce task failures and increase resource utilization. The multi-prediction model, including the ARMA model and the feedback based online AR model, is used to predict the current and the future resource availability. Decision to accept or reject a new task is based on the available resources and task properties. Evaluations show that the scheduler can reduce the host overload and failed tasks by nearly 70%, and increase effective resource utilization by more than 65%. The task delay performance degradation is also acceptable.     

MIP formulations for an application of project scheduling in human resource management

In the literature, various discrete-time and continuous-time mixed-integer linear programming (MIP) formulations for project scheduling problems have been proposed. The performance of these formulations has been analyzed based on generic test instances. The objective of this study is to analyze the performance of discrete-time and continuous-time MIP formulations for a real-life application of project scheduling in human resource management. We consider the problem of scheduling assessment centers. In an assessment center, candidates for job positions perform different tasks while being observed and evaluated by assessors. Because these assessors are highly qualified and expensive personnel, the duration of the assessment center should be minimized. Complex rules for assigning assessors to candidates distinguish this problem from other scheduling problems discussed in the literature. We develop two discrete-time and three continuous-time MIP formulations, and we present problem-specific lower bounds. In a comparative study, we analyze the performance of the five MIP formulations on four real-life instances and a set of 240 instances derived from real-life data. The results indicate that good or optimal solutions are obtained for all instances within short computational time. In particular, one of the real-life instances is solved to optimality. Surprisingly, the continuous-time formulations outperform the discrete-time formulations in terms of solution quality.     

Adiponectin plays an important role in efficient energy usage under energy shortage

Adiponectin is an adipose tissue-specific secretory protein known to be an insulin-sensitizing protein. In this study, we generated adiponectin sense and antisense transgenic (Tg) mice to investigate whether adiponectin plays a role in the regulation of energy homeostasis during the growth stage. Spontaneous motor activity of antisense Tg mice were markedly reduced during fasting, particularly in young female mice, compared with wild type (Wt) and sense Tg mice. Furthermore, both body weight and adipose tissue mass of the antisense female Tg mice drastically reduced during fasting. To examine the relationship between the collapse of abdominal white adipose tissue (WAT) and serum adiponectin level, we measured the expression of genes related to energy expenditure, such as uncoupling protein (UCP). Notably, the mRNA of UCP1 in the WAT of antisense Tg female mice was markedly less than that of Wt mice and the UCP1 mRNA was strongly increased during fasting. These findings suggest that the serum adiponectin is important to maintaining energy homeostasis under energy shortage conditions, such as over female pubertal development.     

Biomass energy: the scale of the potential resource

Increased production of biomass for energy has the potential to offset substantial use of fossil fuels, but it also has the potential to threaten conservation areas, pollute water resources and decrease food security. The net effect of biomass energy agriculture on climate could be either cooling or warming, depending on the crop, the technology for converting biomass into useable energy, and the difference in carbon stocks and reflectance of solar radiation between the biomass crop and the pre-existing vegetation. The area with the greatest potential for yielding biomass energy that reduces net warming and avoids competition with food production is land that was previously used for agriculture or pasture but that has been abandoned and not converted to forest or urban areas. At the global scale, potential above-ground plant growth on these abandoned lands has an energy content representing approximately 5% of world primary energy consumption in 2006. The global potential for biomass energy production is large in absolute terms, but it is not enough to replace more than a few percent of current fossil fuel usage. Increasing biomass energy production beyond this level would probably reduce food security and exacerbate forcing of climate change.     

Platonica: an efficient and high-performance dual-centric data center network architecture

Cluster Computing - The unprecedented growth in data volume results in an urgent need for a dramatic increase in the size of data center networks. Accommodating millions to even billions of servers...     

An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem

The work presented in this paper proposes hybridized genetic algorithm architecture for the Flexible Job Shop Scheduling Problem (FJSP). The efficiency of the genetic algorithm is enhanced by integrating it with an initial population generation algorithm and a local search method. The usefulness of the proposed methodology is illustrated with the aid of an extensive computational study on 184 benchmark problems with the objective of minimizing the makespan. Results highlight the ability of the proposed algorithm to first obtain optimal or near-optimal solutions, and second to outperform or produce comparable results with these obtained by other best-known approaches in literature.     

Warm body temperature facilitates energy efficient cortical action potentials

The energy efficiency of neural signal transmission is important not only as a limiting factor in brain architecture, but it also influences the interpretation of functional brain imaging signals. Action potential generation in mammalian, versus invertebrate, axons is remarkably energy efficient. Here we demonstrate that this increase in energy efficiency is due largely to a warmer body temperature. Increases in temperature result in an exponential increase in energy efficiency for single action potentials by increasing the rate of Na(+) channel inactivation, resulting in a marked reduction in overlap of the inward Na(+), and outward K(+), currents and a shortening of action potential duration. This increase in single spike efficiency is, however, counterbalanced by a temperature-dependent decrease in the amplitude and duration of the spike afterhyperpolarization, resulting in a nonlinear increase in the spike firing rate, particularly at temperatures above approximately 35°C. Interestingly, the total energy cost, as measured by the multiplication of total Na(+) entry per spike and average firing rate in response to a constant input, reaches a global minimum between 37-42°C. Our results indicate that increases in temperature result in an unexpected increase in energy efficiency, especially near normal body temperature, thus allowing the brain to utilize an energy efficient neural code.     

An efficient heuristic for scheduling batches of parts in a flexible flow system

Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system. The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence. A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions.     

An efficient lightning energy source on the early earth

Miller and Urey suggested in 1959 that lightning and corona on the early Earth could have been the most favorable sources of prebiotic synthesis. In 1991 Chyba and Sagan reviewed the presently prevailing data on electrical discharges on Earth and they raised questions as to whether the electrical sources of prebiotic synthesis were as favorable as was claimed. The proposal of the present paper is that localized lightning sources associated with Archaean volcanoes could have possessed considerable advantages for prebiotic synthesis over the previously suggested global sources.     

Project scheduling with resource capacities and requests varying with time: a case study

This paper discusses an extension of the classical resource-constrained project scheduling problem in which the resource availability as well as the resource request of the activities may change from period to period. While the applicability of this extension should be obvious, we provide a case study in order to emphasize the need for the extension. A real-world medical research project is presented which has a structure that is typical for many other medical and pharmacological research projects that consist of experiments. Subsequently, we provide a mathematical model and analyze some properties of the extended problem setting. We also introduce a new priority rule heuristic that is based on a randomized activity selection mechanism which makes use of so-called tournaments. Finally, we report our computational results for the original data of the medical research project as well as for a set of systematically generated test instances.     

Elastic resource provisioning for scientific workflow scheduling in cloud under budget and deadline constraints

With the popularization and development of cloud computing, lots of scientific computing applications are conducted in cloud environments. However, current application scenario of scientific computing is also becoming increasingly dynamic and complicated, such as unpredictable submission times of jobs, different priorities of jobs, deadlines and budget constraints of executing jobs. Thus, how to perform scientific computing efficiently in cloud has become an urgent problem. To address this problem, we design an elastic resource provisioning and task scheduling mechanism to perform scientific workflow jobs in cloud. The goal of this mechanism is to complete as many high-priority workflow jobs as possible under budget and deadline constraints. This mechanism consists of four steps: job preprocessing, job admission control, elastic resource provisioning and task scheduling. We perform the evaluation with four kinds of real scientific workflow jobs under different budget constraints. We also consider the uncertainties of task runtime estimations, provisioning delays, and failures in evaluation. The results show that in most cases our mechanism achieves a better performance than other mechanisms. In addition, the uncertainties of task runtime estimations, VM provisioning delays, and task failures do not have major impact on the mechanism’s performance.