共查询到16条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
5.
6.
现有的关于Clos交换结构的调度算法在关注调度性能的同时,逐渐忽略了其在硬件实现上的复杂度。该文根据一款星载交换芯片的设计实现,提出了一种改进型的Clos结构,且在此基础上设计了一种硬件实现简单且能实现极大匹配的调度算法。 相似文献
7.
Internet 中的交换机面临着高速交换和提供QoS保证的双重挑战,前者要求交换机的缓存以线速工作,后者要求交换机能完全模仿输出队列交换机。目前交叉点缓存交换机仿真输出队列交换机的方案需要交换机内部加速2倍,对硬件实现要求较高。该文利用双端口技术,提出了一种新型的交叉点缓存交换机结构,理论分析说明,该变长分组交换机在无需内部加速的情况下能够仿真输出队列交换机,并且交叉点缓存的需求是有下界的,从而表明该交换结构适合高速交换。 相似文献
8.
输入排队结构交换机分组调度研究 总被引:12,自引:1,他引:12
以决定分组调度算法的交换结构为基础,从协调,减少和隔离输入排队交换结构中输入输出竞争裁决冲突的角度,分别讨论了VOQ,CIOQ,CICQ结构中的分组调度问题,并以当前最新的调度算法为例加以说明,进行了定性分析和定量对比,指出了具体有待研究的问题。随后讨论了最近才开始研究的光电混合结构中的分组调度问题。最后从交换结构和算法两个方面探讨了今后的研究方向和发展趋势。 相似文献
9.
10.
分组调度算法对于确保分组交换系统的QoS具有重要意义。时延,公平性,计算复杂度是微量分组度算法的主要指标。本文提出了一种双服务器分组调度算法,该算法在两种不同的工作状态下分别采用两种服务规则决定分组的服务次序。其中一种服务规则用来确保分组的时延,另一种服务规则在时延得到保障的情况下对系统的公平性进行改善,这两种规则计算都不复杂。因此本文提出的算法具有时延低,公平性较好,计算复杂度低的特点。 相似文献
11.
分组网络中包调度算法研究 总被引:1,自引:0,他引:1
下一代因特网要支持QoS(quality of service)实现,而包调度又是QoS实现的关键技术之一。文中对现有的包调度算法进行了分类,分析和比较了各类算法的技术特点与性能优劣,讨论了包调度算法研究今后的发展方向。 相似文献
12.
13.
14.
An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin 总被引:1,自引:0,他引:1
This paper addresses a frame-oriented scheduling discipline, EDF-RR (earliest deadline first round robin), for OQ (output-queued) switch architecture and data traffic consisting of fixed-length cells. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a repeatedly-transferred frame. Each cell that is going to be transferred in the frame is assigned a virtual release time and a virtual deadline according to the bandwidth reservation scheme. The transmitting order of the cells in the frame is determined by non-preemptive non-idling EDF algorithm so that cells of a backlogged session in the frame are distributed as uniformly as possible. Through the analysis applying real-time scheduling theory and network calculus as well as network simulation, EDF-RR takes the advantage of O(1) computational complexity, and possesses tight delay bounds and lenient buffer requirements. The proposed scheduling discipline is appropriate for distributed real-time systems as we show that sessions can be configured based on message traffic models and deadline requirements. Also, a modified version of EDF-RR, called EDF-DRR, can be applied as traffic regulator when jitter requirements exist among active sessions.
This work was sponsored in part by the Federal Aviation Administration (FAA) via grant DTFA03-01-C-00042. Findings contained herein are not necessarily those of the FAA. 相似文献
15.
异构计算系统中基于遗传算法的任务分配与调度 总被引:2,自引:2,他引:0
任务分配与调度是异构计算系统(HCS)的核心问题之一。本文提出了一种对异构计算系统进行任务分配与调度的遗传算法。首先对HCS任务分配调度问题做出定义,然后分别讨论了问题的编码表示,种群初始化,染色体适应度函数设计。杂交、内部杂交与迁移遗传算子设计,控制参数自适应,算法的总体框架等。最后给出算法的仿真实验情况及实验结果分析与结论等。 相似文献
16.
Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets 总被引:3,自引:2,他引:1
Callegati F. Cerroni W. Corazza G. Develder C. Pickavet M. Demeester P. 《Photonic Network Communications》2004,8(2):163-176
We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently. 相似文献