摘要： 在混洗交换网络中,窗口检测法涉及的多窗口之间复杂的制约关系对无冲突路由的构造形成严重阻碍。为克服这一阻碍,提出正规序列概念,在此基础上给出构造无冲突路由的新依据——序列检测法。该方法将2n－1级Omega网络中无冲突路由的构造转化为单个序列的构造,与传统的窗口检测法相比,新方法不仅缩小了构造对象的空间规模,而且降低了构造对象的复杂度,为更方便地构造混洗交换网络路由创造了条件。
| [1] Stone H S．Parallel Processing with the Perfect shuffle[J].IEEE Transactions on Computers,1971,C-20(2):153-161 [2] Akbar S,Reza S N,Hamid Sarbazi A．The Shuffle-Exchange Mesh Topology for 3D NoCs[C]∥The International Sympo-sium on Parallel Architectures,Algorithms,and Networks．IEEE,2008,3:275-280 [3] Chou W Y,Chen R B,Chen Chiu-yuan．All-to-All Personalized Exchange in Generalized Shuffle-exchange Networks[J]．Theoretical Computer Science,2010,411:16-18 [4] Muller O,Baghdadi A,Jezequel M．From parallelism levels to amulti-asip architecture for turbo decoding[J]．IEEE Transactions on Very Large Scale Integration(VLSI) Systems,2009,7(1):92-102 [5] Raghavendra C S,Varma A．Rearrangeability of the 5-StageShuffle-Exchange Network for N=8[A]∥Proceedings of 1986International Conference on Parallel Proceeding[C]．University Park,USA,1987:119-122 [6] 戴浩,沈孝钧．在7级混洗交换网络中实现16×16的可重排性[J].电子学报,2007,35(10):1875-1885 [7] Ge F B,Zhang T,Song J Y,et al．Study on the rearrangeability of 3n－1stages shuffle-exchange network[J]．Journal on Communications,2011,32(10):10-18 [8] Lee K Y．On the rearrangeablity of the 2(log2 N)-1stage permutation network[J]．IEEE Transactions on Computers,1985,C-34(5):412-425 [9] Sovis F．On rearrangeable networks of the shuffle-exchange network[A]∥Proc of frontiers of massively parallel computation [C]．College Park,USA,1990:304-314 [10] Abdennadher A,Feng T．On rearrangeability of Omega-Omega networks[A]∥Proc.1992International Conference on Parallel Proc [C]．University of Michigan,USA,1992:159-165 [11] Hasan C．Rearrangeablity of 2n－1 stage shuffle-exchange net-works[J]．SIAM Comp,2003,32(3):557-585 [12] Raghavendra C S．On the Rearrangeability Conjecture of(2log2N－1)-stage Shuffle-Exchange Network[A]∥IEEE Computer Society Technical Committee on Computer Architecture Newsletter[C].Winter,1994-95,1994:10-12 [13] Kim M,Yook H,Maeny S．On the correct-ness of inside-outrouting algorithm [J]．IEEE Transactions on Computers,1997,6(7):820-823 [14] Parker D S．Notes on shuffle/exchange-type switching networks [J].IEEE Transactions on Computers,1980,c-29:213-222 [15] Bhardwaj V P,Nitin．A New Fault Tolerant Routing Algorithm for Advance Irregular Augmented Shuffle Exchange Network[C]∥14th International Conference on Modelling and Simulation．2012 [16] Arzilawati N,Yunus M．Mohamed Othman Shuffle ExchangeNetwork in Multistage Interconnection Network:A Review and Challenges[J]．International Journal of Computer and Electrical Engineering,2011,3(5):724-728 [17] Ge F B,Zhao M,Zhang T,et al．A new policy to solve routingconflict in shuffle-exchange network[J]．Science China Information Sciences,2011,54(7):1512-1523 [18] Garofalakis J,Stergiou E．Performance evaluation for single- and semilayer multistage interconnection networks servicing multicast traffic by full multicast operation[J]．International Journal of Communication Systems,2011,24(4):415-437 |
| No related articles found! |
|
||
首页