首页 | 本学科首页   官方微博 | 高级检索  
     


A new decomposition algorithm for rearrangeable Closinterconnection networks
Authors:Hyun Yeop Lee Hwang   F.K. Carpinelli   J.D.
Affiliation:Hyundai Electron. Co., Ichon;
Abstract:We give a new decomposition algorithm to route a rearrangeable three-stage Clos network in O(nr2) time, which is faster than all existing decomposition algorithms. By performing a row-wise matrix decomposition, this algorithm routes all possible permutations, thus overcoming the limitation on realizable permutations exhibited by many other routing algorithms. This algorithm is extended to the fault tolerant Clos network which has extra switches in each stage, where it provides fault tolerance under faulty conditions and reduces routing time under submaximal fault conditions
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号