• Title/Summary/Keyword: High scalability

Search Result 434, Processing Time 0.023 seconds

A Design and Implementation of a P2P Streaming System with Considering Network Efficiency (망 효율성을 고려한 P2P 스트리밍 시스템 설계 및 구현)

  • Hong, Seung-Gil;Park, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.567-574
    • /
    • 2013
  • Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

Scalable CC-NUMA System using Repeater Node (리피터 노드를 이용한 Scalable CC-NUMA 시스템)

  • Kyoung, Jin-Mi;Jhang, Seong-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.9
    • /
    • pp.503-513
    • /
    • 2002
  • Since CC-NUMA architecture has to access remote memory, the interconnection network determines the performance of the CC-NUMA system. Bus which has been used as a popular interconnection network has many limits in a large-scale system because of the limited physical scalability and bandwidth. The dual ring interconnection network, composed of high-speed point-to-point links, is made to resolve the defects of the bus for the large-scale system. However, it also has a problem, in that the response latency is rapidly increased when many nodes are attached to the snooping based CC-NUMA system with the dual ring. In this paper, we propose a ring architecture with repeater nodes in order to overcome the problem of the dual ring on a snooping based CC-NUMA system, and design a repeater node adapted to this architecture. We will also analyze the effects of proposed architecture on the system performance and the response latency by using a probability-driven simulator.

The Design of Hardware MPI Units for MPSoC (MPSoC를 위한 저비용 하드웨어 MPI 유닛 설계)

  • Jeong, Ha-Young;Chung, Won-Young;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.86-92
    • /
    • 2011
  • In this paper, we propose a novel hardware MPI(Message Passing Interface) unit which supports message passing in multiprocessor system which use distributed memory architecture. MPI Hardware unit processes data synchronization, transmission and completion, and it supports processor non-blocking operation so it reduces overhead according to synchronization. Additionally, MPI hardware unit combines ready entry, request entry, reserve entry which save and manage the synchronized messages and performs the multiple outstanding issue and out of order completion. According to BFM(Bus Functional Model) simulation result, the performance is increased by 25% on many to many communication. After we designed MPI unit using HDL, with synopsys design compiler we synthesized, and for synthesis library we used MagnaChip $0.18{\mu}m$. And then we making prototype chip. The proposed message transmission interface hardware shows high performance for its increase in size. Thus, as we consider low-cost design and scalability, MPI hardware unit is useful in increasing overall performance of embedded MPSoC(Multi-Processor System-on-Chip).

Parallelizing Feature Point Extraction in the Multi-Core Environment for Reducing Panorama Image Generation Time (파노라마 이미지 생성시간을 단축하기 위한 멀티코어 환경에서 특징점 추출 병렬화)

  • Kim, Geon-Ho;Choi, Tai-Ho;Chung, Hee-Jin;Kwon, Bom-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.331-335
    • /
    • 2008
  • In this paper, we parallelized a feature point extraction algorithm to reduce panorama image generation time in multi-core environment. While we compose a panorama image with several images, the step to extract feature points of each picture is needed to find overlapped region of pictures. To perform rapidly feature extraction stage which requires much calculation, we developed a parallel algorithm to extract feature points and examined the performance using CBE(Cell Broadband Engine) which is asymmetric multi-core architecture. As a result of the exam, the algorithm we proposed has a property of linear scalability-the performance is increased in proportion the number of processors utilized. In this paper, we will suggest how Image processing operation can make high performance result in multi-core environment.

Development of Thermal Image Processing Module Using Common Image Processor (상용 이미지 처리 프로세서를 이용한 열화상 이미지 처리 모듈 개발)

  • Han, Joon Hwan;Cha, Jeong Woo;Kim, Bo Mee;Lim, Jae Sung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.1
    • /
    • pp.1-8
    • /
    • 2020
  • The thermal image device support image to detect infrared light from the object without light. It can use not only defence-related industry, but also civilian industry. This paper presents a new thermal image processing module using common image processor. The proposed module shows 10~20% performance improvement with normal mode and 50% performance improvement with sleep mode compared with the previously thermal image module based FPGA. and it guarantees high scalability according to modular system. In addition, the proposed module improves modulation and reuse, so it expect to have reduction of development period, low development cost. various application. In addition, it expect to have satisfaction of customer requirements, development design, development period, release date of product.

A Distributed Trust Model Based on Reputation Management of Peers for P2P VoD Services

  • Huang, Guimin;Hu, Min;Zhou, Ya;Liu, Pingshan;Zhang, Yanchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2285-2301
    • /
    • 2012
  • Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

Design of QoS-based Routing Algorithm for Internet Services on Large Scale ATM Networks (광역 ATM 망 적용을 위한 QoS 보장형 라우팅 알고리즘 설계)

  • 손승원;장종수;정연서;오창석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10A
    • /
    • pp.1517-1531
    • /
    • 1999
  • The Internet is recently evolving into the directions which is capable of incorporating stream-type services such as voice and video services. However, the existing Internet can only support a best-effort delivery model and thus it is difficult to satisfy these requirements as well as to provide the QoS beyond a certain degree. Accordingly, it is imperative to develop QoS based routing algorithm in order to allow the routing by the user's QoS demand and to be applied into wide area networks. In this thesis, we presented new routing algorithms and made performance evaluations. The proposed algorithms allow the routing by the user’s QoS demand level in order to provide the diverse Internet application services based on ATM network environment that is expected to play a role as an infrastructure of high-speed communication network. They also have a feature of shortening the waiting time for address analysis and have a quality-proven characteristics with enhanced network scalability.

  • PDF

Analysis of Use Intention of Mobile Cloud Service using a Convergence Technology Acceptance Model (융합기술수용모델을 이용한 모바일 클라우드 서비스 이용의도 분석)

  • Seo, Kwang-Kyu
    • Journal of Digital Convergence
    • /
    • v.14 no.12
    • /
    • pp.105-110
    • /
    • 2016
  • As smart devices have proliferated and network speed and accessibility of mobile have accelerated, mobile cloud services that can do the same tasks by various devices are promoted. This paper explores the analysis of use intention of mobile cloud services and influencing factors. We develop and apply a convergence technology acceptance model which combines TAM, VAM and UTAUT. The proposed model verifies some hypotheses to aware the significant factors of use intention of mobile cloud services with TAM, VAM and UTAUT including additional mobile cloud service characteristics such as mobility, high availability, easy accessibility and scalability. Eventually, this research can not only help users gain insights into mobile cloud service use intention, but also help mobile cloud service providers to develop more effective mobile cloud service and their business strategy in the future.

Error Concealment Method Based on POCS for Multi-layered Video Coding (다계층 비디오 코딩에 적용 가능한 POCS 기반 에러 은닉 기법)

  • Yun, Byoung-Ju
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.67-75
    • /
    • 2009
  • Multi-layered video coding that provides scalability across the visual content has emerged for easily adaptive service over current heterogeneous network. However, the network is still error prone environment so that video service may suffer packet loss or erroneous decoding of the video. Especially distortion caused by the burst error may propagate to several pictures until intra refreshing, which will raise a terrific degradation of picture quality. To overcome the problem at terminal independently, we propose a new error concealment algorithm for the multi-layered video coding. The proposed method uses the similarity of between layers in the multi-layered video coding and POCS (Projections Onto Convex Sets) which is a powerful error concealment tool, but heavily dependent on initial values. To find adequate initial value which can reduce iteration times as well as achieve high performance, we took consideration into both features of layered approach coding and the correlation in neighbor blocks. The simulation results show that the proposed concealment method works well.

PARALLEL IMAGE RECONSTRUCTION FOR NEW VACUUM SOLAR TELESCOPE

  • Li, Xue-Bao;Wang, Feng;Xiang, Yong Yuan;Zheng, Yan Fang;Liu, Ying Bo;Deng, Hui;Ji, Kai Fan
    • Journal of The Korean Astronomical Society
    • /
    • v.47 no.2
    • /
    • pp.43-47
    • /
    • 2014
  • Many advanced ground-based solar telescopes improve the spatial resolution of observation images using an adaptive optics (AO) system. As any AO correction remains only partial, it is necessary to use post-processing image reconstruction techniques such as speckle masking or shift-and-add (SAA) to reconstruct a high-spatial-resolution image from atmospherically degraded solar images. In the New Vacuum Solar Telescope (NVST), the spatial resolution in solar images is improved by frame selection and SAA. In order to overcome the burden of massive speckle data processing, we investigate the possibility of using the speckle reconstruction program in a real-time application at the telescope site. The code has been written in the C programming language and optimized for parallel processing in a multi-processor environment. We analyze the scalability of the code to identify possible bottlenecks, and we conclude that the presented code is capable of being run in real-time reconstruction applications at NVST and future large aperture solar telescopes if care is taken that the multi-processor environment has low latencies between the computation nodes.