云中截止时间动态分配的工作流调度成本优化算法

现如今,如何在满足截止时间约束的前提下降低工作流的执行成本,是云中工作流调度的主要问题之一。三步列表调度算法可以有效解决这一问题。但该算法在截止时间分配阶段只能形成静态的子截止时间。为方便用户部署工作流任务,云服务商为用户提供了的三种实例类型,其中竞价实例具有非常大的价格优势。为解决上述问题,提出了截止时间动态分配的工作流调度成本优化算法(S-DTDA)。该算法利用粒子群算法对截止时间进行动态分配,弥补了三步列表调度算法的缺陷。在虚拟机选择阶段,该算法在候选资源中增加了竞价实例,大大降低了执行成本。实验结果表明,相较于其他经典算法,该算法在实验成功率和执行成本上具有明显优势。综上所述,S-DTDA算法可以有效解决工作流调度中截止时间约束的成本优化问题。     

不确定性感知的边缘计算任务调度算法

任务执行时长的不确定性是设计任务调度算法时的一个重要问题,关系到调度方案能否满足任务的截止时间要求.鉴于此,研究不确定性感知的边缘计算任务调度问题,以最小化边缘提供商开销为优化目标建立任务调度问题的优化模型.该模型将任务执行时长建模为随机变量并推导出任务完成时间的完整概率分布,引入关于任务截止时间的概率约束,以可调节的概率阈值保证任务按时完成.为求解该问题,进一步提出基于蝙蝠算法搜索策略的元启发式算法,包含两个关键的算法组件,映射算子实现蝙蝠空间与调度解空间的关联,评估算子实现候选解可行性的判定和优化目标值的计算.基于对比实验的仿真结果表明,所提出算法能够得到高质量的任务调度方案.     

Utilization-based pricing for power management and profit optimization in data centers

Traditional load balancing approaches may spread the load on more computers as long as the performance in terms of response time or cost is minimized. Nowadays power is a growing cost factor for data centers. In this paper, from the service provider’s point of view, the load balancing decision is made based on whether power consumption can be reduced or more profit can be earned. To achieve this, we design pricing algorithms to influence the load distribution. Both algorithms take into account the utilization of computers besides other factors, such as prices and power costs. In the first algorithm, we design pricing functions with respect to the computer utilization to encourage or discourage resource usage. In the second algorithm, we focus on the profit that a service provider can earn after deducting power cost from its revenue. We formulate this profit optimization problem and derive the optimum price solution.     

基于代价优化的云工作流调度改进PSO算法

云计算可以通过即付即用的方式向用户工作流提供资源。为了解决资源服务代价异构环境下的云工作流任务调度代价问题,提出一种基于改进粒子群算法的云工作流任务调度算法WSA-IPSO。通过综合考虑任务的执行代价和依赖任务间发生数据传输时的通信代价,算法将总代价优化问题形式化为有向无环图DAG中的任务调度模型,并提出基于改进粒子群算法的优化模型对其进行求解。通过改进传统粒子群算法的粒子速度更新策略和惯性权重更新策略,算法可以以更快的收敛速度得到代价最小化的调度方案。通过仿真实验,与MCT算法及标准粒子群算法进行性能比较。实验结果表明,WSA-IPSO算法在降低总代价、任务分布的负载均衡以及算法收敛性方面比较同类算法均表现出更好的性能。     

Shared-nothing并行数据库系统查询优化技术

查询优化是并行数据库系统的核心技术。该文介绍作者自行研制的一个Ｓｈａｒｅｄ－ｎｏｔｈｉｎｇ并行数据库系统ＰＢＡＳＥ／２中独特的两阶段优化策略。为了缩减并行相称优化庞大的搜索空间,ＰＢＡＳＥ／２将并行查询优化划分为顺序优化和并行化两个在阶段。在顺序优化阶段对并行化后的通信代价进行预先估算,将通信开销加入顺序优化的代价模型,同时对动态规划搜索算法进行了修正和扩展,保证了顺序优化阶段得到的最小代价计划在     

一种多重约束下确保成功率的云工作流调度方法

为提高多重约束下的调度成功率,提出一种满足期限和预算双重约束的云工作流调度算法.将可行工作流调度方案求解分解为工作流结构分层、预算分配、期限分配、任务选择和实例选择.工作流结构分层将所有工作流任务划分层次形成包任务,以提高并行执行程度;预算分配对整体预算在层次间进行分割;期限分配将全局期限在不同层次间分割;任务选择基于...     

面向可信嵌入式系统的随机实时任务能耗优化

针对可信嵌入式系统应用中将任务的最坏情况下的执行时间(WCET)作为任务的实际执行时间,导致系统资源的极大浪费的问题,提出了一种基于随机任务概率模型的方法。首先,考虑任务执行时间具有特定概率分布,并且任务具有不错过其死限的概率(NDVP)需求,同时考虑了动态电压和频率调整(DVFS)对系统可靠性的影响,利用该技术降低能耗。然后,基于动态规划算法,提出了一种具有多项式运行时间的优化算法,并进一步设计了状态剔除规则降低算法运行开销。仿真表明,所提算法与最坏执行时间模型下的最优算法相比,系统能耗降低了30%以上。实验结果表明,考虑任务的随机执行时间能在保证系统可靠性的同时大大节约系统资源。     

A parallel hybrid optimization algorithm for fitting interatomic potentials

In this work we present the parallel implementation of a hybrid global optimization algorithm assembled specifically to tackle a class of time consuming interatomic potential fitting problems. The resulting objective function is characterized by large and varying execution times, discontinuity and lack of derivative information. The presented global optimization algorithm corresponds to an irregular, two-level execution task graph where tasks are spawned dynamically. We use the OpenMP tasking model to express the inherent parallelism of the algorithm on shared-memory systems and a runtime library which implements the execution environment for adaptive task-based parallelism on multicore clusters. We describe in detail the hybrid global optimization algorithm and various parallel implementation issues. The proposed methodology is then applied to a specific instance of the interatomic potential fitting problem for the metal titanium. Extensive numerical experiments indicate that the proposed algorithm achieves the best parallel performance. In addition, its serial implementation performs well and therefore can also be used as a general purpose optimization algorithm.     

云环境下基于DO-GAPSO的任务调度算法

为了找到合理的云计算任务调度方案,仅从单一方面来优化调度策略已不能满足用户需求,但从多个方面优化调度策略又面临着权重分配问题。针对上述问题,从任务完成时间、任务完成成本、服务质量3个方面考虑,提出一种基于遗传与粒子群算法相融合的动态目标任务调度算法,在算法的适应度评价函数建模中引入线性权重动态分配策略。通过CloudSim平台进行云环境仿真实验,并将此算法与经典的双适应遗传算法(DFGA)、离散粒子群优化算法(DPSO)进行比较。实验结果表明,在相同的设置条件下,该算法在执行效率、寻优能力等方面优于其他两个算法,是一种云计算环境下有效的任务调度算法。     

Optimizing layer‐based scheduling algorithms for parallel tasks with dependencies

Programming with parallel tasks leads to task graphs with dependencies representing a parallel program. Scheduling algorithms are employed to find an efficient execution order of the parallel tasks. A large variety of scheduling algorithms exist, including layer‐based scheduling algorithms for homogeneous target platforms that build consecutive layers of independent parallel tasks and schedule each layer separately. Although these scheduling algorithms provide good results in terms of scheduling algorithm runtime and schedule execution time, the resulting schedules leave room for optimization. This article proposes an optimization for arbitrary layer‐based scheduling algorithms, which is called Move‐blocks algorithm. Given a layer‐based schedule of the parallel tasks, this algorithm moves blocks of parallel tasks into preceding layers in order to reduce the overall execution time of a task‐based application. Suitable blocks of parallel tasks are identified by the algorithm Find‐blocks, which is employed together with the Move‐blocks algorithm. The algorithm Move‐blocks is applied to four well‐known scheduling algorithms. A detailed evaluation for a wide range of test cases is given. Copyright © 2010 John Wiley & Sons, Ltd.     

PSO-DS: a scheduling engine for scientific workflow managers

Cloud computing, an important source of computing power for the scientific community, requires enhanced tools for an efficient use of resources. Current solutions for workflows execution lack frameworks to deeply analyze applications and consider realistic execution times as well as computation costs. In this study, we propose cloud user–provider affiliation (CUPA) to guide workflow’s owners in identifying the required tools to have his/her application running. Additionally, we develop PSO-DS, a specialized scheduling algorithm based on particle swarm optimization. CUPA encompasses the interaction of cloud resources, workflow manager system and scheduling algorithm. Its featured scheduler PSO-DS is capable of converging strategic tasks distribution among resources to efficiently optimize makespan and monetary cost. We compared PSO-DS performance against four well-known scientific workflow schedulers. In a test bed based on VMware vSphere, schedulers mapped five up-to-date benchmarks representing different scientific areas. PSO-DS proved its efficiency by reducing makespan and monetary cost of tested workflows by 75 and 78%, respectively, when compared with other algorithms. CUPA, with the featured PSO-DS, opens the path to develop a full system in which scientific cloud users can run their computationally expensive experiments.     

计算网格中基于时间均衡的并行粗粒度任务调度算法

考虑网格资源异构、自治、动态等特性,讨论本地用户具有强占优先权情况下的任务调度问题,提出了TBBS(Time-Balancing Based Scheduling Algorithm)算法.建立调度优化模型,以期望完成时间最小为目标选择执行任务的最佳资源组合.以时间均衡策略将任务分解并调度到资源上执行,减少了子任务同步时因等待而产生的延时,获得较好的并行计算性能.采用重复调度策略,适应计算网格中资源的特性.     

LATOC: an enhanced load balancing algorithm based on hybrid AHP-TOPSIS and OPSO algorithms in cloud computing

Providing required level of service quality in cloud computing is one of the most significant cloud computing challenges because of software and hardware complexities, different features of tasks and computing resources and also, lack of appropriate distribution of tasks in cloud computing environments. The recent research in this field show that lack of smart prioritization and ordering of tasks in scheduling (as an NP-hard problem) has been very effective and resulted in lack of load balancing, response time increase, total execution time increase and also, average resource use decrease. In line with this, the proposed method of this research called LATOC considered first the key criteria of an input task like required processing unit, data length of task and execution time. Then, it addressed task prioritization in separate queues using the technique for order preference by similarity to ideal solution (TOPSIS) and analytic hierarchy process (AHP) in figure of a hybrid intelligent algorithm (AHP-TOPSIS). Each ordered task in separate priority queues was placed based on its priority level, and then, to assign each task from each priority queue to virtual machines, optimized particle swarm optimization was used. Many simulations based on various scenarios in Cloudsim simulator show that smart assignment of prioritized tasks by LATOC resulted in improvement of important cloud computing parameters such as total execution time and average resource use comparing similar methods.

     

Multi-level scheduling for global optimization in grid computing

The paper presents a multi-level scheduling algorithm for global optimization in grid computing. This algorithm provides a global optimization through a cross-layer optimization realized by decomposing the optimization problem in different sub-problems each of them corresponding to one among the grid layers such as application layer, collective layer and fabric layer. The QoS of an abstraction level is a utility function that assigns at every level a different value and that depends on the kind of task that is executed on the grid. The global QoS is given by processing of the utility function values of the three different levels, using the Lagrangian method. Multi-level QoS scheduling algorithm is evaluated in terms of system efficiency and their economic efficiency, respectively. Economic efficiency includes user utility, service provider’s revenue and grid global utility. System efficiency includes execution success ratio and resource allocation ratio.     

HWOA: an intelligent hybrid whale optimization algorithm for multi-objective task selection strategy in edge cloud computing system

Edge computing is a popular computing modality that works by placing computing resources as close as possible to the sensor data to relieve the burden of network bandwidth and data centers in cloud computing. However, as the volume of data and the scale of tasks processed by edge terminals continue to increase, the problem of how to optimize task selection based on execution time with limited computing resources becomes a pressing one. To this end, a hybrid whale optimization algorithm (HWOA) is proposed for multi-objective edge computing task selection. In addition to the execution time of the task, economic profits are also considered to optimize task selection. Specifically, a fuzzy function is designed to address the uncertainty of task’s economic profits and execution time. Five interactive constraints among tasks are presented and formulated to improve the performance of task selection. Furthermore, some improved strategies are designed to solve the problem that the whale optimization algorithm (WOA) is subject to local optima entrapment. Finally, an extensive experimental assessment of synthetic datasets is implemented to evaluate the multi-objective optimization performance. Compared with the traditional WOA, the diversity metric (Δ-spread), the hypervolume (HV) and other evaluation metrics are significantly improved. The experiment results also indicate the proposed approach achieves remarkable performance compared with other competitive methods.

     

云工作流系统中能耗感知的任务调度算法*

云工作流系统研究集中在工作流任务执行的时间效率优化,然而时间最优的任务调度方案可能存在不同能耗,因此,文中求解满足时间约束时能耗最优的调度方案。首先改进任务执行能耗模型,设计适用于评价任务调度方案执行能耗的适应度计算方法。然后基于精准调整粒子速度的自适应权重,提出解决任务调度能耗优化问题的自适应粒子群算法。实验表明,文中算法收敛稳定,调度方案执行能耗较低。     

基于蚁群算法的移动边缘服务器收益优化策略

移动边缘计算(Mobile Edge Computing,MEC)是5G的关键技术。由于MEC服务器的计算资源有限,如何对其计算资源分配以提高收益至关重要。为此,提出一种边缘服务器收益优化策略。将MEC服务器收益最大化问题建模为以服务器端任务执行次序为优化变量的最优化问题。在用户对时延和金钱偏好程度不同及子任务具有顺序执行关联性的情况下,提出基于蚁群算法的任务最优执行次序求解算法。仿真结果表明,同等条件下采用该算法获得的收益比SearchAdjust算法提高了33.6%。     

Multi-QoS constrained and Profit-aware scheduling approach for concurrent workflows on heterogeneous systems

The execution of a workflow application can result in an imbalanced workload among allocated processors, ultimately resulting in a waste of resources and a higher cost to the user. Here, we consider a dynamic resource management system in which processors are reserved not for a job but only to run a task, thus allowing a higher resource usage rate. This paper presents a scheduling algorithm that manages concurrent workflows in a dynamic environment in which jobs are submitted by users at any moment in time, on shared heterogeneous resources, and constrained to a specified budget and deadline for each job. Recent research attempted to propose dynamic strategies for concurrent workflows but only addressed fairness in resource sharing among applications while minimizing the execution time. The Multi-QoS Profit-Aware scheduling algorithm (MQ-PAS) proposed here is able to increase the profit achieved by the provider by considering the budget available for each job to define tasks priorities. We study the scalability of the algorithm with different types of workflows and infrastructures. The experimental results show that our strategy improves provider revenue significantly and obtains comparable successful rates of completed jobs.     

基于后移空余时间的网格资源调度优化

网格资源调度的优化不仅体现在资源的选择上,还与任务之间的时间序列密切相关。就调度的优化问题,在深入分析静态调度时间序列的基础上,给出了动态分配时间模型,提出了后移空余时间的计算,并将其与后继任务的预计时间合并,由此设计了后移空余时间的成本优化调度算法(BOS)。实验证明,所提出的调度算法大幅度地缩短了应用的平均执行时间和运行成本,实现了调度的优化。