检索结果-内蒙古大学图书馆

A high-performance ATM switch based on modified shuffle-exchange network

COMPUTER COMMUNICATIONS 1999年第2期22卷 110-119页

作者： Çam, H King Fahd Univ Petr & Minerals Dept Comp Engn Dhahran 31261 Saudi Arabia

This paper presents an output buffering ATM switch, called modified shuffle-exchange network (MSN) that is obtained by inserting a connection pattern just after every other shuffle-exchange stage. The purpose of modifying a shuffle-exchange network by inserting a connection pattern is to reduce significantly the number of its internal conflicts. Each link of every other stage of MSN has a filter to route successful packets to their destinations. Instead of employing the traditional destination tag routing scheme on MSN, we developed a fast destination tag routing scheme, called FDR, for MSN. In the traditional destination tag routing scheme, the routing tag of a packet is made equal to its destination address. In FDR, however, the routing tag of a packet is determined by its destination address as well as source address. FDR often requires less than log(2) N stages to route a packet from its source to destination, which leads the traffic load to be reduced at the successive stages of the network. An analytical model is presented to analyze the performance of MSN under uniform traffic. Under a variety of traffic models, including uniform, hot-spot, ATM bursty, and output concentration, extensive simulations are run to examine and compare the performance of MSN with two existing similar networks. The simulation results show that MSN with FDR improves the packet loss probability substantially. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： shuffle-exchange network internal conflict destination tag routing scheme output buffering ATM switch performance evaluation

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT ALGORITHM FOR GENERATING LINEAR TRANSFORMATIONS IN A shuffle-exchange network

引用

SIAM JOURNAL ON COMPUTING 1986年第1期15卷 216-221页

作者： ETZION, T LEMPEL, A Technion-Israel Inst of Technology Computer Science Dep Haifa Isr Technion-Israel Inst of Technology Computer Science Dep Haifa Isr

This paper presents an algorithm for generating all the permutations defined by linear transformations on a shuffle-exchange network of 2n2n2^n processors in <s

This paper presents an algorithm for generating all the permutations defined by linear transformations on a shuffle-exchange network of

2^{n}

$2^n$ processors in

关键词： algorithm complexity linear transformations permutations shuffle-exchange network

来源：评论

学校读者我要写书评

暂无评论

A novel QCA shuffle-exchange network architecture with multicast and broadcast communication capabilities

引用

MICROELECTRONICS JOURNAL 2019年 93卷

作者： Abutaleb, M. M. Helwan Univ Dept Elect & Commun Engn Cairo Egypt

In large-scale computing systems, interconnection networks are used to provide reliable and fast on-chip communication between processing elements and embedded modules in order to perform complex core tasks. These networks can be formed in different architectures that are built using multiple stages of switching elements and connecting links. shuffle-exchange network (SEN) is broadly used as an interconnection architecture with unique input-output paths, simple configuration, and latency reduction. In this paper, a new four-function switching element (SE) with two inputs and two outputs is proposed and designed in Quantum-dot Cellular Automata (QCA) nanotechnology. It can be configured to form all possible 1 x 2 and 2 x 2 interconnections. Consequently, the proposed switch is utilized to implement the nanoscale interconnection structure of multi-stage SEN with multicast and broadcast capabilities for the first time. It can perform "One-to-One", "One-to-Multiple", and "One-to-All" communications between various components in computing systems. In order to demonstrate the functionality and capabilities of the proposed QCA-based SEN architecture, performance is evaluated and analyzed. Furthermore, its hardware complexity is examined and compared with existing QCA-based network architectures.

关键词： Nanoelectronics QCA Interconnection network shuffle-exchange network On-chip communication Switching element

来源：评论

学校读者我要写书评

暂无评论

A COMPARATIVE-STUDY OF shuffle-exchange, MANHATTAN STREET AND SUPERCUBE network FOR LIGHTWAVE APPLICATIONS

COMPUTER NETWORKS AND ISDN SYSTEMS

引用

COMPUTER networkS AND ISDN SYSTEMS 1994年第6-8期26卷 1007-1022页

作者： SEN, A MAITRA, P ARIZONA STATE UNIV DEPT COMP SCITEMPEAZ 85287 IOMEGA CORP IOSUB DEPTROYUT 84067

The shuffle-exchange network and the Manhattan Street network are two interconnection topologies, that have been proposed for application in the design of Metropolitan Area networks using multihop lightwave techniques. A Hypercube like interconnection network called Supercube was proposed earlier for application in parallel and distributed computation. In this paper we study the suitability of the Supercube structure for application in the design of Metropolitan Area networks. We study its performance with respect to the shuffle-exchange network and the Manhattan Street network. The static characteristics of the networks have been studied through their graph theoretic properties. The stochastic characteristics of the network have been studied through simulation. The results of the study show that the Supercube network is an attractive alternative to the shuffle-exchange and Manhattan Street network for Metropolitan Area network application.

关键词： SUPERCUBE MANHATTAN STREET network shuffle-exchange network SIMULATION LIGHTWAVE METROPOLITAN AREA network

来源：评论

学校读者我要写书评

暂无评论

Rearrangeability of (2n-1)-stage shuffle-exchange networks

引用

SIAM JOURNAL ON COMPUTING 2003年第3期32卷 557-585页

作者： Çam, H Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA

Rearrangeable networks can realize each and every permutation in one pass through the network. shuffle-exchange networks provide an efficient interconnection scheme for implementing various types of parallel processes. Whether (2n - 1)-stage shuffle-exchange networks with N = 2(n) inputs/outputs are rearrangeable has remained an open question for approximately three decades. This question has been answered affirmatively in this paper. An important corollary of the main result is the proof that two passes through an Omega network are sufficient and necessary to implement any permutation. In obtaining the main results of this paper, frames that look like grids with horizontal links of different lengths are shown to be remarkable tools for identifying and characterizing the binary matrix representations of permutations.

关键词： shuffle-exchange network rearrangeable network permutations balanced matrices frames

来源：评论

学校读者我要写书评

暂无评论

Analyzing the reliability of shuffle-exchange networks using reliability block diagrams

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2014年 132卷 97-106页

作者： Bistouni, Fathollah Jahanshahi, Mohsen Islamic Azad Univ Qazvin Branch Dept Informat Technol Qazvin Iran Islamic Azad Univ Cent Tehran Branch Young Researchers & Elite club Tehran Iran

Supercomputers and multi-processor systems are comprised of thousands of processors that need to communicate in an efficient way. One reasonable solution would be the utilization of multistage interconnection networks (MINs), where the challenge is to analyze the reliability of such networks. One of the methods to increase the reliability and fault-tolerance of the MINs is use of various switching stages. Therefore, recently, the reliability of one of the most common MINs namely shuffle-exchange network (SEN) has been evaluated through the investigation on the impact of increasing the number of switching stage. Also, it is concluded that the reliability of SEN with one additional stage (SEN+) is better than SEN or SEN with two additional stages (SEN+2), even so, the reliability of SEN is better compared to SEN with two additional stages (SEN+2). Here we re-evaluate the reliability of these networks where the results of the terminal, broadcast, and network reliability analysis demonstrate that SEN+ and SEN+2 continuously outperform SEN and are very alike in terms of reliability. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Multistage interconnection networks shuffle-exchange network Fault-tolerance Reliability block diagrams Series and parallel

来源：评论

学校读者我要写书评

暂无评论

A MATHEMATICAL ABSTRACTION OF THE REARRANGEABILITY CONJECTURE FOR shuffle-exchange networkS

引用

OPERATIONS RESEARCH LETTERS 1989年第2期8卷 85-87页

作者： HWANG, FK AT&T Bell Laboratories Murray Hill New Jersey 07974 USA

shuffle-exchange networks have received a great deal of attention as interconnecting networks for parallel computing. One unsolved problem is the minimum by number of stages required by a shuffle-exchange network with 2 n inputs and outputs to be rearrangeable. It turns out that this problem was studied much earlier by Beneš in his work on switching networks. Beneš also conjectured that 2 n − 1 stages suffice for rearrangeability and published the conjecture in a more general setting in 1975. So far, the conjecture has been verified only for n ⩽ 3. It is felt that the conjecture is a difficult mathematical problem and its solution may require a greater participation of the mathematical community. In this note we give a mathematical abstraction of the conjectured devoid of any network connection. We also show that no number of stages is large enough to guarantee a nonblocking network.

关键词： shuffle-exchange network Omega network rearrangeability

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT ROUTING ALGORITHM FOR REALIZING LINEAR PERMUTATIONS ON PT-shuffle-exchange networkS

引用

IEEE TRANSACTIONS ON COMPUTERS 1991年第11期40卷 1292-1298页

作者： HUANG, ST TRIPATHI, SK CHEN, NS TSENG, YC UNIV MARYLAND DEPT COMP SCISYST DESIGN & ANAL GRPCOLLEGE PKMD 20742 UNIV MARYLAND INST ADV COMP STUDIESCOLLEGE PKMD 20742

This paper presents an efficient routing algorithm for realizing any permutation in LIN (linear-permutation-class) on single stage shuffle-exchange networks with k x k switching elements, where k = p is a prime number. For any positive integer number n there are N = k(n) processors connected by the network. The proposed algorithm can realize LIN in 2n - 1 passes;it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffle-exchange networks with (p(t) x p(t)) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k > 2 is discussed. Further, by using the techniques developed in this paper, we present an optimal O(log n) parallel algorithm for solving a set of linear equations with a nonsingular coefficient matrix when the arithmetic is over the finite field GF(p(t)).

关键词： PERMUTATION MATRIX PERMUTATIONS ROUTING ALGORITHM shuffle-exchange network

来源：评论

学校读者我要写书评

暂无评论

A method of batching conflict routings in shuffle-exchange networks

引用

THEORETICAL COMPUTER SCIENCE 2014年 522卷 24-33页

作者： Zhang, Yi-Hao Shen, Yue-Hong Dong, Min Jiang, Yi-Min PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China PLA Univ Sci & Technol Inst Command Automat Nanjing 210007 Jiangsu Peoples R China 78046 PLA Troops Chengdu 610011 Peoples R China

In order to resolve the problem of separating conflict routings in shuffle-exchange networks, we define the concepts of the maximal no-conflict routing group and the least no-conflict routing grouping (LNCRG), as well as an associated eigenfunction and covering function. Based on these concepts, we propose a theoretical and practical method of computing the LNCRG using Boolean algebra. In addition, an algorithm for approximately computing the LNCRG is put forward to improve the efficiency of batching routings. Our theoretical analysis and experiments show that the time efficiency and accuracy of the algorithm are excellent. The proposed method provides strong support for the batching of routing policies in large-scale information exchanges. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Covering function Eigenfunction Least no-conflict routing grouping Maximal no-conflict routing group shuffle-exchange network

来源：评论

学校读者我要写书评

暂无评论

A new policy to solve routing conflicts in shuffle-exchange networks

引用

Science China(Information Sciences) 2011年第7期54卷 1512-1523页

作者： GE FangBin 1,ZHAO Min 1,ZHANG Tao 1 & WANG JianXin 2 1 College of Command Automation PLA University of Science and Technology,Nanjing 210007,China 2 Institute of China Electronic System Engineering,Beijing 100039,China College of Command Automation PLA University of Science and Technology Nanjing China Institute of China Electronic System Engineering Beijing China

Batch routing is an important approach for solving routing conflicts in SE (shuffle-exchange) ***,the complexity of batching and the uncertainty of batch size makes this approach *** on sequence division and routing coding concepts,we propose a method for detecting routing conflicts in an SE network,known as dividing detection that is more efficient than the method for window *** addition,a new conjecture relating to routing policies in SE networks is *** is proved using a constructive approach when n < *** on the conjecture,a new routing scheme for SE networks is *** this scheme,all the input signals can be transfered without conflicts and within two batches,while the efficiency of the batch routing is noticeably improved.

关键词： shuffle-exchange network sequence division routing coding transition sequence educed sequence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：