专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06633568B1 Two-dimensional round-robin scheduling method with multiple selection in an input-buffered switch 有权
标题翻译：二维轮询调度方法，在输入缓冲交换机中进行多重选择
公开(公告)号：US06633568B1
公开(公告)日：2003-10-14
申请号：US09494729
申请日：2000-01-31
申请人： Man Soo Han , Jung Hee Lee , Gab Joong Jeong , Bhum Cheol Lee
发明人： Man Soo Han , Jung Hee Lee , Gab Joong Jeong , Bhum Cheol Lee
IPC分类号： H04L1254
CPC分类号： H04L49/153 , H04L12/5601 , H04L47/50 , H04L47/6225 , H04L49/254 , H04L49/255 , H04L49/30 , H04L49/3081 , H04L2012/5679 , H04L2012/5683
摘要： A two-dimensional round-robin scheduling method with multiple selection is provided. The two-dimensional round-robin scheduling method in accordance with an embodiment of the present invention includes following steps. First step is for checking whether a request is received from the input buffer module and building mxm request matrix r(i,j), i,j=1, . . . , m. Second step is for setting mxm search pattern matrix, d(i,j), i,j=1, . . . , m. The search pattern matrix describes search sequence, S=1, . . . , m. Third step is for initializing elements of mxm allocation matrix a(i,j), i,j=1, . . . , m. The allocation matrix contains information whether transmission request is accepted and which switching plane the accepted request uses in transmission. Fourth step is for examining a request matrix in accordance with the search sequence S and finding r(i,j) that sent a request. Fifth step is for setting a(i,j) for all (i,j) pairs found in the fourth step so that elements of allocation matrix at ith row have different values in range from 1 to n and elements of allocation matrix at jth column have different values in range from 1 to n. Sixth step is for repeating the fourth step and the fifth step as the search sequence S is increased from 1 to m by 1.
摘要翻译：提供了一种具有多重选择的二维轮询调度方法。根据本发明的实施例的二维轮询调度方法包括以下步骤。第一步是检查是否从输入缓冲区模块接收请求，并建立mxm请求矩阵r（i，j），i，j = 1，。。，m。第二步是设置mxm搜索模式矩阵，d（i，j），i，j = 1，。。。，m。搜索模式矩阵描述了搜索序列S = 1。。。，m。第三步是初始化mxm分配矩阵a（i，j），i，j = 1，...的元素。。。，m。分配矩阵包含传输请求是否被接受以及接受请求在传输中使用的切换平面的信息。第四步是根据搜索序列S检查请求矩阵，并找到发送请求的r（i，j）。第五步是为了在第四步中发现的所有（i，j）对设置一个（i，j），使得第i行的分配矩阵的元素在1到n的范围内具有不同的值，并且第j列的分配矩阵的元素在1到n的范围内具有不同的值。第六步是当搜索序列S从1增加到1时重复第四步和第五步骤。

IPRDB

热门服务

关于我们

友情链接

联系方式