Abstract:
In order to improve the performance of the presented schemes with low scalability and great complexity, this paper builds a high- performance switching architecture based on parallel storages scheme named Parallel Storage Scheme(PSS). With the flow model techniques, it proves that PSS switch can achieve a throughput of 100% without speedup to the arbitrary admissible traffic that satisfies the Strong Law of Large Number(SLLN). Simple Priority Double Round Robin(SPSDRR) algorithm is presented based on PSS. Simulation results indicate that PSS switch with SPDRR algorithm can obtain high performance.
Key words:
switching architecture,
scheduling algorithm,
double round robin,
priority
摘要: 针对目前多数交换机制可扩展性差、实现复杂度大的问题,基于并行存储机制构建高性能交换结构PSS,采用流模型证明在不加速的情况下PSS交换结构对满足大数定律的可容许到达业务能够实现100%的吞吐量,在该结构的基础上提出简单优先双轮询算法SPDRR。仿真结果表明,应用SPDRR算法的PSS交换结构能够获得很好的性能。
关键词:
交换结构,
调度算法,
双轮询,
优先级
CLC Number:
ZHENG De-ren; WANG Bin-qiang; HU Hong-chao; LI Hui. Switching Architecture Based on Parallel Storage Scheme and Its Scheduling Algorithm[J]. Computer Engineering, 2009, 35(8): 131-133.
郑德任;汪斌强;扈红超;李 挥. 基于并行存储机制的交换结构及其调度算法[J]. 计算机工程, 2009, 35(8): 131-133.