首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到17条相似文献,搜索用时 62 毫秒
1.
研究需要附加信息的可任意划分应用的调度问题.文章首先引入附加信息的概念,扩展了DLS模型,在此基础上重新分析了在这类应用中经典的平均划分(EQS)算法的缺陷,并提出了一个无空闲时间调度算法(NIS).基于这两个算法的解析表达解,严格地证明了NIS算法的调度性能总是优于EQS算法.由于在这类应用中典型的情况是每个处理器需要相同的附加信息,文章进一步研究了这类典型应用.分析表明,与EQS算法相比有更大范围的应用能利用NIS算法获得并行计算的收益,NIS算法所能利用的资源也更多.  相似文献   

2.
随着数据并行应用需求的日益增长,可任意划分负载的调度问题已经成为并行调度领域新的研究热点.回顾了可任意划分负载调度的基本模型及近年来对这个基本模型的扩展性研究,并给出了它的应用研究和今后的发展方向.  相似文献   

3.
针对Hadoop应用环境复杂、网络带宽等因素多变而影响调度算法性能的问题,提出适用于多任务多目标的Hadoop调度算法(MOSMT)。在分析已有调度算法工作原理的基础上,构建MOSMT算法的数学模型和调度策略;在负载模拟器中进行算法评估,并将MOSMT算法应用于MobiWay;对MobiWay应用中的MOSMT算法性能进行测试分析,以最少的资源和最低的时间成本完成任务的调度。通过与FIFO和Fair调度算法对比表明,该算法能够实现类似的功能,并且在处理多任务多目标时耗时更少,更为经济。  相似文献   

4.
异构机群系统上带返回信息的可分负载多轮调度算法   总被引:1,自引:0,他引:1  
针对处理机具有不同的计算速度、通信能力的异构机群计算环境,以及实际应用中许多问题的求解在处理完任务后向中心处理机节点返回处理结果信息的情形,通过允许计算和通信操作重叠执行,采取FIFO调度策略和多次并行分配计算任务的方法,提出一种带返回结果信息的调度轮数可变的可分负载多轮调度算法.实验结果表明,该算法对于处理具有返回结果信息的应用的调度性能优于UMR可分负载多轮调度算法,并且可以获得近似最优的调度轮数.  相似文献   

5.
下一代航空电子系统必将是模块化和可配置的,而中间件技术是实现此目标的重要途径,考虑到实际的应用环境,对实时性的支持是其重要特征.针对这样的需求和目标,着重研究具有负载均衡策略的实时CORBA调度服务.结合端到端调度服务模型,设计了一个基于负载均衡的调度服务框架,用形式化语言对其进行了描述,并对负载均衡策略和全局调度算法进行了理论分析.解决了实时CORBA规范中节点独立调度的缺陷,使系统的调度服务具有全局优化性,为本系统投入实际应用打下坚实的理论基础.  相似文献   

6.
以参数化的硬件线程执行模型对负栽可分应用的性能进行了分析与预测.重点讨论包含多个可重构处理单元(RPU)在内计算平台的负载可分调度问题,分析了配置因素对调度结果以及应用处理时间的影响.结果表明,若配置与通信操作不完全重叠,存在最大可用RPU数和最优RPU数,进而可得出优化的调度方案及应用处理时间,指导应用的设计实现.  相似文献   

7.
DNS负载均衡是服务器群集负载均衡策略的典型应用方案之一。分析了目前DNS负载均衡的现状和异构分布式系统的特征,提出一种自适应生存期的动态调度负载均衡模型,并且描述了该模型的实现策略。  相似文献   

8.
分布式系统中调度机制对负载共享系统性能有不同的影响.基于CPU-MEM的负载共享策略由于充分考虑了分布式系统中内存资源对系统性能的作用,从而大大降低了系统页失效的次数,提高了系统资源的利用率,最终使得整个分布式系统性能有了很大提高.在一般调度策略RR的基础上,基于CPU-MEM的负载共享,提出了一种节点调度策略--多内存多时间片轮询策略(RR-MMMCS),并在模拟实验中表明了RR-MMMCS策略的优越性.讨论了任务的内存需求量和任务服务时间的变异特性对CPU-MEM负载共享策略以及RR-MMMCS调度机制策略性能的影响,表明无论是对计算密集型任务还是数据密集型任务,基于CPU-MEM负载共享策略和RR-MMMCS调度机制策略有较高的效率和稳定的性能.  相似文献   

9.
随着多媒体应用的普及,面向多媒体应用的并行文件系统负载均衡策略的研究具有现实意义。本文根据视频点播等多媒体应用的特点,提出了面向多媒体应用的并行文件系统动态负载均衡策略,构建了该策略的均衡模型,提出了适于多媒体服务系统的动态调度算法,并对该算法进行了性能分析。最后建立了NFS文件系统负载均衡实验环境,测试了该策略的高效性,充分证明了所提出的面向多媒体应用的并行文件系统负载均衡策略的优势。  相似文献   

10.
现有OpenMP调度策略通常采用动态策略处理程序中的线性循环结构,存在负载不均衡和调度开销大的问题。提出一种针对线性递增或线性递减循环结构的非线性静态调度策略Nonlinear_static。将线性循环负载均匀变化参数与总负载、负载峰值、线程数相结合构建调度模型,计算循环迭代在线程上的映射,使迭代块大小呈非线性递增或递减趋势。将线性循环的负载平均地分配在每个线程上,并在开源OMPi编译器中进行编码。在Adjoint Convolution、Compute Pots、Matrix Multiplication、Mandelbrot Set应用程序上进行多线程调度,实验结果表明,相比静态调度、动态调度、指导调度等策略,Nonlinear_static调度策略在处理线性循环结构时执行时间缩短了5%~10%,且具有无调度开销的优点。  相似文献   

11.
To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network,we present a coordinated scheduling method following the divisible load scheduling paradigm.The proposed scheduling strategy builds on eliminating transmission collisions and idle gaps between two successive data transmissions.We consider a sensor network consisting of several clusters.In a cluster,after related raw data measured by source nodes are collected at the fusion node, in-network data aggregation is fu...  相似文献   

12.
针对无线传感器网络的任务如何在最短时间内完成且充分利用网络资源的问题,提出了一种基于可分负载理论的无线传感器网络任务调度算法(WDTA).该算法根据网络中各个节点的处理能力和节点间的通信能力,将总任务从SINK节点下发至网络中.通过去除节点间的通信干扰来提高资源利用率和减少总任务完成时间.算法在两种分群结构的异构网络环境下进行了分析,得到了在各个节点上最合理的任务分配方案,以及最短的任务完成所需时间.理论分析了基于可分负载理论的无线传感器网络任务调度的极限情况.实验结果表明WDTA算法能够通过合理分配任务,而减少任务完成时间及节点能耗.该方案可以作为设计大规模无线传感器网络的原则.  相似文献   

13.
A divisible load is an amount W of computational work that can be arbitrarily divided into independent chunks of load. In many divisible load applications, the load can be parallelized in a master–worker fashion, where the master distributes the load among a set P of worker processors to be processed in parallel. The master can only send load to one worker at a time, and the transmission can be done in a single round or in multiple rounds. The multi‐round divisible load scheduling problem consists in (a) selecting the subset of workers that will process the load, (b) defining the order in which load will be transmitted to each of them, (c) defining the number m of transmission rounds that will be used, and (d) deciding the amount of load that will be transmitted to each worker at each round , so as to minimize the makespan. We propose a heuristic approach that determines the transmission order, the set of the active processors and the number of rounds by a biased random‐key genetic algorithm. The amount of load transmitted to each worker is computed in polynomial time by closed‐form formulas. Computational results showed that the proposed genetic algorithm outperformed a closed‐form state‐of‐the‐art heuristic, obtaining makespans that are 11.68% smaller on average for a set of benchmark problems.  相似文献   

14.
Cloud computing is an emerging technology in which information technology resources are virtualized to users in a set of computing resources on a pay‐per‐use basis. It is seen as an effective infrastructure for high performance applications. Divisible load applications occur in many scientific and engineering applications. However, dividing an application and deploying it in a cloud computing environment face challenges to obtain an optimal performance due to the overheads introduced by the cloud virtualization and the supporting cloud middleware. Therefore, we provide results of series of extensive experiments in scheduling divisible load application in a Cloud environment to decrease the overall application execution time considering the cloud networking and computing capacities presented to the application's user. We experiment with real applications within the Amazon cloud computing environment. Our extensive experiments analyze the reasons of the discrepancies between a theoretical model and the reality and propose adequate solutions. These discrepancies are due to three factors: the network behavior, the application behavior and the cloud computing virtualization. Our results show that applying the algorithm result in a maximum ratio of 1.41 of the measured normalized makespan versus the ideal makespan for application in which the communication to computation ratio is big. They show that the algorithm is effective for those applications in a heterogeneous setting reaching a ratio of 1.28 for large data sets. For application following the ensemble clustering model in which the computation to communication ratio is big and variable, we obtained a maximum ratio of 4.7 for large data set and a ratio of 2.11 for small data set. Applying the algorithm also results in an important speedup. These results are revealing for the type of applications we consider under experiments. The experiments also reveal the impact of the choice of the platforms provided by Amazon on the performance of the applications under study. Considering the emergence of cloud computing for high performance applications, the results in this paper can be widely adopted by cloud computing developers. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

15.
A divisible load is an amount W of computational work that can be arbitrarily divided into chunks and distributed among a set P of worker processors to be processed in parallel. Divisible load applications occur in many fields of science and engineering. They can be parallelized in a master‐worker fashion, but they pose several scheduling challenges. The divisible load scheduling problem consists in (a) selecting a subset of active workers, (b) defining the order in which the chunks will be transmitted to each of them, and (c) deciding the amount of load that will be transmitted to each worker , with , so as to minimize the makespan, i.e., the total elapsed time since the master began to send data to the first worker, until the last worker stops its computations. In this work, we propose a biased random‐key genetic algorithm for solving the divisible load scheduling problem. Computational results show that the proposed heuristic outperforms the best heuristic in the literature.  相似文献   

16.
针对传统可分割作业多路调度算法不能适应动态网格环境的不足,基于统一多路(Uniform Multi-Round:UMR)算法,提出一种可靠的可分割作业调度机制.系统动态地监控网格资源的变化,当资源发生变化时,通过性能预测与评估,及时地对剩余作业进行再调度.实验表明,较之传统的多路调度算法,该机制在动态的网格环境下,降低了作业完成时间,有效地利用了网格资源,提高了作业调度的可靠性.  相似文献   

17.
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments [Han Min Wong, Bharadwaj Veeravalli, Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times, IEEE Trans. Parallel Distrib. Syst. 15 (3) (2004) 273–288; Han Min Wong, Bharadwaj Veeravalli, Gerassimos Barlas, Design and performance evaluation of load distribution strategies for multiple divisible loads on heterogeneous linear daisy chain networks, J. Parallel Distrib. Comput. 65 (12) (2005) 1558–1577]. We show using a very simple example that their approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in both the above-mentioned references, an optimal schedule has an infinite number of installments. Therefore such a cost model should not be used to design practical multi-installment algorithms.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号