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

Design and implementation of circuit-switched network based on nanoscale quantum-dot cellular automata

PHOTONIC network COMMUNICATIONS 2019年第3期38卷 356-377页

作者： Heikalabad, Saeed Rasouli Kamrani, Hamed Islamic Azad Univ Tabriz Branch Ind Nanotechnol Res Ctr Tabriz Iran

Quantum-dot cellular automata (QCA) is a nanoscale technology to design digital circuits in nano-measure which acts based on electron's interaction. The technology of collecting, processing and distributing information is growing rapidly, but the growth in demand for advanced methods in data processing has always been greater than the speed of growth of these technologies. Hence, computer networks play an important role in providing a resource sharing and facilitating user communications. The circuit-switched network is one of the main components for sending input signals between different users within the network. In this paper, a minimal and optimal design of the circuit-switched network is presented at a single level in QCA. The proposed design is studied and compared with existing designs in terms of fault tolerant under stuck-at 0 and 1. There is also a physical analysis for the proposed circuit-switched network.

关键词： Nanotechnology circuit-switched network Quantum-dot cellular automata Fault tolerant Kink energy

来源：评论

学校读者我要写书评

暂无评论

A novel QCA circuit-switched network with power dissipation analysis for nano communication applications

引用

NANO COMMUNICATION networkS 2023年 35卷

作者： Vahabi, Mohsen Rahimi, Ehsan Lyakhov, Pavel Otsuki, Akira Shahrood Univ Technol Fac Elect Engn Semnan Iran North Caucasus Ctr Math Res Dept Modular Comp & Artificial Intelligence Stavropol 355017 Russia North Caucasus Fed Univ Dept Math Modeling Stavropol 355017 Russia Univ Adolfo Ibanez Fac Ingn & Ciencias Diagonal Las Torres 2640 Santiago 7941169 Chile RIKEN RIKEN Ctr Adv Photon Wako Saitama 3510198 Japan

Today, communication links and networks are essential in transmitting data and information. Moreover, information sharing in communication devices and networks has become necessary, routine, and unavoidable. Consequently, designing and manufacturing high-speed nano-scale devices with ultra-low power consumption is very important. Among the emerging paradigms in nanotechnologies, quantum-dot cellular automata (QCA) is very popular in communication sciences. In the present study, we optimize the design and implementation of a QCA crossbar switch and use it in transmitter and receiver circuits. Subsequently, a circuit-switched network in QCA technology is implemented using these devices. All the designed circuits are coplanar with the minimum number of cells, optimal area and latency, and low power consumptions, which employ standard QCA design rules and show superiority and advantages compared to the previous designs.

关键词： Quantum-dot cellular automata Coplanar circuits 2:1 MUX 1:2D MUX Crossbars witch Transmitter Receiver circuit-switched network

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of circuit-switched Interconnection network for a Multi-FPGA System

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2021年第12期E104D卷 2029-2039页

作者： Ito, Kohei Iizuka, Kensuke Hironaka, Kazuei Hu, Yao Koibuchi, Michihiro Amano, Hideharu Keio Univ Yokohama Kanagawa 2238522 Japan Natl Inst Informat Tokyo 1018430 Japan

Multi-FPGA systems have gained attention because of their high performance and power efficiency. A multi-FPGA system called Flow-in-Cloud (FiC) is currently being developed as an accelerator of multi-access edge computing (MEC). FiC consists of multiple mid-range FPGAs tightly connected by high-speed serial links. Since time-critical jobs are assumed in MEC, a circuit-switched network with static timedivision multiplexing (STDM) switches has been implemented on FiC. This paper investigates techniques of enhancing the interconnection performance of FiC. Unlike switching fabrics for network on Chips or parallel machines, economical multi-FPGA systems, such as FiC, use Xilinx Aurora IP and FireFly cables with multiple lanes. We adopted the link aggregation and the slot distribution for using multiple lanes. To mitigate the bottleneck between an STDM switch and user logic, we also propose a multi-ejection STDM switch. We evaluated various combinations of our techniques by using three practical applications on an FiC prototype with 24 boards. When the number of slots is large and transferred data size is small, the slot distribution was sometimes more effective, while the link aggregation was superior for other most cases. Our multi-ejection STDM switch mitigated the bottleneck in ejection ports and successfully reduced the number of time slots. As a result, by combining the link aggregation and multi-ejection STDM switch, communication performance improved up to 7.50 times with few additional resources. Although the performance of the fast Fourier transform with the highest communication ratio could not be enhanced by using multiple boards when a lane was used, 1.99 times performance improvement was achieved by using 8 boards with four lanes and our multi-ejection switch compared with a board.

关键词： multi-FPGA multi-FPGA communication circuit-switched network STDM switch

来源：评论

学校读者我要写书评

暂无评论

PRODUCT-FORM AND INSENSITIVITY IN circuit-switched networkS WITH FAILING LINKS

引用

PERFORMANCE EVALUATION 1989年第3期9卷 209-215页

作者： CONWAY, AE GTE LABS INC WALTHAMMA 02254

In this paper, we propose a model for circuit-switched networks in which we may have random routed calls, calls of differing bandwidths and links which may fail in different modes. We show that the model has a product-form equilibrium state distribution. Of more significance, we prove that this distribution is insensitive to the forms of the call holding-time, failure-time and repair-time densities, thus extending results of Burman, Lehoczky and Lim.

关键词： circuit-switched network Failing Links Insensitivity Partial Balance Product-Form

来源：评论

学校读者我要写书评

暂无评论

GENERALIZATION OF PRATTS FORMULA FOR DIMENSIONING circuit-switched networkS

COMPUTER NETWORKS AND ISDN SYSTEMS

引用

COMPUTER networkS AND ISDN SYSTEMS 1990年第1-5期20卷 115-126页

作者： SHINOHARA, M NTT Communication Switching Laboratories Tokyo Japan

The mathematical programming foundation of Pratt's formula for dimensioning circuit-switched networks is presented. The optimality conditions for dimensioning networks are systematically derived and Pratt's formula is generalized in many ways. Two iterative-type networks dimensioning algorithms based on the optimality conditions are presented and their effectiveness is shown by numerical examples.

关键词： network DESIGN network DIMENSIONING circuit-switched network FIXED-ROUTING PRATT FORMULA OPTIMALITY CONDITION NONLINEAR PROGRAMMING BOTH-WAY LINK NONLINEAR LINK COST STEEPEST DESCENT METHOD

来源：评论

学校读者我要写书评

暂无评论

ONE-DIMENSIONAL circuit-switched networkS

引用

ANNALS OF PROBABILITY 1987年第3期15卷 1166-1179页

作者： KELLY, FP

This paper is concerned with the stationary distribution of a one-dimensional circuit-switched network. We show that if arrival rates decay geometrically with distance, then under the stationary distribution the number of circuits busy on successive links of the network at a fixed point in time is a Markov chain. When each link of the network has unit capacity we show that translation invariant arrival rates lead to a stationary distribution which can be described in terms of an alternating renewal process.

关键词： 60K35 60K30 90B15 circuit-switched network loss probability

来源：评论

学校读者我要写书评

暂无评论

MiniCAR: Minimal Congestion-aware Routing Method in Fine-grained circuit-switched networks for Parallel Computing Systems 26

MiniCAR: Minimal Congestion-aware Routing Method in Fine-gra...

引用

26th IEEE Symposium on Computers and Communications (IEEE ISCC)

作者： Hu, Yao Natl Inst Informat Informat Syst Architecture Sci Res Div Tokyo Japan

ISBN: (纸本)9781665427449

In parallel high-performance computing (HPC) systems, network congestion is one of the main factors to degrade communication performance, because it may lead to increased end-to-end latency and power consumption. In this work, we address this issue by the means of a simple routing algorithm on a target fine-grained circuit-switched (FGCS) network. The number of allocated slots for each FGCS switch in the network is a direct factor to affect the end-to-end latency. Our proposed approach employs a minimal congestion-aware routing (MiniCAR) method to perform better routing decisions and alleviate the network congestion so that the minimum necessary number of slots can be reduced in a target FGCS network. Evaluation results show that, compared to the traditional dimension order routing algorithm, MiniCAR occupies a smaller number of time slots by up to 50.8% on a 2-D torus interconnection network.

关键词： Parallel computing circuit-switched network congestion-aware routing

来源：评论

学校读者我要写书评

暂无评论

THE USE OF PACKET-switched VS circuit-switched networkS FOR DATA TRANSPORT IN A PUBLIC TRANSIT ENVIRONMENT

THE USE OF PACKET-SWITCHED VS CIRCUIT-SWITCHED NETWORKS FOR ...

引用

ASME 2012 Joint Rail Conference

作者： Fitzmaurice, Michael Parsons New York NY 10011 USA

ISBN: (纸本)9780791844656

Ethernet has become the de-facto standard for providing data transport not just throughout the internet but for numerous private and industrial networks. Prior to Ethernet's dominance, circuit-switched networks (or time-division multiplexed networks like SONET) were popular choices for applications that required flexible and reliable data transport. Over the past 10 years, packet-switched networks in general (and Ethernet in particular) have usurped the role formerly played by these circuit-switched networks but is this a good development given that not all applications that require data transport are created equal? In the public transit environment, data transport networks are often used for mission critical applications that directly support revenue service such as signaling and train control and are increasingly based upon packet-switched networks. This paper will explore the current trend of using packet-switched as opposed to circuit-switched networks in the context of providing data transport for rail-based public transit agencies and, after examining five case studies, draw conclusions that are relevant for public transit agencies.

关键词： Ethernet SONET circuit-switched network packet-switched network data transport

来源：评论

学校读者我要写书评

暂无评论

Multicolor routing in the undirected hypercube

引用

DISCRETE APPLIED MATHEMATICS 2000年第3期100卷 169-181页

作者： Gu, QP Tamaki, H Univ Aizu Fdn Comp Sci Lab Fukushima 9658580 Japan Meiji Univ Dept Comp Sci Tama Ku Kawasaki Kanagawa 214 Japan

An undirected routing problem is a pair (G,R) where G is an undirected graph and R is an undirected multigraph such that V(G) = V(R). A solution to an undirected routing problem (G,R) is a collection P of undirected paths of G (possibly containing multiple occurrences of the same path) such that edges of R are in one-to-one correspondence with the paths of P, with the path corresponding to edge {u, v} connecting u and v. We say that a collection of paths P is k-colorable if each path of P can be colored by one of the k colors so that the paths of the same color are edge-disjoint teach edge of G appears at most once in the paths of each single color). In the circuit-switched routing context, and in optical network applications in particular, it is desirable to find a solution to a routing problem that is colorable with as few colors as possible. Let en denote the n-dimensional hypercube, fbr arbitrary n greater than or equal to 1. We show that a routing problem (Q(n),R) always admits a 4d-colorable solution where d is the maximum vertex degree of R. This improves over the 16inverted right perpendiculard/2inverted left perpendicular-color result which is implicit in the previous work of Aumann and Rabani [SODA95, pp. 567-576]. Since, for any positive d, there is a multigraph R of degree d such that any solution to (Q(n)R) requires at least d colors, our result is tight up to a factor of four. In fact, when d = 1, it is tight up to a factor of two, since there is a graph of degree one (the antipodal matching) that requires two colors. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： multicolor routing edge-disjoint paths algorithm circuit-switched network

来源：评论

学校读者我要写书评

暂无评论

REALIZATION OF AN ARBITRARY PERMUTATION ON A HYPERCUBE

引用

INFORMATION PROCESSING LETTERS 1994年第5期51卷 237-243页

作者： SHEN, XJ HU, Q LIANG, WF Computer Science Telecommunications Program University of Missouri - Kansas City 5100 Rockhill Road Kansas City MO 64110 USA

We present an explicit combinatorial algorithm for constructing a 2-realization for any given permutation on a circuit-switched d-dimensional hypercube (d-cube) such that the total number of directed edges used in the realization (counting every repetition) is bounded by d2(d), the total number of directed edges in the d-cube. As a corollary, this result implies a (2d - 3) step realization on a packet-switched d-cube (d greater than or equal to 3).

关键词： circuit-switched network HYPERCUBE INTERCONNECTION network PERMUTATION CAPABILITY ALGORITHMS COMPUTER ARCHITECTURE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：