• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.415-417
• /
• 2002

실시간 시스템은 신뢰성이 중요하다. 특히 고안전성 시스템 (Safety-Critical System)은 안전과 직결되므로 높은 신뢰도가 요구된다. 본 논문에서는 Reactive System 의 모델링 및 검증을 위해 개발된 정형 검증 언어인 SyncCharts를 이용한 실시간 시스템의 스케줄가능성 분석(Schedulability Analysis)을 통해 시스템에 대한 요구조건의 만족여부와 태스크들의 수행가능성을 검증하는 방법을 제시한다.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.296-303
• /
• 2016

Mobile real-time systems with limited system resources and a limited power source need to fully utilize the system resources when the workload is heavy and reduce energy consumption when the workload is light. EDZL (Earliest Deadline until Zero Laxity), a multiprocessor real-time scheduling algorithm, can provide high system utilization, but little work has been done aimed at reducing its energy consumption. This paper tackles the problem of DVFS (Dynamic Voltage/Frequency Scaling) in EDZL scheduling. It proposes a technique to compute a uniform speed on full-chip DVFS platforms and individual speeds of tasks on per-core DVFS platforms. This technique, which is based on the EDZL schedulability test, is a simple but effective one for determining the speeds of tasks offline. We also show through simulation that the proposed technique is useful in reducing energy consumption.

• Journal of the Korean Society for Railway
• /
• v.12 no.2
• /
• pp.267-275
• /
• 2009

Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1565-1574
• /
• 2011

Scheduling of die casting is a procedure of determining quantities of cast products so as to optimize a predetermined performance criterion. This paper presents a novel scheme of preventing product shortage raised by defective castings when die casting scheduling is applied to real casting operations. The previously developed linear programming (LP) model for die casting scheduling maximizes the average efficiency of melting furnaces in regard of the usage of molten alloy. However, the LP model is not able to cope with the problem of defective products occurring in the casting process. The proposed scheme is that whenever defective products are found in a shift, the foundryman produces additional cast products using the residue of molten alloy left at the end of the next shift. Neither the calculated amount of molten alloy nor the scheduling result of the LP model does not have to be altered for this method. The simulation result demonstrates the superiority and applicability of the newly proposed scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.493-501
• /
• 2007

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.50-60
• /
• 2004

Recently, most of the embedded system is required not only many functions but also real-time characteristics in purpose. In the hard real-time system, especially, strict deadline of periodic task can affect the performance of the system. In this paper, we design and implement the scheduler based on RM(Rate-Monotonic) rule. This scheduler makes feasible patterns based on EDF(Earliest deadline first) rule with extended schedulability inspection before execution, for periodic task-set that has high CPU utilization and then, execute periodic task-set depended on feasible patterns. The feasible pattern formed into EDF rule is capable of the efficiency of CPU up to 100 percentage and by the referenced execution of the feasible pattern is possible of removing the red-time scheduling overhead that is the defect of the order of dynamic assignment rule.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.1
• /
• pp.120-127
• /
• 2011

Checkpointing is one of common methods of realizing fault-tolerance for real-time systems. This paper presents a scheme to determine checkpoint intervals using probabilistic optimization. The considered real-time systems comprises multiple tasks in which transient faults can happen with a Poisson distribution. Also, multi-tasks are scheduled by the non-preemptive Rate Monotonic (RM) algorithm. In this paper, we present an optimization problem where the probability of task completion is described by checkpoint numbers. The solution to this problem is the optimal set of checkpoint numbers and intervals that maximize the probability. The probability computation includes schedulability test for the non-preemptive RM algorithm with respect to given numbers of checkpoint re-execution. A case study is given to show the applicability of the proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.255-260
• /
• 2007

내장 실시간 시스템은 논리적 정확성과 시간적 정확성을 모두 만족해야 하는 내장 시스템이다. 시스템의 시간적 정확성을 위해서는 해당 시스템에서 동작하는 태스크들의 스케줄링 가능성을 검사해야 한다. 스케줄링 가능성을 분석하기 위해서는 태스크의 실행 시간 분석이 선행 되어야 한다. 하지만 태스크의 실행 시간은 실행 시점에 따라 가변적이기 때문에 태스크의 정확한 실행 시간을 알아내기는 힘들다. 따라서 가능한 모든 경우를 고려하여 해당 태스크를 구성하는 코드 경로 중 최악의 경로일 경우의 실행 시간인 최악 실행 시간을 이용한다. 기존의 정적 최악 실행 시간 분석을 하는 도구의 경우 동적인 상황의 정보 부재로 인해 최악 실행 시간의 과대 측정 비율이 높다는 문제점이 있다. 본 논문에서는 정적 최악 실행 시간 분석 시 과대 측정 비율을 줄이기 위해 대상 기기에 실행 정보를 적용한 RunInfo(WCET analysis tool using the Run-Time Information) 분석 도구를 설계하고 구현한다. 실행 정보를 정의하고, RunInfo 분석 도구의 구조에 대해 설명한다. 그리고 실행 정보를 적용할 때, 고려할 점에 대해 알아본다. 성능 평가를 위해 RunInfo 분석 도구의 과대 측정 비율을 기존의 분석도구와 비교한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.4
• /
• pp.176-184
• /
• 2002

We provide a checkpointing framework reflecting both the timeliness and the dependability in order to make checkpointing applicable to dependable real-time systems. The predictability of real-time tasks with checkpointing is guaranteed by the worst case execution time (WCET) based on the allocated number of checkpoints and the permissible number of failures. The permissible number of failures is derived from fault tolerance requirements, thus guaranteeing the dependability of tasks. Using the WCET and the permissible number of failures of tasks, we develop an algorithm that determines the minimum number of checkpoints allocated to each task in order to guarantee the schedulability of a task set. Since the framework is based on the amount of time redundancy caused by checkpointing, it can be extended to other time redundancy techniques.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.438-441
• /
• 2013

자동차 관련 기술은 점차 전기, 전자 장치로 빠르게 바뀌어 가고 있다. 차량 내 연결되어 있는 전자 제어 장치들도 그에 따라 증가하게 되었고 장치간의 통신 성능도 중요하게 되었다. 가장 널리 사용되고 있는 차량용 네트워크 프로토콜로는 CAN(Controller Area Network)을 들 수 있다. 그러나 최근 통신 복잡도가 증가함에 따라 주기적 메시지 통신의 메시지 전송 지연 및 중단이 발생되고 있다. 본 논문에서는 이러한 문제에 대한 해결 방안을 제시하기 위해 메시지들의 스케줄 가능성 및 응답시간에 따른 실 시간성 검증 모델을 제안한다. CAN 메시지 수신 시 RMA(Rate Monotonic Algorithm)기반으로 메시지 스케줄 가능성 평가 모델을 개발하였다. 또한, CAN 메시지를 송신할 경우 RTA(Response Time Analysis)를 고려한 실 시간성 평가 모델을 제시하였다. 실험 1 에서는 기존 RMA 기법으로 통신을 수행한 결과 통신 중 중단되는 현상을 확인하였고 이후 제안 모델에서는 23%정도의 추가 시간을 확보하여 통신을 완료하는 것을 증명하였다. 실험 2 에서는 메시지 통신의 응답시간이 모두 제안된 Worst-case 응답시간 이내로 측정되어 실 시간성을 만족함을 확인하였다.