• Title/Summary/Keyword: Fast ethernet

Search Result 65, Processing Time 0.026 seconds

VIA-Based PC Cluster System for Efficient Information Retrieval (효율적인 정보 검색을 위한 VIA 기반 PC 클러스터 시스템)

  • Kang, Na-Young;Chung, Sang-Hwa;Jang, Han-Kook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.10
    • /
    • pp.539-549
    • /
    • 2002
  • PC cluster-based Information Retrieval (IR) systems improve their performances by parallel processing of query terms using cluster nodes. However TCP/IP based communication used to exchange data between cluster nodes prevents the performance from being improved further. The user-level communication mechanisms solve the problem by eliminating the time-consuming kernel access in exchanging data between cluster nodes. The Virtual Interface Architecture (VIA) is one of the representative user-level communication mechanisms which provide low latency and high bandwidth. In this paper, we propose a VIA-based parallel IR system on a PC cluster. The IR system is implemented using the following three communication methods: Sealable Coherent Interface (SCI) based VIA, MPI on SCI based VIA, MPI on Fast Ethernet based VIA. Through experiments, the performances of the three methods are analyzed in various aspects.

Parallel Nonlinear Analysis of Prestressed Concrete Frame on Cluster System (클러스터 시스템에서 프리스트레스트 콘크리트 프레임의 병렬 비선형해석)

  • 이재석;최규천
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.3
    • /
    • pp.287-298
    • /
    • 2001
  • Analysis of nonlinear behavior of prestressed concrete frame structures on PC is a time-consuming computing job if the problem size increase to a certain degree. Cluster system has emerged as one of promising computing environments due to its good extendibility, portability, and cost-effectiveness, comparing it with high-end work-stations or servers. In this paper, a parallel nonlinear analysis procedure of prestressed concrete frame structure is presented using cluster computing. Cluster system is configured with readily available pentium III class PCs under Win98 or Linux and fast ethernet. Parallel computing algorithms on element-wise processing parts including the calculation of stiffness matrix, element stresses and determination of material states, check of material failure and calculation of unbalanced loads are developed using MPL. Validity of the method is discussed through typical numerical examples. For the case of 4 node system, maximum speedup is 3.15 and 3.74 for Win98 and Linux, respectively. Important issues for the efficient use of cluster computing system based un PCs and ethernet are addressed.

  • PDF

Performance Evaluation of Service-Aware Optical Transport System

  • Youn, Ji-Wook;Yu, Jea-Hoon;Yoo, Tae-Whan
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.241-247
    • /
    • 2010
  • We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

Performance Evaluations of the Computer Networks for the Voice/Data Coexisted Network Design (음성/데이터 통합망 설계를 위한 이행 단계별 성능평가)

  • Eom, Ki-Bok;Yoe, Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.678-683
    • /
    • 2003
  • This study presents a result of performance with the design of network topology for voice and data integration under computer network. This network is consisted of FastEthernet, other LANs and ATM WAN(wide area network), and performance evaluation of delay in a PBX+IP network, delay in a VoIP network and delay in a IP+ATM network will be shown. We use parameters including network bandwidth, number of packet, routing protocol(IGRP, OSPF). We simulate integrated of voice and data used PBX. we will study further about the case of integrated of voice and data environments using PBX. and, evaluate IP+ATM WAN average measured network delay and average delay of VoIP network.

Parallel Distributed Implementation of GHT on MPI-based PC Cluster (MPI 기반 PC 클러스터에서 GHT의 병렬 분산 구현)

  • Kim, Yeong-Soo;Kim, Jeong-Sahm;Choi, Heung-Moon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.81-89
    • /
    • 2007
  • This paper presents a parallel distributed implementation of the GHT (generalized Hough transform) for the fast processing on the MPI-based PC cluster. We tried to achieve the higher speedup mainly by alleviating the communication overhead through the pipelined broadcast and accumulator array partition strategy and by time overlapping of the communication and the computation over entire process. Experimental results show that nearly linear speedup is reachable by the proposed method on the MPI-based PC clusters connected through 100Mbps Ethernet switch.

The PC Clustering of the SIMD Structure for a Distributed Process of On-line Contingency (온라인 선로상정사고 분산처리를 위한 SIMD 구조의 PC 클러스터링)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1150-1156
    • /
    • 2008
  • This paper introduces the PC clustering of the SIMD structure for a distributed processing of on-line contingency to assess a static security of a power system. To execute on-line contingency analysis of a large-scale power system, we need to use high-speed execution device. Therefore, we constructed PC-cluster system using PC clustering method of the SIMD structure and applied to a power system, which relatively shows high quality on the high-speed execution and has a low price. SIMD(single instruction stream, multiple data stream) is a structure that processes are controlled by one signal. The PC cluster system is consisting of 8 PCs. Each PC employs the 2 GHz Pentium 4 CPU and is connected with the others through ethernet switch based fast ethernet. Also, we consider N-1 line contingency that have high potentiality of occurrence realistically. We propose the distributed process algorithm of the SIMD structure for reducing too much execution time on the on-line N-1 line contingency analysis in the large-scale power system. And we have verified a usefulness of the proposed algorithm and the constructed PC cluster system through IEEE 39 and 118 bus system.

SHD Digital Cinema Distribution over a Fast Long-Distance Network

  • Takahiro Yamaguchi;Daisuke Shirai;Mitsuru Nomura;Kazuhiro Shirakawa;Tatsuya Fujii;Tetsuro Fujii;Kim, io-Oguchi
    • Journal of Broadcast Engineering
    • /
    • v.9 no.2
    • /
    • pp.119-130
    • /
    • 2004
  • We have developed a prototype super-high-definition (SHD) digital cinema distribution system that can store, transmit, and display eight-million-pixel motion pictures that have the image quality of a 35-mm film movie. The system contains a movie server, a real-time decoder, and an SHB projector. Using a Gigabit Ethernet link and TCP/IP, the server transmits JPEG2000 compressed motion picture data streams to the decoder at transmission speeds as high as 300 Mbps. The received data streams are decompressed by the decoder, and then projected onto a screen via the projector. By using an enlarged TCP window, multiple TCP streams, and a shaping function to control the data transmission quantity, we achieved real-time streaming of SHD movie data at about 300 Mbps between Chicago and Los Angeles, a distance of more than 3000 km. We also improved the decoder performance to show movies with Image qualities of 450 Mbps or higher. Since UDP is more suitable than TCP for fast long-distance streaming, we have developed an SHD digital cinema UDP relay system, in which UDP is used for transmission over a fast long-distance network. By using four pairs of server-side-proxy and decoder-side-proxy, 450-Mbps movie data streams could be transmitted.

Fast Channel Changing Technique to Deliver Enhanced IPTV User Experience (IPTV 사용자를 위한 빠른 채널 변경 기법)

  • Song, Young-Ho;Kwon, Taeck-Geun
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1201-1209
    • /
    • 2009
  • Recently, the convergence of the telecommunications industry through the development of network media has brought along interactive data services in addition to the traditional broadcast services by providing direct connections between the users and the broadcasters. This can be easily achieved by the combination of existing network technology and multimedia technology, but in reality, as seen in the actual implementation of IPVT, it's difficult to provide satisfactory levels of service to users due to issues of network bandwidth and problems of streaming system. In particular, a network which is able to fully support Qos/QoE, and also a fast enough channel changing technology that is satisfactory to the user, are prerequisites for IPTV success. Therefore this thesis proposes a fast channel changing technique to delivery enhanced IPTV user experience. Recent IP set-top-boxes use only a small portion of the CPU to feed Ethernet packets to the hardware decoder and play them. Thus, by making IP set-top-boxes share cached channel information and content with each other, reducing the load on the server and enhancing the channel changing time is made possible.

  • PDF

Computation of Compressor Flows Using Parallel Implementation of Preconditioning Method (예조건화 기법의 병렬화를 이용한 압축기 유동해석)

  • Lee Gee-Soo;Choi Jeong-Yeol;Kim Kui-Soon
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.155-162
    • /
    • 2000
  • In this paper, preconditioning method is parallelized on fast-ethernet PC cluster. The algorithm is based on scaling the pressure terms in the momemtum equations and preconditioning the conservation equations to circumvent numerical difficulties at low Mach numbers. Parallelization is performed using a domain decomposition technique(DDT) and message passing between sub-domains are taken from the MPI library. The results are shown to have good convergence properties at all Mach number on the circular arc Bump and are capable of reasonable predicting two-dimensional turbulent flows on DCA compressor cascade.

  • PDF

Simulation Analysis of the BACnet-based Fire Detection/Monitoring System (BACnet 기반 화재감지/모니터링 시스템의 시뮬레이션 분석)

  • Song, Mu-Seok;Hong, Seung-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.319-322
    • /
    • 2001
  • 본 논문에서는 고층빌딩의 화재감지/모니터링 시스템에 대한 기준 모델을 제시하고 제시된 모델의 성능을 시뮬레이션을 통하여 검증하였다. 본 논문에서 제시하는 화재감지/모니터링 시스템 모델은 CSMA/CD 방식으로 동작하며 100 Mbps의 전송속도로 동작하는 Fast Ethernet을 백본망으로 사용하고 하부망으로는 MS/TP를 사용한다. 또한 시스템의 확장성과 유연성을 확보하기 위하여 현재 국내 빌딩 자동화 통신망의 표준 프로토콜로 제정된 BACnet을 기반으로 동작한다. 본 논문에서는 제시된 화재감지/모니터링 시스템 모델의 성능을 분석하기 위하여 이산사건 시스템 모델링 전용 툴인 ARENA를 사용한 시뮬레이션 모델을 개발하였다. 개발된 시뮬레이션 모델을 이용하여 네트워크 지연시간이 화재감지/모니터링 시스템의 성능에 미치는 영향을 분석하였으며, 분석된 결과를 바탕으로 본 논문에서 제시한 화재감지/모니터링 시스템 모델이 고층빌딩의 방화 설비 요구사항을 만족시킬 수 있음을 검증하였다.

  • PDF