一种多属性网格任务调度算法及仿真研究

为使网格任务调度时能更多地考虑任务和资源之间的各种属性.通过对常用静态调度算法的分析,吸收了Min-min和Max-min等算法的思想,将影响网格任务调度的诸多属性归纳为两类因素.提出了一种针对多属性任务的调度算法MASA,经过截断处理、归一化、加权计算等方法得出任务与资源之间的匹配矩阵,指导任务调度.仿真实验测试结果表明,在相同任务和资源环境下,通过改变不同属性的加权系数能得到所期望的调度结果,使具有高加权系数属性的任务在调度时更具优势.此算法具有灵活性,属性可增可减,能根据具体情况进行配置,以满足具体应用需求.     

一种基于多维聚类预处理的云计算任务调度算法

文章主要介绍了一种基于多维聚类预处理的云计算任务调度算法,根据预先分类好的资源特征向量进行分类依据,将云计算资源与特征向量间的相似度距离作为测度函数,将资源划分到预先定义好的类别中。本调度算法对资源进行分类预处理,能有效缩小任务对于资源搜索的范围,从而提高任务调度的速度。     

一种基于增量式时间序列和最佳任务调度的Web数据聚类算法

为了实现Web服务请求数据的快速聚类,并提高聚类的准确率,提出一种基于增量式时间序列和最佳任务调度的Web数据聚类算法。该算法进行了Web数据在时间序列上的聚类定义,并采用增量式时间序列聚类方法。先通过数据压缩形式降低Web数据的复杂性,再进行基于服务时间相似性的时间序列数据聚类;最后针对Web集群服务的最佳服务任务调度问题,通过以服务器执行能力为标准来分配服务任务。仿真实验结果表明,相比基于网格的高维数据层次聚类算法和基于增量学习的多目标模糊聚类算法,该文的算法在聚类时间、聚类精度、服务执行成功率、聚类失真度上均获得了更好的性能。     

基于双重自适应策略的旋转相控阵雷达任务调度方法研究北大核心CSCD

针对旋转相控阵雷达任务调度过程中资源利用不充分问题和调度算法优化需求,提出基于双重自适应策略的任务调度算法(TSM-DAS)。首先,通过探究旋转相控阵雷达扫描特性,将雷达任务分为两类;然后,针对不同类型任务的调度时间差异,提出任务调度的双重自适应策略;最后,结合任务时间窗、优先级和贪心算法,给出基于双重自适应策略的任务调度算法,并通过仿真实验对TSM-DAS进行验证。实验结果表明,相比其他同类算法,TSM-DAS能够有效提升雷达资源利用率,降低任务截止期错失率,从整体上提升旋转相控阵雷达的任务调度效能。     

K均值聚类在云计算的应用

相对于传统的应用部署方式,云计算是基于互联网的一种并行处理技术,提供了一个高度可扩展和按需处理的服务。任务调度一直是云计算环境中的研究热点,在云计算环境中具有重要作用。能否合理分配任务到虚拟机资源上是重要问题之一。本文通过对任务请求的资源进行分析,对不同类型的任务进行聚类,将不同类型任务通过改进贪心调度算法合理分配到虚拟机资源上。通过Cloudsim平台模拟实验表明,该算法相对于Min-Min算法在节省能耗方面有较好的效果。     

基于模糊聚类的机载多功能毫米波雷达动态资源调度

详细介绍武装直升机载多功能雷达的工作环境和资源管理所面临的挑战.在深入分析雷达资源管理特点和影响资源调度算法的主要因素基础上,提出一种基于模糊聚类的自适应雷达资源动态调度算法.详细分析了跟踪事件和搜索事件的优先级模糊特征因子,给出合理的动态优先级模糊聚类数学模型.结果表明,基于模糊优先级聚类的动态资源管理算法在密集目标...     

云环境下任务调度算法对比研究

云计算是完全基于互联网的新兴技术。云计算环境中的任务调度问题一直都是该领域的研究热点。合理高效的任务调度算法在云环境中能有效的缩短任务完成时间,提高系统负载均衡,更好的满足用户与云提供商的需求。本文研究了云平台的任务调度机制,探究了任务调度过程中的关键性指标。通过云仿真平台CloudSim实现并分析了顺序调度算法、Min-Min算法和Max-Min算法,对比其在随机生成用户任务负载与虚拟机计算资源的情况下的任务完成时间,实验证明Min-Min算法与Max-Min算法均优于顺序调度算法。以此为未来研究提供实验支撑和方向。     

云计算环境下任务调度算法的研究

在云计算环境中存在庞大的任务数,为了能更加高效地完成任务请求,如何进行有效地任务调度是云计算环境下实现按需分配资源的关键。针对调度问题提出了一种基于蚁群优化的任务调度算法,该算法能适应云计算环境下的动态特性,且集成了蚁群算法在处理NP-Hard问题时的优点。该算法旨在减少任务调度完成时间。通过在CloudSim平台进行仿真实验,实验结果表明,改进后的算法能减少任务平均完成时间、并能在云计算环境下有效提高调度效率。     

PSO 应用于 QoS 偏好感知的云存储任务调度

研究有QoS偏好要求的云存储任务调度。首先,分析云存储与云计算的差异,用存在矩阵避免无效解的产生。其次,归纳云存储的QoS需求为时间、代价与质量3大类,并据此修改PSO算法的适应度函数用权重因子调节QoS偏好。实验发现,在不同优先级任务分布不均的情况下,分布广的任务的偏好会掩盖其他任务的偏好,因而不适宜用PSO进行整体性调度,而必须进行分级调度。实验证明,改进后的分级PSO算法对QoS偏好具有较好的感知能力。     

异构多平台信号处理任务调度研究

简单的并行计算或单一异构平台已经无法满足计算量大、复杂度高的信号处理和任务调度需求，异构多平台系统已经成为信号处理和任务调度的发展趋势。针对提高平台的吞吐量、处理器的利用率以及任务的感知等问题，文中对异构多平台信号处理模型进行了研究，并利用有向无环图对调度任务和软硬件资源建模。基于已提出的调度算法，对任务调度进行了归纳总结、对比分析，发现基于任务感知的混合调度算法能够较好地满足平台调度需求。利用基于任务感知的混合调度算法解决信号处理中的任务调度将是未来研究发展的趋势。     

虚拟计算环境下面向应用的基于信任的资源匹配模型

为了解决虚拟计算环境中的资源合理调度问题,提出了一种基于信任的资源匹配模型--“资源滑动窗口”模型。首先对资源的静态属性进行分类,然后依据基于时间窗的贝叶斯信任模型对资源节点进行评价,同时考虑资源的负载,动态划分其实时性能。最后综合评估静态和动态属性,确定调度资源分配。该模型为不同任务和属性的资源调度策略奠定了基础,实现了“合适的资源服务于合适的任务”的目的。仿真实验表明所提的模型相对传统的调度算法,具有更高的系统任务执行成功率和资源利用率。     

A workflow task scheduling algorithm based on the resources' fuzzy clustering in cloud computing environment

Cloud computing is the key and frontier field of the current domestic and international computer technology, workflow task scheduling plays an important part of cloud computing, which is a policy that maps tasks to appropriate resources to execute. Effective task scheduling is essential for obtaining high performance in cloud environment. In this paper, we present a workflow task scheduling algorithm based on the resources' fuzzy clustering named FCBWTS. The major objective of scheduling is to minimize makespan of the precedence constrained applications, which can be modeled as a directed acyclic graph. In FCBWTS, the resource characteristics of cloud computing are considered, a group of characteristics, which describe the synthetic performance of processing units in the resource system, are defined in this paper. With these characteristics and the execution time influence of the ready task in the critical path, processing unit network is pretreated by fuzzy clustering method in order to realize the reasonable partition of processor network. Therefore, it largely reduces the cost in deciding which processor to execute the current task. Comparison on performance evaluation using both the case data in the recent literature and randomly generated directed acyclic graphs shows that this algorithm has outperformed the HEFT, DLS algorithms both in makespan and scheduling time consumed. Copyright © 2014 John Wiley & Sons, Ltd.     

云环境下服务信任感知的可信动态级调度方法

以社会学中的人际关系信任模型为基础,提出了一种基于服务消费者的服务满意度评价、推荐者的服务推荐和第三方服务性能反馈的可信度量模型。将用户对服务资源的信任需求和服务资源的可信度并入DLS算法得到可信动态级调度算法CTDLS,从而在计算调度级别时考虑服务资源的可信程度。模拟实验表明,该算法能有效满足任务在信任方面的服务质量需求,对提高任务调度的成功率具有实际意义。     

A genetic algorithm‐based task scheduling for cloud resource crowd‐funding model

With the rapid development of cloud computing, the number of cloud users is growing exponentially. Data centers have come under great pressure, and the problem of power consumption has become increasingly prominent. However, many idle resources that are geographically distributed in the network can be used as resource providers for cloud tasks. These distributed resources may not be able to support the resource‐intensive applications alone because of their limited capacity; however, the capacity will be considerably increased if they can cooperate with each other and share resources. Therefore, in this paper, a new resource‐providing model called “crowd‐funding” is proposed. In the crowd‐funding model, idle resources can be collected to form a virtual resource pool for providing cloud services. Based on this model, a new task scheduling algorithm is proposed, RC‐GA (genetic algorithm for task scheduling based on a resource crowd‐funding model). For crowd‐funding, the resources come from different heterogeneous devices, so the resource stability should be considered different. The scheduling targets of the RC‐GA are designed to increase the stability of task execution and reduce power consumption at the same time. In addition, to reduce random errors in the evolution process, the roulette wheel selection operator of the genetic algorithm is improved. The experiment shows that the RC‐GA can achieve good results.     

Multicriteria decision‐making techniques for avoiding similar task scheduling conflict in cloud computing

An efficient task scheduling approach shows promising way to achieve better resource utilization in cloud computing. Various task scheduling approaches with optimization and decision‐making techniques have been discussed up to now. These approaches ignored scheduling conflict among the similar tasks. The conflict often leads to miss the deadlines of the tasks. The work studies the implementation of the MCDM (multicriteria decision‐making) techniques in backfilling algorithm to execute deadline‐based tasks in cloud computing. In general, the tasks are selected as backfill tasks, whose role is to provide ideal resources to other tasks in the backfilling approach. The selection of the backfill task is challenging one, when there are similar tasks. It creates conflict in the scheduling. In cloud computing, the deadline‐based tasks have multiple parameters such as arrival time, number of VMs (virtual machines), start time, duration of execution, and deadline. In this work, we present the deadline‐based task scheduling algorithm as an MCDM problem and discuss the MCDM techniques: AHP (Analytical Hierarchy Process), VIKOR (VIseKriterijumska Optimizacija I Kompromisno Resenje), and TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) to avoid similar task scheduling conflicts. We simulate the backfilling algorithm along with three MCDM mechanisms to avoid scheduling conflicts among the similar tasks. The synthetic workloads are considered to study the performance of the proposed scheduling algorithm. The mechanism suggests an efficient VM allocation and its utilization for deadline‐based tasks in the cloud environment.     

Knowledge-based resource management for multifunction radar: a look at scheduling and task prioritization

In this article, we consider two related aspects of radar resource management, scheduling and task prioritization. Two different methods of scheduling are examined and compared and their differences and similarities highlighted. The comparison suggests that prioritization of tasks plays a dominant role in determining performance. A prioritization scheme based on fuzzy logic is subsequently contrasted and compared with a hard logic approach as a basis for task prioritization. The setting of priorities is shown to be critically dependent on prior expert knowledge. By assessing the priorities of targets and sectors of surveillance according to a set of rules it is attempted to imitate the human decision-making process such that the resource manager can distribute the radar resources in a more effective way. Results suggest that the fuzzy approach is a valid means of evaluating the relative importance of the radar tasks; the resulting priorities have been adapted by the fuzzy logic prioritization method, according to how the radar system perceived the surrounding environment.     

An Optimized Collaborative Scheduling Algorithm for Prioritized Tasks with Shared Resources in Mobile-Edge and Cloud Computing Systems

Mobile edge computing (MEC) is a promising technology that has the potential to meet the latency requirements of next-generation mobile networks. Since MEC servers have limited resources, an orchestrator utilizes a scheduling algorithm to decide where and when each task should execute so that the quality of service (QoS) of each task is achieved. The scheduling algorithm should use the least possible resources required to meet the service demands. In this paper, we develop a two-level cooperative scheduling algorithm with a centralized orchestrator layer. The first scheduling level is used to schedule tasks locally on MEC servers. In contrast, the second level resides at the orchestrator and assigns tasks to a neighboring base station or the cloud. The tasks serve in accordance with their priority, which is determined by the latency and required throughput. We also present a resource optimization algorithm for determining resource distribution in the system in order to ensure satisfactory service availability at the minimum cost. The resource optimization algorithm contains two variations that can be employed depending on the traffic model. One variant is used when the traffic is uniformly distributed, and the other is used when the traffic load is unbalanced among base stations. Numerical results show that the cooperative model of task scheduling outperforms the non-cooperative model. Furthermore, the results show that the suggested scheduling algorithm performs better than other well-known scheduling algorithms, such as shortest job first scheduling and earliest deadline first scheduling.

     

云环境中基于异构资源的资源分配算法

随着"云计算"的出现和快速发展,"云"作为一种新型的资源形式被越来越多的用户所使用。云环境中的资源分配问题成为了云计算中不可忽略的问题。在云资源管理平台中,如何既满足用户的任务需求,又节省云资源成本,是云运营商尽快希望解决的问题之一。实际上云用户对云资源的请求是有差异的,而且用户任务的完成通常由多个异构的云资源来实现。文中作者考虑了异构云资源间的差异,提出了一种基于异构资源的资源分配算法。该算法先从任务的全局角度考虑,将用户提交的云任务划成不同的组合,再根据云资源间的差异,为相应的组合分配相应的资源。实验仿真表明,在异构云环境中,该算法能在满足用户需求的前提下,在节省云资源使用上有较好的表现。     

A Modelling of Context-Aware Elderly Healthcare Eco-System-(CA-EHS) Using Signal Analysis and Machine Learning Approach

In cloud computing, more often times cloud assets are underutilized because of poor allocation of task in virtual machine (VM). There exist inconsistent factors affecting the scheduling tasks to VMs. In this paper, an effective scheduling with multi-objective VM selection in cloud data centers is proposed. The proposed multi-objective VM selection and optimized scheduling is described as follows. Initially the input tasks are gathered in a task queue and tasks computational time and trust parameters are measured in the task manager. Then the tasks are prioritized based on the computed measures. Finally, the tasks are scheduled to the VMs in host manager. Here, multi-objectives are considered for VM selection. The objectives such as power usage, load volume, and resource wastage are evaluated for the VMs and the entropy is calculated for the measured objectives and based on the entropy value krill herd optimization algorithm prioritized tasks are scheduled to the VMs. The experimental results prove that the proposed entropy based krill herd optimization scheduling outperforms the existing general krill herd optimization, cuckoo search optimization, cloud list scheduling, minimum completion cloud, cloud task partitioning scheduling and round robin techniques.