• 제목/요약/키워드: Schedulability Analysis

검색결과 40건 처리시간 0.024초

스케줄링 가능성 분석을 통한 무장모의기 확장 설계 및 분석 (Design and Analysis of Weapon Simulator using Schedulability Analysis)

  • 장택수;김용호;나범철;박근국
    • 한국군사과학기술학회지
    • /
    • 제19권3호
    • /
    • pp.371-378
    • /
    • 2016
  • The most important things in real-time systems are that a system guarantees to meet its deadline and to operate in its predictable range. When we design a real-time system, we need to verify whether the system can meet its deadline through schedulability analysis. There are several kinds of schedulability analysis technique for fixed priority scheduling systems. But as we all know, we can't perform schedulability analysis in design time because we can't estimate upper bounds on execution time of each task. So we used a similar real-time system to estimate upper bounds on execution time for our system, and then we performed schedulability analysis and verified that our system designed can meet its deadline.

분산 실시간 프로세스의 스케줄가능성 분석 및 구현 (A Schedulability Analysis and Implementation of Distributed Real-Time Processes)

  • 박흥복;김춘배
    • 한국정보통신학회논문지
    • /
    • 제3권1호
    • /
    • pp.209-221
    • /
    • 1999
  • 실시간 스케줄가능성 분석을 위한 여러 가지 방법들이 제안되었지만, 이들은 프로세스의 모든 상태공간을 추적하거나 고정 우선 순위 스케줄링 방법을 사용하기 때문에 시간 및 공간에 대한 복잡성의 증가를 야기한다. 따라서 상태공간의 수를 줄임으로써 보다 빠른 시간에 스케줄가능성을 판단하는 방법이 필요하다. 본 논문에서는 프로세스 대수의 전이규칙을 이용하여 번역시간에 결정될 수 있는 프로세스의 최소 수행시간, 주기, 마감시간, 동기화 시간을 고려하여 실시간 프로세스가 마감시간을 지키는가를 판단하는 개선된 알고리즘을 제안 및 구현한다. 구현 결과를 통하여 모든 상태 공간을 검색하지 않고도 스케줄가능성을 판단하는 효과적인 성능을 보였다.

  • PDF

멀티 혼합 중요도 시스템에서 태스크 마이그레이션의 스케줄가능성 분석 (Schedulability Analysis for Task Migration under Multiple Mixed-Criticality Systems)

  • 백전성;강경태
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2019년도 제60차 하계학술대회논문집 27권2호
    • /
    • pp.7-8
    • /
    • 2019
  • In this paper, we applied the migration technique to real-time tasks that have relatively low criticality but still important to be dropped by the mixed-criticality scheduling algorithms. The proposed drop and migrate algorithm analyzes the schedulability by calculating CPU utilization and response time of using task migration. We provide analysis to guarantee the deadline of LO-tasks, by transforming the response time equation specified with migration time. The transformed response time equation was able to analyze the migration schedulability. This algorithm can be used with various mixed-criticality schedulers as a supplementary method. We expect this algorithm will be used for scheduling LO-tasks such as communication task that requires safety guarantee especially in platooning and autonomous driving by utilizing the advantages of multiple node connectivities.

  • PDF

DEVELOPMENT OF TIMING ANALYSIS TOOL FOR DISTRIBUTED REAL-TIME CONTROL SYSTEM

  • Choi, J.B.;Shin, M.S.;M, Sun-Woo
    • International Journal of Automotive Technology
    • /
    • 제5권4호
    • /
    • pp.269-276
    • /
    • 2004
  • There has been considerable activity in recent years in developing timing analysis algorithms for distributed real-time control systems. However, it is difficult for control engineers to analyze the timing behavior of distributed real-time control systems because the algorithms was developed in a software engineer's position and the calculation of the algorithm is very complex. Therefore, there is a need to develop a timing analysis tool, which can handle the calculation complexity of the timing analysis algorithms in order to help control engineers easily analyze or develop the distributed real-time control systems. In this paper, an interactive timing analysis tool, called RAT (Response-time Analysis Tool), is introduced. RAT can perform the schedulability analysis for development of distributed real-time control systems. The schedulability analysis can verify whether all real-time tasks and messages in a system will be completed by their deadlines in the system design phase. Furthermore, from the viewpoint of end-to-end scheduling, RAT can perform the schedulability analysis for series of tasks and messages in a precedence relationship.

Improved Schedulability Analysis of Real-Time Sporadic Tasks with EDF Preemptive Scheduling

  • Darbandi, Armaghan;Kim, Myung-Kyun
    • Journal of information and communication convergence engineering
    • /
    • 제10권4호
    • /
    • pp.396-404
    • /
    • 2012
  • This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique presented in this paper, we exploit the precedence relations between subtasks in an accurate way while taking advantage of the deadline of different subtasks. Another nice feature of our approach is that it avoids calculation time overhead by exploiting the concept of deadline busy period. Experimental results show that this consideration leads to a significant improvement compared with existing work.

Path Collision-aware Real-time Link Scheduling for TSCH Wireless Networks

  • Darbandi, Armaghan;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4429-4445
    • /
    • 2019
  • As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

Sustainability in Real-time Scheduling

  • Burns, Alan;Baruah, Sanjoy
    • Journal of Computing Science and Engineering
    • /
    • 제2권1호
    • /
    • pp.74-97
    • /
    • 2008
  • A scheduling policy or a schedulability test is defined to be sustainable if any task system determined to be schedulable remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is, in general, preferable engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not.

실시간 프로그램의 스케줄가능성 분석 방법 (A Schedulability Analysis Method for Real-Time Program)

  • 박흥복;유원희
    • 한국정보처리학회논문지
    • /
    • 제2권1호
    • /
    • pp.119-129
    • /
    • 1995
  • 본 논문에서는 분산 실시간 프로그램의 스케줄가능성 분석 방법을 제안한다. 스케 줄가능성 분석을 위한 여러 가지 방법이 개발되었지만, 이 방법들은 가능한 모든 상 태공간을 추적하거나 고정 우선순위 스케줄 방법을 사용했기 때문에 지수적인 시간 과 공간의 복잡성을 야기한다. 따라서 상태 공간을 줄여서 더 이른 시간단위에서 스케 줄가능성을 조사하는 방법이 필요하다. 본 논문에서 제시한 스케줄가능성 분석 방법은 번역시간에 결정될 수 있는 프로세스들의 최대 수행시간, 주기, 마감시간, 동기화 시 간을 고려하여 동기화 동작 이후에 남는 계산시간과 마감시간의 차이를 계산하여 실시 간 프로세스가 마감시간을 지키는가를 판단하는 새로운 알고리즘을 제안하고, 실험을 통하여 그 성능을 평가한다. 실험에 의하여 Fredette의 방법과 비교하면 약 50퍼센트 정도 더 이른 단위시간에 스케줄이 불가능함을 판단할 수 있다.

  • PDF

TCPN을 이용한 실시간 시스템의 스케쥴가능성 분석 및 회복기법 (A Schedulability analysis and Recovery Technique of Real-Time System using TCPN)

  • 김춘배;박흥복
    • 한국정보처리학회논문지
    • /
    • 제6권10호
    • /
    • pp.2797-2808
    • /
    • 1999
  • Timing Constraint Petri Nets(TCPN) extend petri nets by adding timing constraints, it is provide a formal method for the modeling and analysis of real-time system. A real-time schedulability analysis decide that a set of concurrent processes will always meet its deadline. In this paper, we present TCPN model for real-time system include timing constraints and propose a schedulability analysis algorithm using them. Also, When the TCPN model is unscheduleable under the imposed timing constraints, we propose a recovery technique that will be scheduleable by the system specification modifying or timing constraints relaxing in the optimized time.

  • PDF

실시간 태스크 그룹과 데드라인 태스크의 동시 지원을 위한 리눅스 스케줄링 가능성 분석 개선 (Improvement of Linux Schedulability Analysis for Simultaneous Support of Real-Time Task Groups and Deadline Task)

  • 임인구;진현욱;이상헌
    • 정보과학회 컴퓨팅의 실제 논문지
    • /
    • 제23권7호
    • /
    • pp.452-457
    • /
    • 2017
  • 리눅스는 범용 운영체제로써 다양한 스케줄러를 지원하며, 서로 다른 스케줄러가 런타임 시에 혼재하는 상황을 허용한다. 또한, 리눅스는 Control Group(cgroup)을 활용하여 데드라인 스케줄러(SCHED_DEADLINE)를 제외한 실시간(SCHED_FIFO, SCHED_RR) 및 비실시간(SCHED_NORMAL) 스케줄러 정책을 따르는 태스크들에 대해서 그룹 단위의 CPU 자원 예약을 지원한다. cgroup은 스케줄링 가능성 분석을 수행하여 예약된 CPU 자원을 최대한 보장하려고 한다. 하지만 현재 리눅스의 실시간 태스크 그룹에 대한 스케줄링 가능성 분석은 데드라인 태스크와 실시간 태스크를 구분하지 못하는 문제에 의해서 두 스케줄러를 사용하는 태스크가 혼재할 때 실시간 태스크 그룹의 자원예약을 거부하는 경우가 발생한다. 본 논문은 리눅스 cgroup의 실시간 태스크 그룹에 대한 스케줄링 가능성 분석에서 발생하는 문제를 분석하고, 이를 해결하는 커널 패치를 제안한다.