基于截止时间满意度的网格工作流调度算法

动态网格环境中用户截止时间保障是工作流调度问题的一个挑战.利用随机服务模型来描述网格资源的动态处理能力及其动态负载压力,提出了截止时间满意度的概念和工作流截止时间满意度的计算方法.将以DAG图形式表示的任务执行关系转换为以数值表示的任务执行优先级,并根据最大截止时间满意度优先的思想,确定执行工作流子任务的候选资源;将工作流全局截止时间划分问题描述为一个约束下的非线性规划问题并通过已有方法求解该问题,提出了一种截止时间满意度增强的工作流调度算法(DSESAW).仿真实验采用实际网格应用和系统数据来验证所提出算法的性能表现,实验结果表明新算法在网格环境的自适应性和用户截止时间保障方面优于其他两种实际网格系统中的调度算法.     

一种网格工作流动态调度算法

由于网格系统异构和资源动态变化,网格工作流多个任务对资源的不同需求,以及任务之间的时序、因果和数据依赖关系,使得网格工作流调度问题非常复杂,低性能的资源和任务调度策略,将会增加任务的执行时间并降低整个网格系统的吞吐量。本文针对网格工作流的特点提出了一种动态调度算法,该算法追求优化执行时间和系统负载均衡的双重目的,最后通过实验验证了该算法的可行性和优越性。     

基于网格工作流的列表启发式算法研究

将用户定义的具体网格工作流抽象为DAG图,在DAG图中找到其关键路径,根据关键路径和用户的类型来计算任务的预测执行时间,确定任务的优先级,再比较若干候选资源,选择性价比较高的资源进行任务分配调度算法。     

云计算中一种多DAG工作流可抢占式调度策略

为解决多用户工作流调度过程中的公平性问题,提高资源利用率,满足不同用户DAG工作流的不同QoS需求,提出了抢占式多DAG工作流动态调度模型。该算法将DAG工作流按照QoS需求进行优先级划分,采用高优先级作业优先占有资源的原则调度作业。相同优先级DAG工作流的任务依据带有启发性信息的slowdown进行资源抢占,进一步提高了作业调度的公平性;对于不同优先级的作业调度,提出了基于阈值的回填算法,该算法在保证作业调度公平的同时提高了资源利用率。     

信任约束下的网格工作流任务调度算法*

提出了信任约束下的网格工作流任务调度算法。该算法结合直接经验和推荐经验计算资源的信任度,根据任务在候选资源上的执行时间确定关键任务,然后选择满足执行时间和信任综合函数的资源。实验结果表明。该算法不仅缩短了工作流的完成时间,而且提高了调度的成功率。     

基于动态资源选择策略的微服务工作流调度算法

为解决现有云中工作流调度算法在面对大量微服务任务组成的工作流时出现整体调度成本偏高的问题,提出一种基于动态资源选择策略(dynamic resource selection strategy, DRSS)的微服务工作流调度算法——DRSS调度算法。利用任务在工作流中的位置确定任务的子截止期以及调度优先级,采用动态资源选择策略对任务进行调度,获得任务执行的最优资源,在此基础上更新任务状态以及虚拟机实例的资源向量。实验结果表明,该算法在调度成功率与成本方面上较同类算法更优。     

OSG环境中可靠性增强的工作流自适应调度

针对实际的网格环境-Open Science Grid (OSG),提出了一个多阶段网格工作流调度机制,主要包括站点发现、站点初始评估以及站点动态评估和选择.通过基于时间序列的性能预测值评估各资源站点的初始性能,提出了一个基于网格资源站点自适应评分机制的选择算法.为了提高工作流执行的可靠性并尽可能缩短执行时间,设计了一个增量式的任务副本策略,并采用各资源站点任务排队等待时间的经验累积分布函数图来优化任务副本的设置参数.在实际网格环境OSG中,基于网格工作流系统Swift完成的大量实验结果表明,所提出的算法和策略能够有效减小工作流调度长度和作业拒绝率,同时在OSG中能够成功完成的Swift工作流规模也明显增大.     

基于资源状态可靠度的网格工作流调度算法

针对执行时间限制严格类型的DAG类型网格工作流提出一种新的基于资源状态可靠度的网格工作流调度算法。该算法根据用户提交的工作流执行时间要求,利用Chapman-Kolmogorov向后方程来计算出DAG图中关键路径上各资源在任务到达时刻均处于“闲状态”的概率大小,然后选择一组资源组合的状态可靠度大于用户要求的信任度置信水平α且总费用较低的一组资源。最后通过实验验证了该算法的有效性。     

基于集群拓扑结构的工作流调度研究

针对MapReduce的默认调度策略先进先出(FIFO)在执行任务时考虑本地性调度带来的任务等待时间长、资源利用率不高和没有考虑任务的优先级等问题,提出一种基于集群拓扑结构的工作流实时调度算法。MapReduce在对工作流进行Map处理时,首先根据taskTracker的计算能力和数据大小对map阶段工作流的完成时间进行估计,得到一个完成时间隶属函数,然后再利用集群的拓扑结构,得到taskTracker在集群中的距离隶属函数,根据这两个隶属函数来对集群中的taskTracker在工作流处理时间和数据传输时间进行综合性能评估,这样可以有效地缩短任务的等待时间并提高资源的利用率。同时该算法采用对作业进行优先级划分的方式,满足不同类型作业的需求。大量的实验结果表明:该优化策略在平均完成时间和平均等待时间方面要优于FIFO算法,可以有效提高工作流处理的实时性。     

基于OGSA网格的分层式网格任务调度器设计

文章根据网格任务调度的需求、网格任务调度的特点,在充分分析一般网格任务调度的过程等的基础上,另外考虑到了网格计算环境的一些特点,比如虚拟化、分层次及自治的本质特征,以及在工作流任务协同需求下网格任务的资源依赖、粗粒度、重复执行等特性的前提下,改进设计了一种网格工作流任务主从式分层调度模型,并给出了调度策略和调度算法实现。该调度器模型在实际的网格工作流任务协同系统中得到了较好的应用效果。     

面向可靠性一费用优化的网格任务调度模型及算法研究

网格资源的异构性、动态性等特征使得网格任务调度仍面临着诸多问题。针对传统可靠性评佑模型仅考虑 资源失效的问题,在考虑本地任务会抢占网格任务执行资源的情况下,引入任务执行延期失效,从而建立了一种新的 网格资源可靠性评估模型。该模型使用随机服务系统理论建模网格资源的动态负载压力,给出了任务在资源上的执 行可靠性的计算方法及证明。基于建立的网格资源可靠性模型,建立了面向可靠性和费用的多目标任务优化调度模 型,以获得最大化任务执行可靠性、最小化任务执行费用的任务调度策略。针对该NP问题,采用化学反应优化算法 对该优化问题进行求解,并给出了算法4种操作的具体实施方法。仿真实验表明,所提出的可靠性评估模型更符合真 实的网格系统,与遗传算法、粒子群算法相比,化学反应优化算法能更好地解决可靠性一费用双目标优化的网格任务调 度问题。     

一种快速的网格任务调度算法的设计

网格任务的执行环境具有动态性、分布性等特征,为了能顺利完成任务并使其具有较好的执行效率,需要一种有效的策略来进行任务的调度.结合信息处理的特点,提出一种快速有效的网格任务调度算法.该算法采用历史信息预测任务的执行时间,根据任务的截止时间要求对子任务进行合理分组.最后,给出了该算法在网格模拟器上的测试结果,并与一些算法进行了比较.结果表明,本算法对大作业以及截止期限紧急的作业具有较好的调度效果.     

Replication based fault tolerant job scheduling strategy for economy driven grid

In this paper, the problem of fault tolerance in grid computing is addressed and a novel adaptive task replication based fault tolerant job scheduling strategy for economy driven grid is proposed. The proposed strategy maintains fault history of the resources termed as resource fault index. Fault index entry for the resource is updated based on successful completion or failure of an assigned task by the grid resource. Grid Resource Broker then replicates the task (submitting the same task to different backup resources) with different intensity, based on vulnerability of resource towards faults suggested by resource fault index. Consequently, in case of possible fault at a resource the results of replicated task(s) on other backup resource(s) can be used. Hence, user job(s) can be completed within specified deadline and assigned budget, even on the event of faults at the grid resource(s). Through extensive simulations, performance of the proposed strategy is evaluated and compared with the Time Optimization and Checkpointing based Strategy in an economy driven grid environment. The experimental results demonstrate that in the presence of faults, proposed fault tolerant strategy improves the number of tasks completed with varied deadline and fixed budget as well as number of tasks completed with varied budget and fixed deadline. Additionally, the proposed strategy used a smaller percentage of deadline time as compare to both Time Optimization and Checkpointing based Strategy. Although the proposed strategy has a percentage of budget spent greater than that of Time Optimization Strategy and Checkpointing based Strategy, it is accepted as a proposed strategy in time optimization where the main objective is to maximize tasks completed within a given deadline. It can be concluded from the experiments that the proposed strategy shows improvement in satisfying the user QoS requirements. It can effectively schedule tasks and tolerate faults gracefully even in the presence of failures, but the costs are slightly higher in terms of budget consumption. Hence, the proposed fault tolerant strategy helps in sustaining user??s faith in the grid, by enabling the grid to deliver reliable and consistent performance in the presence of faults.     

QoS-based Task Group Deployment on Grid by Learning the Performance Data

Overhead of executing fine-grain tasks on computational grids led to task group or batch deployment in which a batch is resized according to the characteristics of the tasks, designated resource, and the interconnecting network. An economic grid demands an application to be processed within the given budget and deadline, referred to as the quality of service (QoS) requirements. In this paper, we increase the task success rate in an economic grid by optimally mapping the tasks to the resources prior to the batch deployment. The task-resource mapping (Advance QoS Planning) is decided based on QoS requirement and by mining the historical performance data of the application tasks using a genetic algorithm. The mapping is then used to assist in creating the task groups. Practical experiments are conducted to validate the proposed method and suggestions are given to implement our method in a cloud environment as well as to process real-time tasks.     

基于效益函数的网格任务调度算法

在动态、异构、分布广泛的网格环境中，对资源的调度是一个非常复杂而重要且具有挑战性的问题。本文针对网格环境中的动态性特点，特别是用户QoS要求的动态变化性，提出了一种基于效益函数的网格任务调度算法，并采用GridSim模拟器分别对该调度算法和模拟器自带的代价最优和时间最优的网格任务调度算法进行模拟。实验的结果表明：该调度算法更能体现用户对QoS要求的动态变化；在系统完成相同数量的网格任务时，消耗相同时间的情况下，该调度算法在代价上优于基于时间优化的调度算法；而花费相同预算的情况下，在时间上优于基于代价优化的调度算法。     

云平台下基于截止时间的自适应调度策略

针对在共享集群中进行任务调度时,无法兼顾任务的响应速度与任务完成时间的问题,提出一种基于截止时间的自适应调度算法。该算法以用户提交的截止时间为依据,根据任务的执行进度自适应地分配适当的计算资源。不同于传统调度方式里由用户提交固定资源参数,该算法在资源约束的情况下会对优先级高的任务进行抢占式调度以保证服务质量（QoS）,并在抢占过程结束后额外分配资源补偿被抢占的任务。在Spark平台进行的任务调度实验结果显示,与另一种资源协调者（YARN）框架下的调度算法相比,所提算法能严格地控制短任务的响应速度,并使长作业的任务完成时间缩短35%。     

基于动态遗传算法的网格计算任务调度

针对网格任务调度的动态特性,提出一种改进的遗传算法——动态遗传算法(DGA),设计了新的编码机制和适应度函数,以及相应的选择、交叉和变异算子。根据网格系统各服务节点的计算能力、负载及网络状态进行动态调度,不仅使总的完成时间最短,尽量使主机的空闲时间最短,同时满足每个任务的截止时间的要求。在OPNET环境中构建了一个局部网格仿真模型,对所提出的动态遗传算法进行了仿真实验,并与其他常见网格任务调度算法进行了对比,结果表明动态遗传算法具有很好的优化能力,提供了较好的服务质量。     

Fair Scheduling Algorithms in Grids

In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the earliest deadline first (EDF) and the first come first served (FCFS) schemes. Our algorithm uses a max-min fair sharing approach for providing fair access to users. When there is no shortage of resources, the algorithm assigns to each task enough computational power for it to finish within its deadline. When there is congestion, the main idea is to fairly reduce the CPU rates assigned to the tasks so that the share of resources that each user gets is proportional to the users weight. The weight of a user may be defined as the users contribution to the infrastructure or the price he is willing to pay for services or any other socioeconomic consideration. In our algorithms, all tasks whose requirements are lower than their fair share CPU rate are served at their demanded CPU rates. However, the CPU rates of tasks whose requirements are larger than their fair share CPU rate are reduced to fit the total available computational capacity in a fair manner. Three different versions of fair scheduling are adopted in this paper: the simple fair task order (SFTO), which schedules the tasks according to their respective fair completion times, the adjusted fair task order (AFTO), which refines the SFTO policy by ordering the tasks using the adjusted fair completion time, and the max-min fair share (MMFS) scheduling policy, which simultaneously addresses the problem of finding a fair task order and assigning a processor to each task based on a max-min fair sharing policy. Experimental results and comparisons with traditional scheduling schemes such as the EDF and the FCFS are presented using three different error criteria. Validation of the simulations using real experiments of tasks generated from 3D image- rendering processes is also provided. The three proposed scheduling schemes can be integrated into existing grid computing architectures.     

Energy-aware mixed partitioning scheduling in standby-sparing systems

Previous standby-sparing techniques assume that all tasks don't access to shared resources. In addition, primary tasks and backup tasks are allocated to the primary processor and spare processor respectively. Spare processor schedules tasks with maximum processor speed. Unlike previous techniques, we have studied the problem of minimizing energy consumption and preserving the original reliability for dynamic-priority real-time task set with shared resources in a standby-sparing system. We propose a novel energy-aware mixed partitioning scheduling algorithm (EAMPSA). Earliest deadline first/dynamic deadline modification (EDF/DDM) scheduling scheme is used to ensure that the shared resources can be accessed in a mutual exclusive manner. Uniformly speed is used to the primary processor and the spare processor. In addition, we use the mixed mapping partitioning of primary and backup tasks method to map tasks. A novel method of mapping task is proposed i.e. the tasks which need to access to shared resources are mapped into the primary processor and the tasks which have no resource requirements are mapped into the spare processor. Furthermore, DVS and DPM techniques are used for both primary and backup tasks to save energy. The experimental results show that the EAMPSA algorithm consumes average 55.43% less energy than that of the SSPT algorithm.     

基于模糊聚类思想的网格独立任务调度算法

任务调度是网格研究的核心问题之一,在研究网格任务调度问题的基础上,利用模糊聚类思想提出将网格任务与资源进行混合模糊聚类的网格独立任务调度算法,该算法将最适合的资源分配给与之相适应的任务,即尽量将任务调度到恰好满足其需求的资源上执行,从而把综合能力大大超过当前任务的资源“预留”给将来的任务使用,算法具有良好的性能和负载均衡效果,为网格任务调度提供一种新的思路。