• Bulletin of the Korean Space Science Society
• /
• 2004.10b
• /
• pp.364-367
• /
• 2004

This paper presents the flight software of KoDSat (KSLV-l Demonstration Satellite) which performs demonstrating the KSLV-l (Korea Space Launch Vehicle-l)'s satellite launch capability. The KoDSat Flight Software executes in a single-processor, multi-function flight computer on the spacecraft, the OBC (On Board Computer). The flight software running on the single processor is responsible for all real-time processing associated with: processor startup and hardware initialization, task scheduling, RS422 handling function, command and data handling including uplink command and down-link telemetry, attitude determination and control, battery state of charge monitoring and control, thermal control processing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1757-1760
• /
• 2003

실시간 시스템에서 주기 태스크의 마감시간을 보장하며 도착 시간을 예측할 수 없는 비주기 태스크를 처리되도록 스케줄링 하는 것은 매우 중요하다. 본 논문에서는 정적 우선순위 스케줄링 방식 중 최적인 RM방식으로 주기 태스크를 스케줄링하고, 비주기 태스크의 발생시 비주기 태스크를 EDF 방식으로 스케줄링하여 오프라인에서 구한 슬랙을 비주기 태스크에 할당한다. 제안한 방식은 비주기 태스크의 마감시한내의 슬랙과 비주기 태스크의 실행 시간을 비교하여 비주기 태스크가 마감시한 내에 실행되지 못하는 경우 주기 태스크와 슬랙을 최적적합으로 교환하는 방식을 사용하여 비주기 태스크의 처리를 가능하게 하였다. 제안된 방식은 경성 비주기 태스크와 연성 비주기 태스크에 적용이 가능하며, 실험 결과 교환 알고리즘을 적용한 스케줄링 방식이 적용하지 않은 스케줄링 방식에 비해 비주기 태스크의 처리율이 높게 나왔다.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2390-2392
• /
• 1998

In this paper, we discuss the development of monitoring system with data process equipment which transfers data from Remote Terminal Unit(RTU) to monitoring computer. The RTUs sense temperature, pressure and PLC(Programmable Logic Controller) nodes conditions of scrubber in semiconductor manufacture processing. The data Process equipment is connected every RTU and a monitoring computer through serial communication. This equipment receives informations from RTU, process data, and transfers them to monitoring computer. To avoid congestion in data communication, task scheduling algorithm used RT O/S(Real-Time Operating System) is embedded in ROM which is a part of data Process equipment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.280-282
• /
• 2003

많은 산업 분야에서 사용되는 실시간 시스템은 논리적 정확성뿐만 아니라 시간적 정확성을 요구한다. 그래서 실시간 시스템에서 동작하는 작업들은 항상 마감시간을 지키기 위해 작업에 대한 스케줄링이 매우 중요한 요소가 된다. 그리고 시스템의 신뢰도를 높이기 위해서는 고장 감내가 반드시 필요하다. 특히. 현대 기술의 발달로 일부 분야에서 사용되어 지던 실시간 시스템이 실시간 내장형 시스템 형태로 다양한 분야에 사용되어 진다. 내장형 시스템을 개발하는데 있어 자원의 절약 또한 하나의 중요한 요소이다. 따라서 본 논문에서는 실시간 시스템에서의 작업들이 마감 시간을 만족하며 고장 감내를 보장하는 시간 중복 기법과 백업 기법을 혼합하여 주기적으로 동작하는 작업들의 신뢰도와 자원의 효율 및 절약을 높이는 스케줄링 기법을 제안하고 실험한다.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.124-129
• /
• 2004

Recently, the demand for the optical cable is rapidly growing because the number of internee user increases and high speed internet data transmission is required. But the present optical cable winding systems has some serious problems such as pile-up and collapse of cable usually near the flange of the bobbin in the process of the cable winding. To reduce the pile-up collapse in a cable winding systems, a new guiding system is developed for a high-speed self-align cable winding. First of all, the winding mechanism was analyzed and synchronization logics for the motions of winding, traversing, and the guiding were created. A prototype cable winding systems was manufactured to validate the new guiding system and the suggested logic. Experiment results showed that the winding system with the developed guiding system outperformed the system without the guiding system in reducing pile-up and collapse in the high-speed winding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5252-5268
• /
• 2018

To support a large-scale Hadoop cluster, Hadoop heartbeat messages are designed to deliver the significant messages, including task scheduling and completion messages, via piggybacking to reduce the number of messages received by the NameNode. Although Hadoop is designed and optimized for high-throughput computing via batch processing, the real-time processing of large amounts of data in Hadoop is increasingly important. This paper evaluates Hadoop's performance and costs when the heartbeat period is controlled to support latency sensitive applications. Through an empirical study based on Hadoop 2.0 (YARN) architecture, we improve Hadoop's I/O performance as well as application performance by up to 13 percent compared to the default configuration. We offer a guideline that predicts the performance, costs and limitations of the total system by controlling the heartbeat period using simple equations. We show that Hive performance can be improved by tuning Hadoop's heartbeat periods through extensive experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.670-673
• /
• 2009

TinyOS는 현재 가장 널리 사용되는 센서 노드용 운영체제이지만, 태스크의 실시간성을 지원하지 않는다는 단점이 있다. 이에 TinyOS에 실시간성을 부여하기 위한 다양한 연구가 진행되었다. 그러나 이들 연구는 TinyOS의 사용자 태스크에 대한 실시간성만을 고려하여, TinyOS 플랫폼이 제공하는 태스크가 포함된 실제의 센서 노드 작업에 대해서는 실시간성을 만족시키지 못한다는 문제점이 있다. 따라서 본 논문에서는 TinyOS에서 센서 노드 작업의 실시간성을 지원하는 새로운 스케줄링 기법을 제안하고자 한다. 이를 위해 기존 연구의 스케줄링 기법을 센서 노드 작업에 적용했을 때 나타나는 작업 중첩 현상과 우선순위 조정 현상을 분석하고, 이를 효율적으로 해결하는 비선점형 EDF(Earliest Deadline First) 작업 스케줄링 기법을 구현하였다. 그리고 제안한 스케줄링 기법은 TinyOS의 이벤트 기반 비선점형 속성을 유지하여 제한된 하드웨어 자원을 가지는 센서 노드에 적합하다는 것을 확인하였다.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.548-558
• /
• 2014

Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

• 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.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.