• Title/Summary/Keyword: 우선순위 스케쥴링

Search Result 67, Processing Time 0.022 seconds

Method for Supporting Multiple Service in a Mobile Terminal (이동 단말기에서 다중 서비스 지원 방안)

  • Lee, Jong-Chan;Park, Sang-Joon;Lee, Jin-Kwan
    • Convergence Security Journal
    • /
    • v.8 no.2
    • /
    • pp.79-85
    • /
    • 2008
  • Our paper deals with a method for supporting multiple call/sessions in a mobile terminal. The different identifier for each protocol layer is assigned to each session when a mobile terminal sets SDP for multimedia services. In particular, QoS based tasks are used for managing the traffics in radio interface. Also, queuing, admission control, load control, resource allocation and scheduling are done based on the priority of sessions. The various multimedia services which is different in the requirement of resource allocation are able to be serviced simultaneously because a mobile terminal can provide the various services based on this scheme.

  • PDF

MAC Scheduling Algorithm for Efficient Management of Wireless Resources in Bluetooth Systems (블루투스 시스템에서의 효율적 무선자원관리를 위한 MAC 스케쥴링 기법)

  • 주양익;권오석;오종수;김용석;이태진;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.702-709
    • /
    • 2003
  • In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

Design and Implementation of The Priority based Round Robin Scheduling Operating System for Compact Size Embedded System (소규모 임베디드 시스템을 위한 우선 순위 기반 라운드 로빈 스케줄링 운영체제의 설계 및 구현)

  • 남상엽;이상원;박인정
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.4
    • /
    • pp.222-231
    • /
    • 2003
  • In This paper, the operating system using priority based round robin scheduling system is designed and implemented. Using this scheduler, Real-Time operation is possible because High priority Task is running first and the other Task is running in parallel. Also Intertask Communication, Device Driver and operating system suitable for using the compact sized embedded system were implemented. Therefore this Operating system provides efficient and rapid implementation for the compact sized embedded system application.

High-Performance VOD server based on storage access scheduling and double buffer (스토리지 접근 스케쥴링과 더블 버퍼구조 기반 VOD 서버의 고성능화)

  • Kim, Cheon-Seog;Ji, Mi-Kyong;Yoon, Jeong-Hyun;Kim, Kyu-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.11a
    • /
    • pp.403-405
    • /
    • 2009
  • 통방융합 환경에서 Killer 서비스로 각광을 받고 있는 VOD(Video On Demand)서비스에서 I/O 병목현상은 VOD 서버의 오 동작 및 성능 저하의 주요 원인이 되고 있다. 본 논문에서는 이런 I/O 병목 현상을 개선하여 입출력 효율이 좋은 고성능 VOD 솔루션을 제안한다. 제안된 솔루션은 대용량 더블 버퍼를 구성하여 하나의 버퍼로 클라이언트에 데이터를 전송하고 있는 사이에, 나머지 다른 버퍼에서 스토리지에서 전송되는 데이터를 버퍼에 저장 하여, 디스크 접근 시 한번에 보다 많은 데이터를 읽음으로써 연속적인 정보를 가져올때 빈번하게 하드디스크의 접근을 줄임으로서 끊김없는 전송을 가능하게 한다. 또한 다수의 사용자가 동시 접근 시 데이터 충돌을 방지하고, 스토리지에 순차적으로 연속 접근하도록 접근 발생 시간에 따라 우선 순위 인덱스를 할당하고 회수하도록 스토리지 접근 스케쥴러를 고안 하였다. 제안된 솔루션의 유효성을 검증하기 위해 SD급 콘텐츠에 대해 솔루션의 Throughoutput 처리량을 벤치마킹 테스트로 검증을 하였다. 테스트 결과 MPEG-2 SD급 영상에대해 Raid 5에서 최대 1000 스트리밍을 전송 할 수 있음을 확인 하였다.

  • PDF

Performance Evaluation of the HIPERLAN Type 2 Media Access Control Protocol (HIPERLAN 타입 2 매체접근제어 프로토콜의 성능평가)

  • Cho, Kwang-Oh;Park, Chan;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.11-17
    • /
    • 2003
  • In this paper, we presented the dynamic random access channel allocation method under the priority based scheduling policy in order to improve the system performance of HIPERLAN/2 standardized by ETSI According to the scheduling policy, AP scheduler primarily allocates the resource to the collision MT This scheduling policy bring about decreasing the transmission delay of collision MT Dynamic RCH(random access channel) allocation method decreases the collision probability by increasing the number of RCH slots in case of low traffic. While it increases the maximum throughput by increasing the number of the data transmission slots in case of high traffic Therefore dynamic allocation method of RCH slots decreases the scheduling delay and increases the throughput When we evaluate the performance of presented method based on standards, we saw that the presented method improve the performance of the MAC protocol in terms of throughput and transmission delay.

A Hierarchical Deficit Round-Robin Algorithm for Packet Scheduling (패킷 스케쥴링을 위한 결손 보완 계층적 라운드로빈 알고리즘)

  • Pyun Kihyun;Cho Sung-Ik;Lee Jong-Yeol
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.147-155
    • /
    • 2005
  • For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

Design and Implementation of Real-Time Operating System for a GPS Navigation Computer (GPS 항법 컴퓨터를 위한 실시간 운영체제의 설계 및 구현)

  • Bae, Jang-Sik;Song, Dae-Gi;Lee, Cheol-Hun;Song, Ho-Jun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.429-438
    • /
    • 2001
  • GPS (Global Positioning System) is the most ideal navigation system which can be used on the earth irrespective of time and weather conditions. GPS has been used for various applications such as construction, survey, environment, communication, intelligent vehicles and airplanes and the needs of GPS are increasing in these days. This paper deals with the design and implementation of the RTOS (Real-Time Operating System) for a GPS navigation computer in the GPS/INS integrated navigation system. The RTOS provides the optimal environment for execution and the base platform to develop GPS application programs. The key facilities supplied by the RTOS developed in this paper are priority-based preemptive scheduling policy, dynamic memory management, intelligent interrupt handling, timers and IPC, etc. We also verify the correct operations of all application tasks of the GPS navigation computer on the RTOS and evaluate the performance by measuring the overhead of using the RTOS services.

  • PDF