Energy-Performance Tradeoffs in laaS Cloud with Virtual Machine Scheduling

In the cloud data centers,how to map virtual machines(VMs) on physical machines(PMs) to reduce the energy consumption is becoming one of the major issues,and the existing VM scheduling schemes are mostly to reduce energy consumption by optimizing the utilization of physical servers or network elements.However,the aggressive consolidation of these resources may lead to network performance degradation.In view of this,this paper proposes a two-stage VM scheduling scheme:(1) We propose a static VM placement scheme to minimize the number of activating PMs and network elements to reduce the energy consumption;(2) In the premise of minimizing the migration costs,we propose a dynamic VM migration scheme to minimize the maximum link utilization to improve the network performance.This scheme makes a tradeoff between energy efficiency and network performance.We design a new twostage heuristic algorithm for a solution,and the simulations show that our solution achieves good results.

MULTITASK SCHEDULING IN NETWORKED CONTROL SYSTEMS WITH APPLICATION TO LARGE SCALE VEHICLE CONTROL

Aiming at scheduling problems of networked control system （NCS） used to fulfill motion synthesis and cooperation control of the distributed multi-mechatronic systems, the differences of network scheduling and task scheduling are compared, and the mathematic description of task scheduling is presented. A performance index function of task scheduling of NCS according to task balance and traffic load matching principles is defined. According to this index, a static scheduling method is designed and implemented to controlling task set simulation of the DCY100 transportation vehicle. The simulation results are applied successfully to practical engineering in this case so as to validate the effectiveness of the proposed performance index and scheduling algorithm.

Pareto-Based Complete Local Search and Combined Timetabling for Multi-objective Job Shop Scheduling Problem with No-Wait Constraint

Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.