共查询到20条相似文献,搜索用时 62 毫秒
1.
针对传统可分割作业多路调度算法不能适应动态网格环境的不足,基于统一多路(Uniform Multi-Round:UMR)算法,提出一种可靠的可分割作业调度机制.系统动态地监控网格资源的变化,当资源发生变化时,通过性能预测与评估,及时地对剩余作业进行再调度.实验表明,较之传统的多路调度算法,该机制在动态的网格环境下,降低了作业完成时间,有效地利用了网格资源,提高了作业调度的可靠性. 相似文献
2.
3.
容错计算网格作业调度模型的研究 总被引:15,自引:1,他引:14
网格技术的发展对网格系统的效率和服务质量提出了更高要求.在综合研究目前网格作业调度环境的基础上,提出一种容错计算网格作业调度的随机Petri网模型,并给出了网格作业分派策略和计算站点内的作业选择策略,以及容错计算网格的性能评价指标.仿真实验对容错计算网格的性能进行有效的分析,反映故障对网格中不同类别作业的影响. 相似文献
4.
5.
网格计算中的资源是动态和异构的,常规的静态作业调度方法不适宜网格计算环境,对于网格计算中一类并行计算的有效执行有赖于网格资源(CPU和网络带宽等)与作业的有效匹配。提出了一种基于资源预测结果对作业进行调度的策略,首先阐述了网格主机负载预测的研究成果——IAR模型,并提出了一种预测网络带宽的工具——网络性能平面,利用资源预测结果构造了一种反馈作业调度模型并对一类基于时间平衡的作业进行实验。结果表明,该模型在与其他诸多方法比较中,取得了执行时间较短和稳定性较好的效果。 相似文献
6.
作业调度是网格计算的关键技术之一.近年来,人们将信任机制融入到作业调度算法中,以满足作业调度对网格服务质量提出的需求.根据一信任模型,设计了求解基于该信任模型的遗传算法,该算法在保持种群多样性的同时,提高了局部搜索能力.仿真结果表明,该算法可以获得较好的调度结果,且收敛速度快. 相似文献
7.
8.
互联网的异构性导致了网络资源不能充分共享,传统的校园网结构使得教育资源难以大范围共享,网格技术能较好地解决这些问题。通过对校园网现状和网格技术的分析,该文提出校园网格作业调度模型,设计并实现了基于量子遗传算法的作业调度方法。算法借鉴量子比特的叠加性,采用量子编码来表征染色体,能够表示许多可能的线性叠加状态,其整体性能优于普通遗传算法。 相似文献
9.
10.
11.
12.
13.
14.
通过对数据网格模型及任务调度过程进行分析,归纳了数据网格任务调度流程,定义了数据网格的任务执行时间和执行花费。对网格模拟器GridSim进行扩展,增加了数据网格任务调度的模拟功能,介绍了扩展后的模拟器体系结构、工作流程和关键技术。通过实验表明,该任务调度模拟器可以满足数据网格优化理论研究的需要,能够对任务调度策略的性能进行比较。 相似文献
15.
16.
17.
Hadoop集群单队列作业调度会产生短作业等待、资源利用率低的问题;采用多队列调度可兼顾公平、提高执行效率,但会带来手工配置参数、资源互占、算法复杂等问题。针对上述问题,提出三队列作业调度算法,利用区分作业类型、动态调整作业优先级、配置共享资源池、作业抢占等设计,达到平衡作业需求、简化一般作业调度流程、提升并行执行能力的目的。对短作业占比高,各作业占比均衡以及一般作业为主,偶尔出现长、短作业三种情况与先进先出(FIFO)算法进行了对比实验,结果三队列算法的运行时间均比FIFO算法要少。实验结果表明,在短作业聚集时,三队列算法的执行效率提升并不显著;但当各种作业并存且分布均衡时,效果很明显,这符合了算法设计时短作业优先、一般作业简化流程、兼顾长作业的初衷,提高了作业整体执行效率。 相似文献
18.
对可分割的计算密集型大型作业在并行且不间断运行情况下的完工时间与作业分割粒度之间的关系进行研究。首先分析了子作业之间无通信和有通信两种情况下可分割计算密集型大型作业的完工时间和分割粒度的关系,然后对可分割计算密集型大型作业在专用网格资源上的完工时间与分割粒度的关系进行仿真。仿真结果显示,大型作业的完工时间随着分割粒度的增大先减小后增大;当单个子作业的计算时间和通信时间之比增大时,作业的分割粒度可以更细,作业完工时间的最小值减小。因此完工时间最优的作业分割粒度不能过粗或过细。 相似文献
19.
Najme MANSOURI 《Frontiers of Computer Science in China》2014,(3):391-408
Data Grid integrates graphically distributed resources for solving data intensive scientific applications. Effective scheduling in Grid can reduce the amount of data transferred among nodes by submitting a job to a node, where most of the requested data files are available. Scheduling is a traditional problem in parallel and distributed system. However, due to special issues and goals of Grid, traditional approach is not effective in this environment any more. Therefore, it is necessary to propose methods specialized for this kind of parallel and distributed system. Another solution is to use a data replication strategy to create multiple copies of files and store them in convenient locations to shorten file access times. To utilize the above two concepts, in this paper we develop a job scheduling policy, called hierarchical job scheduling strategy (HJSS), and a dynamic data replication strategy, called advanced dynamic hierarchical replication strategy (ADHRS), to improve the data access efficiencies in a hierarchical Data Grid. HJSS uses hierarchical scheduling to reduce the search time for an appropriate computing node. It considers network characteristics, number of jobs waiting in queue, file locations, and disk read speed of storage drive at data sources. Moreover, due to the limited storage capacity, a good replica replacement algorithm is needed. We present a novel replacement strategy which deletes files in two steps when free space is not enough for the new replica: first, it deletes those files with minimum time for transferring. Second, if space is still insufficient then it considers the last time the replica was requested, number of access, size of replica and file transfer time. The simulation results show that our proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, number of intercommunications, number of replications, hit ratio, computing resource usage and storage usage. 相似文献
20.
Najme MANSOURI 《Frontiers of Computer Science》2014,8(3):391-408
Data Grid integrates graphically distributed resources for solving data intensive scientific applications. Effective scheduling in Grid can reduce the amount of data transferred among nodes by submitting a job to a node, where most of the requested data files are available. Scheduling is a traditional problem in parallel and distributed system. However, due to special issues and goals of Grid, traditional approach is not effective in this environment any more. Therefore, it is necessary to propose methods specialized for this kind of parallel and distributed system. Another solution is to use a data replication strategy to create multiple copies of files and store them in convenient locations to shorten file access times. To utilize the above two concepts, in this paper we develop a job scheduling policy, called hierarchical job scheduling strategy (HJSS), and a dynamic data replication strategy, called advanced dynamic hierarchical replication strategy (ADHRS), to improve the data access efficiencies in a hierarchical Data Grid. HJSS uses hierarchical scheduling to reduce the search time for an appropriate computing node. It considers network characteristics, number of jobs waiting in queue, file locations, and disk read speed of storage drive at data sources. Moreover, due to the limited storage capacity, a good replica replacement algorithm is needed. We present a novel replacement strategy which deletes files in two steps when free space is not enough for the new replica: first, it deletes those files with minimum time for transferring. Second, if space is still insufficient then it considers the last time the replica was requested, number of access, size of replica and file transfer time. The simulation results show that our proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, number of intercommunications, number of replications, hit ratio, computing resource usage and storage usage. 相似文献