• Title/Summary/Keyword: interconnection networks

Search Result 229, Processing Time 0.022 seconds

A Simple Approximation Method for Analyzing MIN Based Switching Architecture (MIN기반 교환기 구조를 분석하기 위한 간단한 근사화 방법 연구)

  • Choe, Won-Je;Chu, Hyeon-Seung;Mun, Yeong-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1941-1948
    • /
    • 2000
  • Multistage interconnection networks (MINs) have been recognized as an efficient interconnection network for high-performance computer systems and also have been recently identified to be effective for a switching fabric of new communication structures - gigabit ethernet switch, terabit router, and ATM (asynchronous transfer mode). While lots of models analyzing the performance of MINs have been proposed, they are either inaccurate or, even if accurate, very complex for the analysis. In this paper, we propose an extremely simple mode for evaluating the multibuffered MIN with small clock cycles based on the approximation approach. Comprehensive computer simulation shows that the proposed model is very accurate in terms of the throughput and mean delay. Furthermore, it significantly reduces the computing overhead due to its simplicity.

  • PDF

Multimicrocomputer Network Design for Real-Time Parallel Processing (실시간 병렬처리를 위한 다중마이크로컴퓨터망의 설계)

  • 김진호;고광식;김항준;최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.10
    • /
    • pp.1518-1527
    • /
    • 1989
  • We proposed a technique to design a multimicrocomputer system for real-time parallel processing with an interconnection network which has good network latency time. In order to simplify the performance evaluation and the design procedure under the hard real-time constraints we defined network latency time which takes into account the queueing delays of the networks. We designed a dynamic interconnection network following the proposed technique, and the simulation results show that we can easily estimate the multimicrocomputer system's approximate performance using the defined network latency time before the actual design, so this definition can help the efficient design of the real-time parallel processing systems.

  • PDF

A Study on Implementation and Interconnection of Chaotic Neuron Circuit (카오스 뉴론회의 구현 및 상호연결에 관한 연구)

  • 이익수;여진경;이경훈;여지환;정호선
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.2
    • /
    • pp.131-139
    • /
    • 1996
  • This paper describes the chaotic neuron model to represent the complicated states of brain and analyzes the dynamical responses of chaotic neuron such as periodic, bifurcation, and chaotic phenomena which are simulated iwth numerical analysis. Next, the chaotic neuron circuit is implemented w ith the analog electronic devices. The transfer function of chaotic neuron is given by summed the linear and nonlinear property. The output function of chaojtic neuron is designed iwth the two cMOS inverters and a feedback resistor. By adjusting the external voltage, the various dynamical properties are demonstrated. In addition, we construt the chaotic neural networks which are composed of the interconnection of chaotic neuroncircuit such as serial, paralle, and layer connection. On the board experiment, we proved the dynamci and chaotic responses which exist in the human brain.

  • PDF

The Efficiency of Networks and Competitive Strategies (네트워크의 효율성과 경쟁 전략에 관한 연구)

  • 김우봉
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.3
    • /
    • pp.97-111
    • /
    • 2002
  • This paper attempts to provide an overview of relationship between the characteristics of the network and competitive strategies. We review the theoretical background of the efficiency of network, which Is very important for the network-based industries. Network externality, positive feedback effects, bandwagon effects, economies of scale, economies of scope in network-base businesses are reviewed. Various network situations, including interconnection, and strategies are also discussed. In this purpose, simple but meaningful examples and cases are used to show the economic goals and means of network competition strategies. We try to link network strategies to the generic strategies and coopetition suggested by Porter and by Brandenburger and Nalebuff respectively. Since this study is an exploratory research, further studies on more complex network situation in the real work can be executed with taking advantage of this effort.

  • PDF

The Fibonacci Edge Labelings on Fibonacci Trees (피보나치트리에서 피보나치 에지 번호매김방법)

  • Kim, Yong-Seok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.437-450
    • /
    • 2009
  • In this paper, we propose seven edge labeling methods. The methods produce three case of edge labels-sets of Fibonacci numbers {$F_k|k\;{\geq}\;2$}, {$F_{2k}|k\;{\geq}\;1$} and {$F_{3k+2}|k\;{\geq}\;0$}. When a sort of interconnection network, the circulant graph is designed, these edge labels are used for its jump sequence. As a result, the degree is due to the edge labels.

Modeling and Performance Evaluation of Multistage Interconnection Networks with USB Scheme (USB 방식을 적용한 MIN 기반 교환기 구조의 모델링 및 성능평가)

  • Hong, Yu-Jee;Choo, Hyun-Seung;Youn, Hee-Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04a
    • /
    • pp.349-352
    • /
    • 2002
  • 다단계 상호연결 네트워크 (multistage interconnection network : MIN) 동작 연구에 있어서 가장 중요한 것 중의 하나가 네트워크 사이클의 운영 방법이라 할 수 있다. 일반적인 MIN 기반 교환기 구조에서 최악의 경우는 수신 버퍼 모듈이 비어있어서 셀이 가장 앞쪽의 버퍼 위치로 움직여야만 하는 상황에서 발생한다. 그러나 실제적으로는 입력 로드의 실질적인 크기에 대해서 대부분의 버퍼 모듈들은 거의 항상 확 차게 된다. 그렇기 때문에 일반적인 체계의 긴 네트워크 사이클은 대역폭의 낭비를 가져오게 된다. 본 논문에서는 이런 문제점을 수정하여 고안한 단위 단계 버퍼링 체계를 사용하여 입력 버퍼에 관한 분석 모델을 제안하였다. 이 제안된 체계는 매개변수의 수와 상태전이 다이어그램에 있어서 기존의 모델링 기법들보다 매우 단순하다. 제안된 모델과 시뮬레이션의 처리율 및 지연시간의 비교를 통해서 제안된 모델의 정확성을 검증하였다.

  • PDF

An Empirical Study on the Construction Strategy of Web-caching Network (효과적인 웹-캐싱 네트웍 구축전략에 관한 실증 연구)

  • 이주헌;조병룡
    • The Journal of Information Technology and Database
    • /
    • v.8 no.2
    • /
    • pp.41-60
    • /
    • 2001
  • Despite the growth in Internet users, demand for multi-medial, large data files and resulting explosive growth in data traffic, there has been lack of investment in Middle-Mile, interconnection of various networks, resulting in bottleneck effect, which is acerbating. One strategy to overcome such network bottleneck is Content Delivery Network (CDN). CDN does not achieve efficient delivery of large file data through physical improvement/increase in network capacity, but by delivering large file contents, the cause of bottlenecks, from distributed servers. Since it is impracticable to physically improve networks capacity to accommodate the growth in internet traffic, CON, by strong CPs contents at cache servers deployed at major ISPs networks, is able to deliver requested contents to the requesting Web clients without the loss of data and long latency.

  • PDF

A De-Embedding Technique of a Three-Port Network with Two Ports Coupled

  • Pu, Bo;Kim, Jonghyeon;Nah, Wansoo
    • Journal of electromagnetic engineering and science
    • /
    • v.15 no.4
    • /
    • pp.258-265
    • /
    • 2015
  • A de-embedding method for multiport networks, especially for coupled odd interconnection lines, is presented in this paper. This method does not require a conversion from S-parameters to T-parameters, which is widely used in the de-embedding technique of multiport networks based on cascaded simple two-port relations, whereas here, we apply an operation to the S-matrix to generate all the uncoupled and coupled coefficients. The derivation of the method is based on the relations of incident and reflected waves between the input of the entire network and the input of the intrinsic device under test (DUT). The characteristics of the intrinsic DUT are eventually achieved and expressed as a function of the S-parameters of the whole network, which are easily obtained. The derived coefficients constitute ABCD-parameters for a convenient implementation of the method into cascaded multiport networks. A validation was performed based on a spice-like circuit simulator, and this verified the proposed method for both uncoupled and coupled cases.

The Use of Open Global Network System Interconnection in E-Trading (전자무역의 글로벌 네트워크 개방시스템 상호연결 활용에 관한 연구)

  • Jeong, Boon-Do;Yun, Bong-Ju
    • International Commerce and Information Review
    • /
    • v.16 no.1
    • /
    • pp.207-226
    • /
    • 2014
  • A trade logistic informatization system under Open Systems Interconnection(OSI) includes a Port Management Information System, a Maritime Information System, and an Export and Import Batch Processing System. These have made a great contribution in the creation of more convenient and efficient management for the logistics industries in our country. However, this management is exposed to the technological problems of networks due to the explosive use in the sending and receiving of e-documents. For our country to grow as a center for port and logistic information, we should make the best use of the control systems using networks and further advance the export and import logistic systems. Therefore, this study aims to propose management systems for a composite network and an invasion detection system for efficient management of an e-trade network under OSI. Methods to rationalize the internal organizations such as coordination of organizations and human resources according to alloted network functions, commissions and arbitrary decisions, and reorganization of relevant regulations are not discussed here. This study looked at trade network under OSI from the aspect of practical business affairs and presented a basis for further interpretation.

  • PDF

The Postorder Fibonacci Circulants-a new interconnection networks with lower diameter (후위순회 피보나치 원형군-짧은 지름을 갖는 새로운 상호연결망)

  • Kim Yong-Seok;Kwon Seung-Tag
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.91-94
    • /
    • 2004
  • In this paper, we propose a new parallel computer topology, called the postorder Fibonacci circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes and its degree is kept the same of comparable one. Its diameter is improved from n-2 to [$\frac{n}{3}$] and a its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning tree.

  • PDF