• Title/Summary/Keyword: server performance

Search Result 1,690, Processing Time 0.03 seconds

Smoothing Algorithm Considering Peak Rate Utilization in IoT Environment (IoT 환경에서 첨두 전송률 이용률을 고려한 스무딩 알고리즘)

  • MyounJae Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.4
    • /
    • pp.21-26
    • /
    • 2024
  • The transmission of video data stored on a video server to a large number of clients with finite buffer sizes requires a transmission plan that considers factors such as the number of rate changes, peak rate, and the amount of rate variability. Such transmission plans are referred to as smoothing algorithms, examples of which include CBA, MCBA, and MVBA. This study proposes an algorithm to reduce the utilization of the peak rate and evaluates the performance of the proposed algorithm. The evaluation factors include the number of rate changes, peak rate, rate variability, buffer utilization, average rate, and peak rate utilization. The evaluation results show that the proposed algorithm exhibits lower buffer utilization, average rate, and peak rate utilization compared to the MVBA algorithm.

Design and Implementation of a Communication Module of the Parallel Operating File System based on MISIX (MISIX 기반의 병렬 파일 시스템의 통신 모듈 설계 및 구현)

  • Jin, Sung-Kn;Cho, Jong-Hyun;Kim, Hae-Jin;Seo, Dae-Wha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.4
    • /
    • pp.373-382
    • /
    • 2000
  • This paper is concerned with development of a communication module of POFS(Parallel Operating File System), which is the parallel file system to be operated on SPAX computer. SPAX is multiprocessor computer with clustering SMP architecture and being developed by ETRI. The operating system for SPAX is MISIX based on the Chorus microkernel. POFS has client/server architecture basically so that it is important to design a communication module. The communication module is so easily affected by network environment that bad design is the major reason that decreases the portability and performance of the parallel file system. This paper describes the structure and performance of the communication of the POFS. the theme is issued in the course of designing and developing POFS. The communication module of POFS was designed to support the portability and the architecture of parallel file system.

  • PDF

Implementation of the Aural Cueing System(ACS) for Applying the Reconfigurable Tactical Flight Training System(RTT) (가변형 전술 시뮬레이터 적용을 위한 음향 재생 시스템 구현)

  • Hong, Seung-Beom;Ahn, Dong-Man;Jie, Min-Seok
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.1092-1100
    • /
    • 2012
  • In this paper, it has designed and developed the integrated aural cueing system(ACS) system of the reconfigurable tactical Flight Training System(RTT) for the 6 rotorcraft such as UH-1H, UH-60, AH-1H, 500MD, BO-100, and CH-47. RTT is an evolving alternative instructional training system to provide the ability to rehearsal and collectively train, through networked simulators in a unit-collective and combined arms simulated battlefield environment. ACS handles the volume, pitch and repetition of the digitally stored sounds based on commands it receives from the Host server. This paper explained and implemented the conceptual and detail design the ACS system. In order to evaluating the performance of the ACS system, we made the monitoring system for interworking the virtual Host and the ACS system. As the result, it was confirmed the good performance.

Fixed Size Memory Pool Management Method for Mobile Game Servers (모바일 게임 서버를 위한 고정크기 메모리 풀 관리 방법)

  • Park, Seyoung;Choi, Jongsun;Choi, Jaeyoung;Kim, Eunhoe
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.327-336
    • /
    • 2015
  • Mobile game servers usually execute frequent dynamic memory allocation for generating the buffers that deal with clients requests. It causes to deteriorate the performance of game servers since it increases system workload and memory fragmentation. In this paper, we propose fixed-sized memory pool management method. Memory pool for the proposed method has a sequential memory structure based on circular linked list data structure. It solves memory fragmentation problem and saves time for searching the memory blocks which are required for memory allocation and deallocation. We showed the efficiency of the proposed method by evaluating the performance of dynamic memory allocation, through the proposed method and the memory pool management method based on boost open source library.

Load Balancing Algorithm for Parallel Computing of Design Problem involving Multi-Disciplinary Analysis (다분야통합해석에 기반한 설계문제의 병렬처리를 위한 부하분산알고리즘)

  • Cho, Jae-Suk;Chu, Min-Sik;Song, Yong-Ho;Choi, Dong-Hoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.3
    • /
    • pp.281-286
    • /
    • 2007
  • An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of computing time for the entire design process, and therefore it is essential to introduce a Multiple Processor System (MPS) for reducing the computing time. However, when applying conventional parallel processing techniques, all of the CAE S/W requited for the MDA should be installed on all the servers making up MPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a Computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

Integrated Verification of Hadoop Cluster Prototypes and Analysis Software for SMB (중소기업을 위한 하둡 클러스터의 프로토타입과 분석 소프트웨어의 통합된 검증)

  • Cha, Byung-Rae;Kim, Nam-Ho;Lee, Seong-Ho;Ji, Yoo-Kang;Kim, Jong-Won
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.2
    • /
    • pp.191-199
    • /
    • 2014
  • Recently, researches to facilitate utilization by small and medium business (SMB) of cloud computing and big data paradigm, which is the booming adoption of IT area, has been on the increase. As one of these efforts, in this paper, we design and implement the prototype to tentatively build up Hadoop cluster under private cloud infrastructure environments. Prototype implementation are made on each hardware type such as single board, PC, and server and performance is measured. Also, we present the integrated verification results for the data analysis performance of the analysis software system running on top of realized prototypes by employing ASA (American Standard Association) Dataset. For this, we implement the analysis software system using several open sources such as R, Python, D3, and java and perform a test.

Path Finding with Maximum Speed Dynamic Heuristic (최고 속력 동적 휴리스틱을 이용한 경로탐색)

  • Kim, Ji-Soo;Lee, Ji-Wan;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1615-1622
    • /
    • 2009
  • Generally, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than The Center Based Navigation System(CBNS). TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement quality of a path, because of limited performance. In this paper, we propose a Dynamic Heuristic to improve quality of path in the TBNS. Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server. In this paper, we propose path-lading algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same size. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than A* algorithm.

Performance Evaluation of Advanced Container Security Device(ACSD) system based on IoT(Internet of Things) (IoT 기반 컨테이너 보안 장치 및 시스템 성능 평가)

  • Moon, Young-Sik;Choi, Sung-Pill;Lee, Eun-Kyu;Kim, Jae-Joong;Choi, Hyung-Rim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2183-2190
    • /
    • 2013
  • Container Security Device (ConTracer) which is suggested in this study is to monitor temperature, humidity, and impact inside of the container while the container is transported. ConTracer could also give information to users when a door of the container is opened over 2 inch within 1 second. Additionally, GPS/GLONASS based global position and status information about container are transmitted to a remote server using IoT (Internet of Things) based communication. In this research, we are looking into the development trend of global container security devices; and applying ConTracer to real freight transport from domestic to overseas using Global Roaming Service which is offered for domestic Mobile Communication Companies as well. As a result, we estimate the performance of ConTracer and verify it.

Design and Implementation of Buffer Management Method for Enhancing Performance of Open GIS Components (개방형 GIS 컴포넌트의 성능 개선을 위한 버퍼 관리 방법의 설계 및 구현)

  • Cho, Dae-Soo;Min, Kyoung-Wook
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.51-60
    • /
    • 2004
  • In open GIS environment, a GIS client can access spatial data in different types of GIS sowers with the same Interfaces. This means that open GIS components software ensures the interoperability throughout the heterogeneous GIS servers. The user response time, however, tends to be increased, if the client makes use of the standard interfaces for data accesses that can ensure interoperability. This is because the format of spatial data accessed from a specific GIS server must be transformed into common format, such as Rowset in OLE/DB, which is compatible with the standard interfaces. In this paper, we develop efficient techniques for data buffering in GIS client to reduce the response time. We design the buffer management method, which Is based on the space partitioning, and Integrate buffer management components into MapBase, an open GIS component software. And we also, show that buffer management proposed in this paper yields significant performance improvement in GIS client.

A Data Transfer Method of the Sub-Cluster Group based on the Distributed and Shared Memory (분산 공유메모리를 기반으로 한 서브 클러스터 그룹의 자료전송방식)

  • Lee, Kee-Jun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.635-642
    • /
    • 2003
  • The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.