• Title/Summary/Keyword: round robin

Search Result 339, Processing Time 0.024 seconds

A Design and Implementation of Concurrent Synchronizations Protocol of Multiple Client (다수 클라이언트의 동시 동기화 프로토콜 설계 및 구현)

  • Kim, Hong-Ki;Lim, Chang-Woo;Lee, Sang-Sin;Kim, Dong-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.135-138
    • /
    • 2008
  • The existing protocol which processes sequentially synchronization has the problem where synchronization tasks which are requested subsequently from multiple client. Should be waited for a long time. In this paper, we propose a implementation of concurrent synchronization protocol that is capable of reducing the waiting time. If there are no update conflicts among different synchronization tasks, the proposed protocol synchronizes using the multi-queue based on the round-robin scheme, in order to reduce the waiting time.

  • PDF

Realization of CAT Interface supporting Multitask (다중처리를 지원하는 CAT 인터페이스에 관한 연구)

  • 전동근;노승환;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.12
    • /
    • pp.1423-1436
    • /
    • 1992
  • In the paper, a CAT interface supporting multitask is realized. To interface a computer with measuring instruments, a GPIB card is designed and implemented. Controlling and displaying software using OOP and GUI are programmed with C++. A spectrum analyzer and a power meter are chosen as object instrument to be controlled. Total 9 modules are configured to manage the various resources and each module in integrated system. Also in case that several instruments are used, the system is realized to be capable of multitasking to exchange the data mutually. The multitasking is implemented under the time-sharing DOS environment. Thread-based method is used for processing, and Round Robin method for scheduling. Provided proper software modules for other object instruments are integrated, the system can control more measuring instruments simultaneously by the computer. Users can save the time and errors even without expert knowledge.

  • PDF

Design And Performance Evaluation of Fault-Tolerant Continuous Media Storage System Based on $PRR_gp$ ($PRR_gp$ 기반 결함허용 연속 매체 저장시스템의 설계와 성능평가)

  • O, Yu-Yeong;Kim, Seong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1290-1298
    • /
    • 2000
  • Multimedia Systems such as VOD(Video On Demand) and MOD (Multimedia On Demand) need to support continuous media operations which are randomly called by concurrent users and require that stored media be accessed in real-tim. To satisfy such a requirements, disk arrays consisting of multiple disks are generally used as storage systems. Under the real-time environments to provide users with accessing continuous media in the parallel and concurrent manner, storage systems should be able to deal with user requests independently. In this paper, we present a new fault-tolerant continuous media storage system called PADA(PRR\ulcorner bAsed Disk Array), which is based on a PRR\ulcorner (Prime Round Robin with Grouped Parties) disk placement scheme with enhanced reliability nd load-balancing. We have compared and evaluated the storage space overhead for fault-tolerance, the reliability of diks array systems, the degree of disk load0-balancing, the demanded buffer space, the maximum number of users being capable of supporting and the fault recovery overhead for PADA, RAID 5 and Declustered storage systems. According to the results, PADA is the best among them in that PADA satisfies load-balancing more effectively and servces more user in case of arbitrary-rate retrievals.

  • PDF

Traffic Analysis Monitoring System for Web Server Load Balancing (웹서버의 부하균형을 위한 트래픽상황분석 모니터링 시스템)

  • Choi E-Jung;Lee Eun-Seok;Kim Seok-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.2
    • /
    • pp.79-85
    • /
    • 2005
  • In order to handle client's requests while multiple servers seamlessly work in the web server cluster environment, it is vital to implement a router that execute a routing using TCP information and requested target content. The implemented package software measured packet volume that was generated from data generator, virtual server, and server 1, 2, 3, and could find out traffic distribution toward Server 1, 2, 3. As the result of the study shows, Round Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some partial cases, they were eventually alleviated by repeated tests for a longer time.

  • PDF

An Efficient Scheduling Algorithm for the Web Application Server (웹 응용 서버를 위한 효율적인 스케쥴링 알고리즘)

  • Lee, Hyeong-Dong;Lee, Byeong-Jun;Kim, Hyeong-Ju
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.4
    • /
    • pp.405-415
    • /
    • 1999
  • 웹의 성장은 점차 복잡한 응용에 대한 요구를 가중시켰으며, 데이타베이스와 웹과의 효율적인 연동 역시 중요한 문제가 되었다. 본 논문에서는 이와 같은 환경을 효율적으로 지원하기 위한 웹 응용 서버 WATS를 설계하고 구현하였다. WATS에서 응용 프로그램은 컴포넌트 단위로 작성된 후 동적으로 링크되고 요청을 처리할 응용 서버가 대기 상태로 존재하는 확장 API 응용 서버 방식으로 구현되었으며, 이러한 웹 서버와 응용 서버의 분리 구조는 대량의 요청을 처리하기에 적합하다. 또한 컴포넌트를 특성에 따라 분류한 후 각 특성에 적합한 특성 기반 스케줄링 알고리즘을 적용하여 프로세스 부하 균형을 이루었으며, 이 기법이 일반적인 라운드 로빈 스케줄링 알고리즘보다 좋은 성능을 나타냄을 성능 측정을 통해서 보인다.Abstract The increasing popularity of the World-Wide-Web (WWW) has resulted in demand for more complex applications, and web gateways to database became core component in such applications. In this paper, we have designed and implemented WATS in order to support these environments. In WATS, application components are dynamically linked with application server processes. And it is implemented as extensible API application server architecture and is able to process a large amount of requests through separating web server from application server. Also we classify the components into various categories according to its own properties and devise process load balancing algorithm by using property-based scheduling. We show WATS using this algorithm performs better than those using general round-robin algorithm.

Dynamic TDMA Protocol for Transmission of Tactical Information in Wireless Network (무선통신망에서 전술정보 전송을 위한 동적 시분할 다중접속프로토콜)

  • Park, Chang-Un;Kim, Tae-Kon;Lim, Man-Yeob;Lee, Youn-Jeong;Kim, Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1640-1650
    • /
    • 2010
  • To prepare for the network centric warfare, Korea Joint Tactical Data Link System(KJTDLS) has been developed by the South Korean military recently and its development is divided into two phases: basic and complete ones. Due to the limited bandwidth and low transmission efficiency of the developing KJTDLS (basic), lots of problems could be occurred when the TDMA protocol in Link-16 is applied. In this paper, a new dynamic TDMA frame structure for KJTDLS(basic) is proposed and the performance of the proposed is evaluated through the implementation of simulation.

Delayed Hydride Cracking Velocity of CANDU Zr-2.5Nb Tubes in High Temperature Water

  • Kim Young Suk;Cho Sun Young;Im Kyung Soo;Cheong Yong Moo;Kim Sung Soo
    • Nuclear Engineering and Technology
    • /
    • v.35 no.3
    • /
    • pp.206-213
    • /
    • 2003
  • This study focuses on an understanding of the environmental effect on delayed hydride cracking velocity (DHCV) of CANDU Zr-2.5Nb tubes. To simulate DHC susceptibility of the Zr-2.5Nb tubes in reactor operating conditions, DHC tests were successfully carried out in pressurized water at 180 and $250^{\circ}C$ using a self-designed autoclave for the first time. Using 17 mm compact tension specimens electorlytically charged to 34 and 60 ppm H, 3 to 7 DHCV data were determined in water at both temperatures and compared to those determined in air that were already confirmed to be valid through a round robin test on DHCV of Zr-2.5Nb tubes sponsored by a IAEA coordinated research program. The pressurized water environment has little effect on DHCV of Zr-2.5Nb tube in water at both temperatures even though DHCV is slightly lower in water than that in air. The lower DHCV of the Zr-2.5Nb tube during short-term tests is discussed in viewpoint of the cooling rate from the peak temperature to the test temperature.

A Traffic Adaptive MAC Scheduling for Bluetooth with Maximized throughput and Guaranteed fairness

  • Kim Tae suk;Choi Sung-Gi;Kim Sehun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.418-425
    • /
    • 2002
  • Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

  • PDF

Development of Consistency Algorithm for VOD Streaming Server Data (VOD 스트리밍 서버 데이터를 위한 일치성 보장 알고리즘 개발)

  • Jang Seung-Ju
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.5 s.311
    • /
    • pp.8-16
    • /
    • 2006
  • This paper proposes and implements consistency algorithm that is serviced streaming data efficiently in VOD system. The media data is loaded into each node by Round Robin method. The barrier mechanism is changed into the minimum data factor(SH, GOP) of media data in this paper. In addition in order to fast media data service, the additional features are implemented in the consistency algorithm. Additional feature of the consistency algorithm is added. First, time synchronization algorithm is added the suggested consistency algorithm. Second, the prepaging mechanism supports efficient buffering service. I experimented the suggested consistency algorithm two DSM systems. The performance is good due to the last barrier algorithm.

A Design of a High Performance Stream Processor without Superscalar Architecture (슈퍼스칼라 구조를 갖지 않는 고성능 Stream Processor 설계)

  • Lee, Kwan-Ho;Kim, Chi-Yong
    • Journal of IKEEE
    • /
    • v.21 no.1
    • /
    • pp.77-80
    • /
    • 2017
  • In this paper, we proposed a way to improve performance of GP-GPU by deletion of superscalar issue from its original form. At first, we simplified the structure of stream processor in order to eliminate superscalar issue. Under this condition, preservation of hardware size and increasing of thread number were followed by functional improvement of GP-GPU. As the number of thread was getting larger, we proposed the new model of warp scheduler which adjusts the group of thread. This superscalar issue-deleted warp scheduler transferred the instructions to warp which was activated by Round Robin Scheduling. Performance comparison was conducted by Gaussian filtering and the results indicated that our newly designed GP-GPU showing 7.89 times better in its performance than original one.