共查询到18条相似文献,搜索用时 218 毫秒
1.
针对成像、遥感等卫星采集的大容量数据难以及 时回传的问题,提出了一种基于数据续传和微波/ 激光混合链路的数据中继资源调度算法。分析了混合链路中继卫星系统任务数据续传特点, 以完成优先级 加权任务量最大、续传次数最少为调度原则,建立了混合链路任务续传约束规划模型。以任 务的调度顺序 为优化对象,采用任务整传优先和续传次数最少为调度原则确定任务的天线资源和时隙分配 ,提出一种基 于自适应小窗口蚁群(ASAC,adaptive small-window ant colony)算法的任务续传资源调 度优化算法。仿真实验表明,所建调度模型可实现多颗中继星资 源的有效分配,提出的ASAC算法具有较快的收敛速度和较强的全局优化能 力,算法可最大满足用户星数据及时回传的需求。 相似文献
2.
3.
4.
卫星地面站系统任务规划问题是一个基于约束的组合优化问题,是优化卫星任务规划的前提,是影响卫星任务规划结果的重要环节。鉴于此,问题中考虑了可视时间窗口、任务权重以及地面站天线转换时间的约束,以最大化完成任务的优先级之和为目标,建立了调度模型。提出了一种有效求解该问题的结合自适应搜索的模拟退火算法,给出了示例,并对算法进行了仿真验证。 相似文献
5.
针对云环境下任务调度易出现多目标冲突的问题,提出一种改进的基于猫群的多目标优化算法。该算法模拟猫的行为模式,采用基于线性混合比率的猫行为选择方式来提高全局搜索和局部寻优能力;并在迭代过程中结合任务完成时间和任务费用支出,引入一个可调节的多目标集成效用函数,实现了资源与任务的智能调度。实验结果表明,所提算法不仅求解质量高,且在求解速度和调度消耗方面均优于多目标遗传算法和多目标粒子群算法。 相似文献
6.
7.
在云计算环境中存在庞大的任务数,为了能更加高效地完成任务请求,如何进行有效地任务调度是云计算环境下实现按需分配资源的关键。针对调度问题提出了一种基于蚁群优化的任务调度算法,该算法能适应云计算环境下的动态特性,且集成了蚁群算法在处理NP-Hard问题时的优点。该算法旨在减少任务调度完成时间。通过在CloudSim平台进行仿真实验,实验结果表明,改进后的算法能减少任务平均完成时间、并能在云计算环境下有效提高调度效率。 相似文献
8.
微波与激光混合链路中继卫星动态调度快速启发式算法 总被引:1,自引:0,他引:1
针对微波与激光混合链路中继卫星系统实际应用中的动态变化,分析了混合系统动态扰动条件,依据中继卫星资源调度动态调整原则,研究了混合系统动态资源调度策略。以最大化调度任务优先级之和,以及扰动发生后对初始方案扰动变化最小为目标,建立了具有两级优化目标的混合系统动态调度模型。提出了动态插入快速启发式算法并对模型求解算法,算法包括直接插入任务操作、移动插入任务操作和删除插入任务操作。仿真结果表明与完全重调度的算法相比,动态插入算法的方案变化率平均降低了60.10%,且计算速度明显高于重新调度算法,能够有效解决混合链路中继卫星系统动态调度问题。 相似文献
9.
卫星地面站系统资源调度问题是一个基于约束的组合优化问题,在任务时间、地面站可视时间以及各种资源之间连接匹配关系等约束条件下,以充分合理地利用有限资源,使其使用效益得到最大限度的发挥为目标,提出了一种解决该问题的基于贪婪思想的算法,并给出了实验示例对算法进行了仿真验证。实验数据表明,该算法有效提高了算法性能。 相似文献
10.
以数据中继卫星光网络系统资源、任务和约束条件为参量,以任务对资源的选择为优化对象,提出了一种基于自适应遗传算法的数据中继卫星光网络资源调度算法.综合考虑多中继星、多时间窗口、多光学天线以及任务优先级要求,建立调度模型;采用当前任务调度时间的确定和后续任务可见时间窗口的更新的调度操作,对不同资源的任务集合进行调度安排并实现了可见时间窗口的动态更新,获得调度任务的总权值并将其作为参量计算适应度值,最后通过改进的自适应遗传算法对不同调度方案进行寻优.以3颗中继星、12颗用户星,6个光天线,60个任务为条件设置了仿真场景,仿真结果表明该算法在收敛速度、调度效率方面具有优势,适应于多任务、多天线的数据中继卫星光网络系统资源调度. 相似文献
11.
To handle the low planning efficiency of the tasks with too long or too short service time,a task planning scheme was proposed based on task splitting and merging for relay satellite systems.First,a task splitting and merging was developed to transfer the task requirements of user to task units which could be planned with high efficiency.Secondly,based on the parallel machine scheduling model,the optimization problem of the task unit planning to maximize the number of completed tasks in the network was built.Further,a heuristic polynomial time scheduling algorithm was proposed.Simulation results show that compared to the traditional scheme,the task planning scheme perform better in terms of completed task number,resource utilization and fairness. 相似文献
12.
该文针对低轨(LEO)卫星载荷容量受限且功率资源稀缺的问题,面向搭载跳波束(BH)天线的低轨卫星通信系统,提出一种联合跳波束调度和功率分配机制,在满足用户服务质量需求的前提下降低卫星通信载荷功耗,提高卫星通信系统能效。首先建立时延受限下联合考虑波束调度和功率分配的卫星功耗最小化模型。针对网络拓扑的时变特性,基于李雅普诺夫优化方法,将原多时隙优化问题转化为单时隙优化问题,然后采用交替优化的方法获得单时隙问题的次优解。其中,证明波束调度子问题是凸问题,同时通过逐次凸近似和对数变换将功率分配子问题转为凸问题,并提出相应算法获得子问题最优解。仿真结果表明,提出的策略在保证用户平均时延要求的同时,降低了低轨卫星系统平均功耗,并且可通过调整控制参数实现时延和功耗的动态平衡。 相似文献
13.
14.
《电子学报:英文版》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. 相似文献
15.
In this paper, we propose an efficient single‐resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably. 相似文献
16.
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). 相似文献
17.