共查询到18条相似文献,搜索用时 15 毫秒
1.
2.
在云计算环境中存在庞大的任务数,为了能更加高效地完成任务请求,如何进行有效地任务调度是云计算环境下实现按需分配资源的关键。针对调度问题提出了一种基于蚁群优化的任务调度算法,该算法能适应云计算环境下的动态特性,且集成了蚁群算法在处理NP-Hard问题时的优点。该算法旨在减少任务调度完成时间。通过在CloudSim平台进行仿真实验,实验结果表明,改进后的算法能减少任务平均完成时间、并能在云计算环境下有效提高调度效率。 相似文献
3.
针对传统资源调度算法存在资源利用率低等缺陷,提出一种基于改进人工蜂群算法的云计算资源调度模型(IABC).首先建立云计算资源调度问题的数学模型,然后采用人工蜂群算法进行求解,并将个体当前最优值及随机向量引入到蜂群搜索过程中,加快搜索速度,提高搜索能力,最后找到云计算资源调度的最优方案,并采用仿真实验验证算法的有效性.仿真结果表明,IABC算法不仅解决了传统资源调度算法存在的缺陷,提高了云计算资源利用率,而且大幅度减少了任务的完成时间. 相似文献
4.
研究了高动态、资源受限条件下的卫星通信系统资源调度问题。以时间窗口、卫星功耗、信道数量、用户优先级以及任务突发性为约束,建立了卫星资源调度模型。考虑到传统的蚁群优化算法存在初期搜索速度过慢、局部搜索能力较弱以及易陷入局部最优等缺点,提出了以初始解集构造、额外信息素沉积为核心的改进蚁群优化算法,来求解资源调度问题。仿真实验评估了所提资源调度算法在完成任务的数量、优先级和调度完成时间方面的性能。实验结果表明,所提算法具有较快的收敛速度,且与同类型优化算法相比具有更高的调度效率,适用于调度面向密集多波束组网需求的卫星通信系统资源。 相似文献
5.
优化网格资源调度算法可以提高网格系统执行效率,给任务安排合理的执行顺序和合适的处理器是优化网格资源调度算法需突破的关键技术.文中研究并实现了(Heterogeneous-Earliest-Finish) HEFT[1]算法和新的(Hierarchical Reliability-Driven Scheduling)HRDS算法.采用DAG[2]任务图生成函数,通过对已有HEFT算法进行研究,采用SimGrid为在分布计算环境下进行分布并行应用调度研究提供一个仿真环境,对HRDS算法进行了改进和验证.验证过程中在HRDS算法中加入了可靠性开销作为调度依据,并把算法分为两层调度,本地可靠性驱动调度和全局可靠性驱动调度.两算法的调度结果在SimGrid网格模拟器中仿真调度,仿真成功并且调度结果在可靠性和性能方面HRDS都比HEFT算法要好. 相似文献
6.
基于云计算环境下资源利用率低的问题,将一种新提出的金豺优化算法应用于云计算资源调度策略。研究采用Cloudsim作为仿真实验平台,以减少任务总完成时间为优化目标。实验中以猎物位置模拟任务对虚拟机序号的选择,在一定的迭代次数后根据猎物位置得出每个任务对虚拟机序号的最终选择和最终任务总完成时间。改变金豺优化算法的迭代次数并进行实验,结果表明,在迭代次数达100次时,金豺优化算法在云计算资源调度模型上的效果达到最优。将调用金豺优化算法与应用贪心算法和遗传算法下的实验结果进行对比,结果表明,在任务数量大于1 000时,金豺优化算法在云计算资源调度模型上的效果优于贪心算法和遗传算法,效率相较于遗传算法提升了约20%。 相似文献
7.
8.
中高轨卫星测控需求的特性导致遥测数据接收任务占用了绝大部分设备跟踪时长,但遥测任务的资源调度问题的相比遥控和测轨复杂性更高,使得其资源调度算法的自动化水平一直不高。根据中高轨卫星遥测数据接收任务需求和我国测控站布站情况,设计了一种基于先验信息的中高轨卫星遥测任务资源调度算法。该算法以中高轨卫星遥测任务需求整体满足率最大和算法复杂度最低为设计目标,以人工安排中高轨遥测任务测控工作计划积累的有益经验作为先验信息,赋予中高轨卫星遥测任务可行解优先级使用值。通过实际数据仿真分析,该算法极大缩小了中高轨卫星遥测任务可行解空间规模,有效提高了资源调度效率,资源满足率达到99.7%以上,遥测单收设备使用率超过97.7%,为卫星资源调度算法设计提供了参考。 相似文献
9.
基于粒子群算法的嵌入式云计算资源调度 总被引:2,自引:0,他引:2
随着移动互联网的发展,基于嵌入式设备的云计算服务成为研究热点。在国内,嵌入式云计算目前正处于探索研究阶段,云资源管理调度是嵌入式云计算的核心技术之一,其效率直接影响嵌入式云计算系统的性能。为了提高云计算性能,本文提出一种基于粒子群优化算法的云计算任务调度模型。粒子群算法中粒子位置代表可行的资源调度方案,以云计算任务完成时间及资源负载均衡度作为目标函数,通过粒子群优化算法,找出最优资源调度方案。在matlab实验平台进行了仿真,通过大量数据模拟实验表明,该模型可以快速找到最优调度方案,提高资源利用率,具有较好的实用性和可行性。 相似文献
10.
针对传统仿真系统平台的资源分配存在资源闲置、任务挤压和负载均衡等优化问题,利用云计算技术的优势研究并提出了模块化的云仿真平台框架,通过对云仿真资源调度策略研究,提出了一种改进的匈牙利算法.该算法克服了传统匈牙利算法只适用于一对一资源调度的不足,实现了多对一的仿真任务与云仿真资源分配方案,能尽量避免资源调度负载失衡.通过扩展云计算仿真平台CloudSim实现了模拟算法仿真.结果表明.该调度策略能有效的减小云环境下计算机的负载,提高了资源的利用率. 相似文献
11.
《电子学报:英文版》2016,(5):866-872
For the scheduling problem of Semiconductor wafer fabrication (SWF),a new Dispatching rule based on the load balance (DRLB) is proposed.Further,a new Harmony search (HS) algorithm based receipt priority interval (HS_rpi) is presented to minimize the mean cycle time.A kind of chaotic sequence is used as the harmony vector.Then,a conversion method is designed to convert the real number harmony vector to the mixed vector representing the priorities of all receipts and the algorithm parameters.In order to increase the algorithm robustness and decrease the scale of the scheduling problem,based on receipt priority interval and DRLB,we give a special conversion method used to convert the above mixed vector to the solution of the scheduling problem of SWF.Computational simulations based on the practical instances validate the proposed algorithm. 相似文献
12.
13.
14.
Algorithmic aspects for functional partitioning and scheduling in hardware/software co-design 总被引:4,自引:0,他引:4
Wu Jigang Thambipillai Srikanthan Tao Jiao 《Design Automation for Embedded Systems》2008,12(4):345-375
Hardware/software (HW/SW) partitioning and scheduling are the crucial steps during HW/SW co-design. It has been shown that
they are classical combinatorial optimization problems. Due to the possible sequential or concurrent execution of the tasks,
HW/SW partitioning and scheduling has become more difficult to solve optimally. In this paper more efficient heuristic algorithms
are proposed for the HW/SW partitioning and scheduling. The proposed algorithm partitions a task graph by iteratively moving
the task with highest benefit-to-area ratio in higher priority. The benefit-to-area ratio is updated in each iteration step
to cater for the task concurrence. The proposed algorithm for task scheduling executes the task lying in hardware-only critical
path in higher priority to enhance the task forecast. A large body of experimental results conclusively shows that the proposed
heuristic algorithm for partitioning is superior to the latest efficient combinatorial algorithm (Tabu search) cited in this
paper. Moreover, the Tabu search for partitioning has been further improved by utilizing the proposed heuristic solution as
its initial solution. In addition, the proposed scheduling algorithm obtains the improvements over the most widely used approaches
by up to 10% without large increase in running time.
This work was presented in part at 2006 IEEE International Conference on Field Programmable Technology (ICFPT). 相似文献
15.
Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM
下载免费PDF全文
![点击此处可从《ETRI Journal》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak‐to‐Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search‐based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms. 相似文献
16.
17.
置换流水车间调度问题(PFSP)是典型的具有工程背景的组合优化问题.对该问题的研究具有重要的理论意义与应用价值.本文针对PFSP问题提出了新的基于粒子群优化(PSO)的调度算法.论文分析了广义粒子群优化(GPSO)模型中信息流动拓扑结构的缺陷,提出新的基于种群的元启发式算法信息共享机制SISM.基于SISM信息共享机制的PSO调度算法利用PFSP问题的邻域知识指导个体的局部搜索.与历史文献中该问题的代表性算法比较,该算法可在调度质量与计算费用之间获得较好的平衡.仿真实例验证了该调度算法的有效性. 相似文献
18.
Huanxin Henry Xiong MengChu Zhou 《Semiconductor Manufacturing, IEEE Transactions on》1998,11(3):384-393
This paper proposes and evaluates two Petri net-based hybrid heuristic search strategies and their applications to semiconductor test facility scheduling. To reduce the setup time, such as the time spent to bring the test facilities to the required temperatures, scheduling multiple lots for each job type together is desirable. Petri nets can concisely model multiple lot sizes for each job, the strict precedence constraints, multiple kinds of resources, concurrent activities and flexible routes. To cope with the complexities for multiple lots scheduling, this paper presents two Petri net-based hybrid heuristic search strategies. They combine the heuristic best-first strategy with the controlled back tracking strategy based on the execution of the Petri nets. The obtained scheduling results are compared and analyzed through a small-size test facility. The better algorithm is also applied to a more sizable facility containing types of resources with a total of 79 pieces and 30 jobs. The future work includes the real-time implementation of the proposed method and scheduling results in real industrial settings 相似文献