共查询到13条相似文献,搜索用时 109 毫秒
1.
传统相控阵雷达中的调度算法难以充分发挥数字阵列雷达的多功能优势.针对这一问题,结合数字阵列雷达的任务结构,提出一种在线交错调度算法.通过将交错调度分析分解为时间资源约束分析和能量资源约束分析,算法能够对所有满足约束的任务进行交错调度:利用任务中的等待期来交错执行其它任务的发射期或接收期,并且不同任务的接收期可实现相互交叠.仿真结果表明,由于雷达任务中等待期和接收期得到充分利用,相比于三种传统的调度算法,所提算法的调度成功率、实现价值率和时间利用率均得到有效提升. 相似文献
2.
该文针对分布式雷达组网系统提出了一种基于脉冲交错的实时波束驻留调度算法。该算法引入时间指针向量,用于指示何时选择具有最高综合优先级的波束驻留任务,该任务被分配至交错时间利用程度最低的雷达节点,有效减少了调度过程中引入的时间空隙;同时,脉冲交错分析方法决定对于被分配的波束驻留任务是否可以在相应的雷达节点成功调度执行,其中,引入时隙占用矩阵和能量消耗矩阵来表征各个雷达节点的时间与能量资源使用情况,简化了交错分析过程,并实现了具有不同脉冲重复周期与个数的波束驻留任务之间的交错。此外,为了提高波束驻留调度的效率,所提算法还引入交错时间利用率门限自适应选择时间指针的滑动步长。仿真结果表明,该文所提算法能实现分布式雷达组网系统实时的波束驻留调度,并能获得较现有波束驻留调度算法更好的调度性能。 相似文献
3.
针对相控阵雷达波束快速扫描能力,提出了一种基于时间指针的相控阵雷达在线脉冲交错调度算法。首先建立了雷达驻留任务模型并分析了调度约束条件,然后引入时间指针来指向当前调度分析时刻,分别从波束的角度和脉冲的角度分析了驻留任务交错的几种方式,并给出了三种脉冲重叠方式的时间约束条件,最后在满足时间和能量资源约束的条件下,选取综合优先级最高的雷达驻留任务进行调度。仿真结果表明,与基于收益的调度算法相比,此算法能有效地降低任务丢失率,提高时间利用率和能量利用率。 相似文献
4.
5.
针对数字阵列雷达波束驻留调度问题,研究了基于调度间隔分析的调度算法。该算法综合分析了1个调度间隔内申请执行的波束驻留任务,且调度过程中进行了脉冲交错。调度准则充分考虑了任务的工作方式优先级和截止期,并以任务丢失率、实现价值率、系统时间利用率作为评估指标。仿真结果表明修正截止期准则主要强调任务的紧迫性,修正工作方式优先级主要强调任务的重要性,而截止期—工作方式优先级和工作方式—截止期调度准则可以在二者间更好地折中,在总体性能上要优于其他调度准则。 相似文献
6.
7.
8.
9.
10.
11.
Aiming at the task scheduling problem in the DAR (digital array radar), an online task interleaving scheduling algorithm is proposed. The full structure of the DAR task is explicitly considered in a way that the waiting duration can be utilized to transmit or receive subtasks, which is called the task interleaving, as well as the receiving durations of different tasks can be overlapped. The algorithm decomposes the task interleaving analysis into the time resource constraint analysis and the energy resource constraint analysis, and online schedules all kinds of tasks that can be interleaved. Thereby the waiting durations and receiving durations can be fully utilized. The simulation results demonstrate that the proposed algorithm improves the successfully scheduling ratio by 73%, the high value ratio by 86% and the time utilization ratio by 55% compared with the HPEDF (highest priority and earliest deadline first) algorithm. 相似文献
12.
传统相控阵雷达任务调度算法中,各单驻留任务不可分割,发射与接收之间的空闲等待时间未被有效利用,系统调度能力受限。针对此问题,该文在深入分析交叉规则及选取策略的基础上,提出一种基于采样周期最大公约数分区的任务实时交叉调度(PDI)算法,其可解决交叉调度过程中任务因采样周期不同而产生冲突的难题,该文还分析了调度算法流程,交叉算法流程及过载处理等。仿真结果表明,该算法可大幅提高系统调度的负载能力,调度性能明显优于传统算法。 相似文献
13.
A system is considered in which V users are competing for the transmission capacity of a link. The users generate messages in a Poisson manner. The message length distribution of each user is arbitrary and may differ for different users. The objective is to investigate nonpreemptive service-time independent scheduling as a means of selectively controlling the average waiting time of the users. The average waiting time assignments that can be realized are characterized. They can be used to establish, in O (V log V ) computations, whether a given average waiting time assignment is feasible. The proof of the result relies on a universal scheduling strategy which is simple, is time-invariant, and can be used to realize any feasible average waiting time assignment. A waiting time cost function is associated with each user in order to investigate the problem of finding a nonpreemptive scheduling strategy that minimizes the overall waiting time cost. A set of optimality conditions is given for this problem, and an algorithm is constructed solving it in O (V ) log V steps. With a simple modification, the algorithm also solves the problem of finding a nonpreemptive scheduling strategy that minimizes the lexicographic ordering of the waiting time costs. Results are extended to the preemptive case 相似文献