• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.67-75
• /
• 1997

This paper presents a virtual-parallel multistage interconnection network (MIN) which provides multipath between processor and memory module. The proposed virtual-parallel MIN network which uses $m{\times}1$ mutiplexer at the input switching block, $1{\times}m$ demultiplexer at the output switching block and logN-1 switching stages has maximum $2{\times}m$ unique paths between processor and memory module. Because it has multi-redundance paths, a number of processors can connect a specific Also, this new virtual-parallel structured MIN network can reduce packet collision possibility at switching block and it has cost. It shown to improve a performance and to be a very simple structure in comparision with MBSF structured MIN.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.130-137
• /
• 1990

The multipath multistage interconnection network is proposed which has the capability of dynamic rerouting. Construction of the network gets simpler, and the number of stages is reduced to $LOG_{2}$(N), so hardware complexity is reduced. This proposed algorithm makes it possible that destination adresses are used as routing tags, and it is easy to set up the path. Because this proposed network has a dynamic rerouting, backtracking is not necessary to set up another path when conflicts of switch faults are occurred. To estimate a performance, analytic methods are used and it is proved that probability of acceptance is improved in this Multipath MIN.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.84-92
• /
• 2006

In this paper, we propose an efficient multicasting algorithm in multistage interconnection networks (MIN's) employing the region encoding scheme. The proposed algorithm uses the recursive scheme to recycle a multicast message at most two times through MIN, in order to send it to its desired destinations. It is composed of two recycling phases which are the copying phase and the routing phase of the multicast message. In the first phase, a source sends the message to a region that contains the largest number of destination regions, and destinations in these regions receive and store the message in this phase. The remaining destinations can finally receive the message in the second phase. This method of the algorithm can improve its performance by reducing the delay of message and the volume of traffic. Moreover, we evaluate the performance of our algorithm in terms of the average number of recycling and the number of internal links used per destination, comparing with the previously proposed algorithm.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.63-76
• /
• 1998

Reliability evaluation methodologies of the multipath MIN system are reviewed and critically compared. Some guidelines are proposed to select efficient evaluation method for the system designers to use. Considering the switch failure and repair characteristics of the MIN system, three types of Markov models are proposed for the MIN system availability models. These models can be used for the MIN performance analysis. The performance of the MIN system are supposed to vary according to the failure state of the system.

• 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.

• 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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.972-982
• /
• 1988

In multiprocessor systems, there are Omega network and M network among various MIN's which interconnect the processor and memory modules. Both one-path Omega network and two-path M network are composed of Log2N stages. In this paper, Augmented M network (AMN) with 2**k+1 paths and Augmented Omega network (AON) with 2**k paths are proposed. The proposed networks can be acomplished by adding K stage(s) to M network and Omega network. Using destination tag, routing algorithm for AMN and AON becomes simple and multiple faults are tolerant. By evaluating RST(request service time) performance of AMN and AON with (Log2N)+K stages, we demonstrated the fact that MMIN (AMN) with 2**k+1 paths performs better than MMIN(AON) with 2**k+1. paths.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.71-82
• /
• 2002

One of the most important things in the research for MIN-based switch operation the management scheme of network cycle. In the traditional MIN, when the receving buffer module is empty, the sell has to move forward the front-most buffer position by the characteristic of the conventional FIFO queue. However, most of buffer modules are almost always full for practical amount of input loads. The long network cycle of the traditional scheme is thus a substantial waste of bandwidth. In this paper, we propose the modeling method for the input and multi-buffered MIN with unit step buffering scheme, In spite of simplicity, simulation results show that the proposed model is very accurate comparing to previous modeling approaches in terms of throughput and the trend of delay.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.147-161
• /
• 1997

In the future, the performance of B-lSDN offering the multimedia and a various service depends on the performance of switch that is the important factor consisting of network. Bufferless banyan network consisted of MIN(multistage interconnection network) selected for- the fabric of ATM switch and has a limitation of performance because of blocking. Input buffered banyan networks with FIFO(first-in first-out) buffering scheme for the reduction of blocking and the cell bypass queueing theory for the reduction of HOL(head of line) blocking were seperately compared of the performance of switch. Specially input buffered banyan networks were applied monotonic buffering scheme that was proposed. As a result of simulation, Buffered Banyan Network with cell bypass queueing theory showed better performance than FIFO type input buffered Banyan network. Monotonic increase buffering scheme showed better performance than Monotonic decrease buffering scheme.

• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.25-31
• /
• 2003

Multistage Interconnection networks (MIN) for the high performance computing and communications must be efficient and reliable. While a number of fault tolerance schemes have been developed, some of them are not efficient enough with respect to all evaluation measures or overheads of others are too significant. In this paper we develop a new efficient fault tolerant MIN which displays high reliability and fault tolerance capability using a simple structure. Structure and reliabilities of Enhanced Cube Network are evaluated and compared with previous designs to show the effectiveness of new design.