• Title/Summary/Keyword: Interconnection Networks

Search Result 228, Processing Time 0.027 seconds

A Study on Efficient Fault-Diagnosis for Multistage Interconnection Networks (다단 상호 연결 네트워크를 위한 효율적인 고장 진단에 관한 연구)

  • Bae, Sung-Hwan;Kim, Dae-Ik;Lee, Sang-Tae;Chon, Byoung-SIl
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.5
    • /
    • pp.73-81
    • /
    • 1996
  • In multiprocessor systems with multiple processors and memories, efficient communication between processors and memories is critical for high performance. Various types of multistage networks have been proposed. The economic feasibility and the improvements in both computing throughput and fault tolerance/diagnosis have been some of the most important factors in the development of these computer systems. In this paper, we present an efficient algorithm for the diagnosis of generalized cube interconnection networks with a fan-in/fan-out of 2. Also, using the assumed fault model present total fault diagnosis by generating suitable fault-detection and fault-location test sets for link stuck fault, switching element fault in direct/cross states, including broadcast diagnosis methods based on some basic properties or generalized cube interconnection networks. Finally, we illustrate some example.

  • PDF

Bridging Solutions for a Heterogeneous WiMAX-WiFi Scenario

  • Fantacci, Romano;Tarchi, Daniele
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.369-377
    • /
    • 2006
  • Recently, the metropolitan area network (MAN) has attracted much attention in telecommunication research and has emerged as one of the most important research topics in the community. Several standards representing the first step for developing metropolitan networks have been published; IEEE 802.16 (WiMAX) has taken a relevant role in reaching the goal of realizing a full-service network all over a urban and suburban area. At the same time, the wireless local area networks (WLAN) have been widely used for in-home or short range communications, mainly basing on the IEEE 802.11 (WiFi) standard. A consequence is the increasing interest in interworking technology, that allows an interconnection between different standards by maintaining certain properties, mainly in terms of quality of service (QoS). One of the major issues is to design bridging devices capable of transparently interconnect different wireless technologies. In this paper, we propose two interconnection bridging solutions between WiMAX and WiFi links; the first is more based on the concept of maintaining a certain end-to-end QoS level independently from the wireless technologies used. The second method is more devoted to the reduction of the implementation complexity at the cost of no QoS assurance. The performance of the two methods are compared by resorting to computer simulations showing the advantages of each one technique.

On the Minimization of Crosstalk Conflicts in a Destination Based Modified Omega Network

  • Bhardwaj, Ved Prakash;Nitin, Nitin
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.301-314
    • /
    • 2013
  • In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

A Fault-Tolerant Multicasting Algorithm using Region Encoding Scheme in Multistage Interconnection Networks (다단계 상호연결망에서 영역 부호화 방식을 사용하는 고장 허용 멀티캐스팅 알고리즘)

  • Kim, Jin-Soo;Chang, Jung-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.3
    • /
    • pp.117-124
    • /
    • 2002
  • This paper proposes a fault-tolerant multicasting algorithm employing the region encoding scheme in multistage interconnection networks (MIN's) containing multiple faulty switching elements. After classifying all switching elements into two subsets with equal sizes in MIN, the proposed algorithm can tolerate the faulty pattern where every fault is contained in the same subset. In order to send a multicast message to its destinations detouring faults, the proposed algorithm uses the recursive scheme that recirculates it through MIN, We prove that this algorithm can route any multicast message in only two passes through the faulty MIN.

Performance Analysis of the XMESH Topology for the Massively Parallel Computer Architecture (대규모 병렬컴퓨터를 위한 교차메쉬구조 및 그의 성능해석)

  • 김종진;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.5
    • /
    • pp.720-729
    • /
    • 1995
  • We proposed a XMESH(crossed-mesh) topology as a suitable interconnection for the massively parallel computer architectures, and presented performance analysis of the proposed interconnection topology. Horizontally, the XMESH has the same links as those of the toroidal mesh(TMESH) or toroid, but vertically, it has diagonal cross links instead of the vertical links. It reveals desirable interconnection characteristics for the massively parallel computers as the number of nodes increases, while retaining the same structural advantages of the TMESH such as the symmetric structure, periodic placement of subsystems, and constant degree, which are highly recommended features for VLSI/WSI implementations. Furthermore, n*k XMESH can be easily expanded without increasing the diameter as long as n.leq.k.leq.n+4. Analytical performance evaluations show that the XMESH has a shorter diameter, a shorter mean internode distance, and a higher message completion rate than the TMESH or the diagonal mesh(DMESH). To confirm these results, an optimal self-routing algorithm for the proposed topology is developed and is used to simulate the average delay, the maximum delay, and the throughput in the presence of contention. In all cases, the XMESH is shown to outperform the TMESH and the DMESH regardless of the communication load conditions or the number of nodes of the networks, and can provide an attractive alternative to those networks in implementing massively parallel computers.

  • PDF

Implimentation of Parallel Procssor System with Reliability (신뢰성을 고려한 병열프로세서에서 구성)

  • 고명삼;정택원
    • 전기의세계
    • /
    • v.31 no.5
    • /
    • pp.355-360
    • /
    • 1982
  • In numerical computation, it is desirable to access any row or column, the main diagonal, subarrays, of a matrix without any conflict for successful parallel processing. To meet this requirement special storage scheme is used for conflict-free access of necessary data. Interconnection network, which connects processing elements and processing element memory modules, is required to execute the necessary operations. In this paper we discuss the skewing method for conflict-free, access to various bit slices and single-stage interconnection networks.

  • PDF

Adaptive Fault-tolerant Multistage Interconnection Network (적응적 결함-허용 다단계 상호연결망)

  • 김금호;김영만;배은호;윤성대
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.199-202
    • /
    • 2001
  • In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.

  • PDF

A Study on the STATCOM Application for Efficient Operations of Wind Farm (풍력발전단지의 효율적인 운전을 위한 STATCOM 적용 가능성 연구)

  • 장성일;최정환;박인기;황혜미;최돈만;김광호;유능수
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.5
    • /
    • pp.250-256
    • /
    • 2003
  • In this papur, the STATCOM (STATic synchronous COMpensator) application for efficient operations of wind farm is described. The wind farm connected with the electric power network is one of good alternative energy sources. However, it would be also highly possible that interconnection of wind farm causes unwanted influences on distribution system operation, protection and control. This paper proposes the STATCOM application for reducing the negative effects from interconnection of wind farm with distribution networks. The simulation results show that STATCOM would be on effective and useful device to resolve the bad influences from wind farm on distribution networks and improve the operational efficiency of wind farm. In the simulation, the radial distribution network of IEEE 13 bus was modeled using PSCAD/EMTDC.

Using Minimal Path Sets for the Evaluation of the Reliability of DRDT Interconnection $Networks^+$

  • Lim , Hae-Hak;Lee, Chong-Hyung;Cho, Byung-Yup
    • Journal of Korean Society for Quality Management
    • /
    • v.28 no.1
    • /
    • pp.105-118
    • /
    • 2000
  • In this paper, we consider an interconnection network, DRDT (Dual Receive Dual Transmit), that is a double-loop ring topology and adopts the concept of multiple packets transmission. For three types of DRDT configurations, we investigate some properties related to path sets and discuss the method for finding minimal path sets. Using the concept of the terminal reliability and the path sets approach, we evaluate the reliability of the DRDT networks and compare them with a single ring network and a unidirectional double-loop ring network.

  • PDF

Performance Modeling of Multibuffered Multistage Interconnection Networks under Nonuniform Traffic Pattern with Small Clock Cycle Schemes (복수버퍼를 가진 다단상호연결네트웍의 비균일 트래픽 환경하에서 소클럭주기를 사용한 성능 평가)

  • Mun Youngsong
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.61-68
    • /
    • 2004
  • In this paper, a more accurate model than any other ones so far have been proposed for the performance evaluation of muntibuffered banyan-type Multistage Interconnection Networks(MINs)'s under nonuniform traffic condition is obtained. Small clock cycle instead of big clock cycle is used to improve the performance. The accuracy of the proposed model is conformed by comparing with the results from simulation.

  • PDF