• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2000년도 춘계학술대회 논문집
• /
• pp.324-329
• /
• 2000

Object of a real-time system, that performs exact information based on the real-time constraint. is required for an improvement of high reliability. The fault-tolerant task scheduling strategy of multiprocessor as using a distributed memory based on a hardware redundancy can be improved into a high reliability of the real-time system. Therefore, this paper is shown to analyze the reliability of the system by using the transfer parameter and make the modeling in reference to a minimization of the fault-tolerant task scheduling strategy which uses a percentage of task missing and deadline parameter based on optimization task size.

• 전기학회논문지
• /
• 제57권5호
• /
• pp.875-880
• /
• 2008

In this paper, a novel method to determine the optimal checkpoint interval for real-time control task is proposed considering its performance degradation according to tasks's execution time. The control task in this paper has a specific sampling period shorter than its deadline. Control performance is degraded as the control task execution time is prolonged across the sampling period and eventually zero when reached to the deadline. A new performance index is defined to represent the performance variation due to the extension of task execution time accompanying rollback fault recovery. The procedure to find the optimal checkpoint interval is addressed and several simulation examples are presented.

• 제어로봇시스템학회논문지
• /
• 제18권4호
• /
• pp.337-342
• /
• 2012

This paper presents performance evaluation of real-time mechanisms for real-time embedded linux. First, we presents process for implementing open-source real-time embedded linux namely RTAI and Xenomai. These are real-time extensions to linux kernel and we implemented real-time embedded linux over the latest linux kernel. Measurements of executions of real-time mechanisms for each distribution are performed to give a quantitative comparison. Performance evaluations are conducted in kernel space about repeatability of periodic task, response time of Semaphore, FIFO, Mailbox and Message queue in terms of inter-task communication for each distribution. These rules can be helpful for deciding which real-time linux extension should be used with respect to the requirements of the real-time applications.

• International Journal of Computer Science & Network Security
• /
• 제21권4호
• /
• pp.19-27
• /
• 2021

Tasks scheduling have been gaining attention in both industry and research. The scheduling that ensures independent task execution is critical in real-time systems. While task scheduling has gained a lot of attention in recent years, there have been few works that have been implemented into real-time architecture. The efficiency of the classical scheduling strategy in real-time systems, in particular, is still understudied. To reduce total waiting time, we apply three scheduling approaches in this paper: First In/First Out (FIFO), Shortest Execution Time (SET), and Shortest-Longest Execution Time (SLET). Experimental results have demonstrated the efficacy of the SLET in comparison with the others in most cases in a wide range of configurations.

• 한국자동차공학회논문집
• /
• 제24권2호
• /
• pp.127-136
• /
• 2016

The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

• 한국멀티미디어학회논문지
• /
• 제13권10호
• /
• pp.1423-1435
• /
• 2010

무선 센서 네트워크를 구성하는 센서 노드는 배터리 기반의 제한된 전원과 낮은 연산 능력의 초경량 마이크로프로세서, 그리고 제한된 크기의 메모리 자원 등과 같은 하드웨어 사양을 가지고 있다. 이와 같은 제약 사항에도 불구하고 무선 센서 노드는 센싱 데이터의 실시간 처리 및 데이터 송수신 작업을 동시에 병행할 수 있어야 한다. 이에 본 논문에서는 배터리 작동식의 무선 센서 노드를 위한 에너지 효율적인 실시간 태스크 스케줄링 기법을 제안하였다. 제안한 에너지 효율적인 실시간 스케줄링 가법은 태스크의 실제 실행시간이 최악 실행시간보다 작을 경우에 발생되는 태스크의 실행 여유시간을 이용하여, 마이크로프로세서의 동작 주파수를 조절하고 무선 센서 노드의 전력 소비를 줄인다. 제안한 기법의 동작을 시험한 결과, 효율적인 전력 소비를 제공함과 동시에 실시간 태스크의 마감시한이 보장됨을 확인하였다.

• International journal of advanced smart convergence
• /
• 제7권3호
• /
• pp.92-100
• /
• 2018

In this paper, we propose a fault-tolerant scheduling scheme with energy efficiency for real-time periodic tasks on DVFS-enabled multicore processors. The scheme provides the tolerance of a permanent fault with the primary-backup task model. Also the scheme reduces the energy consumption of real-time tasks with the fully overlapped execution between each primary task and its backup task, whereas most of previous methods tried to minimize the overlapped execution between the two tasks. In order to the leakage energy loss of idle cores, the scheme activates a part of available cores with rarely used cores powered off. Evaluation results show that the proposed scheme saves up to 82% energy consumption of the previous method.

• 인터넷정보학회논문지
• /
• 제6권2호
• /
• pp.25-35
• /
• 2005

실시간 스케줄링 알고리즘에서는 비율단조(RM) 스케줄링 알고리즘과 마감시한(EDF) 스케줄링 알고리즘이 가장 일반적으로 사용되고 있다. 이러한 알고리즘에서는 태스크 집합의 전체 이용율 값을 가지고 수행 가능성을 판별하였다. 그러나 임의의 태스크에서 이용율 값이 초과되면 개별 태스크의 한계성을 전혀 예측할 수 없는 문제점이 있었다. 본 논문에서 제안한 알고리즘은 이용율 값이 초과한 태스크를 예측하고, 개별 태스크의 이용율 값을 기반으로 스케줄링 가능성 여부를 판단하는 방법을 제시하였다. 또한, 실시간 시스템에서 스케줄링 가능성 검사의 한계성을 시뮬레이션을 통해 예측하고 결과를 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권10호
• /
• pp.3423-3438
• /
• 2014

In recent years, wearable sensor devices are reshaping the way people live, work, and play. A wearable sensor device is a computer that is subsumed into the personal space of the user, and is always on, and always accessible. Therefore, among the most salient aspects of a wearable sensor device should be a small form factor, long battery lifetime, and real-time characteristics. Thereby, sophisticated applications of a wearable sensor device use real-time operating systems to guarantee real-time deadlines. The deterministic multi-dimensional task scheduling algorithms are implemented on ARC (Actual Remote Control) with relatively limited hardware resources. ARC is a wearable wristwatch-type remote controller; it can also serve as a universal remote control, for various wearable sensor devices. In the proposed algorithms, there is no limit on the maximum number of task priorities, and the memory requirement can be dramatically reduced. Furthermore, regardless of the number of tasks, the complexity of the time and space of the proposed algorithms is O(1). A valuable contribution of this work is to guarantee real-time deadlines for wearable sensor devices.

• 한국정보통신학회논문지
• /
• 제18권7호
• /
• pp.1704-1712
• /
• 2014

실시간 태스크의 스케줄링 가능성 검사를 위해 미리 설정된 태스크의 최악 실행 시간보다 태스크의 실제 실행 시간이 짧은 경우, 최악 실행 시간에서 남은 실행 유휴 시간이 발생한다. 발생된 실행 유휴 시간은 실시간 전력 관리 스케줄링 기법을 통해 배터리 기반 센서 노드의 전력 소비 감소에 활용될 수 있다. 이에 본 논문에서는 발생된 남은 최악 실행 유휴 시간을 분배하여 실시간 전력 관리 스케줄링 기법에서 활용할 수 있도록 세 가지 분배 정책을 제안하였다. 제안한 분배 정책은 보수적, 중도적, 그리고 공격적 실행 유휴 시간 분배 정책으로 각각 구분하였다. 그리고 분배 정책 유형에 따른 실시간 전력 관리 스케줄링 기법의 성능 평가는 전력 소비 측면에서 비교 분석하였다.