两级分布式共享存储器结构及算法  

A Two-Stage Distributed Shared Memory Architecture and its Scheduling Algorithms

作　　者：伊鹏[1] 罗敏轩[1] 靳毓国[1] 郭云飞[1] 

机构地区：[1]信息工程大学国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机科学》2004年第4期61-63,共3页Computer Science

基　　金：国家863课题基金(No.2001-AA-12-4011)

摘　　要：商用存储器的随机访问速率和交换结构的交换速率一直是限制高速路由器性能提高的主要因素,改善交换结构使其降低对存储器存取速率的要求是解决问题的关键。本文提出了两级分布式共享存储器(TSDSM)结构,给出了该结构模拟输出排队调度算法所需存储器个数的下界及相应的模拟FCFS与PIFO输出排队算法,并对算法模拟输出排队算法的可行性给出了证明。TSDSM结构及相应的算法控制机制不仅使目前商用存储器的存取速率能满足交换速率的要求,而且交换结构可以工作于非加速状态。The capacity of high speed packet switch is limited by the random access time of commercially available memories and the rate of switch architecture. The key point to solve such a problem is improving switch architecture and using slow memories to realize high performance packet switch. In this paper, we propose a two-stage distributed shared memory architecture (TSDSM). The lower bound of it is also given. Scheduling algorithms for a TSDSM imitating a FCFS output-queued (OQ) switch and a FIFO OQ switch are given too. The validities of these algorithms are theoretically proved. Without speedup the TSDSM can be used to realize high speed packet switch with commercially available memories.

关 键 词：计算机网络 交换机 分布式共享存储器 交换结构 输出排队调度算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]