A Schedulability Analysis and Implementation of Distributed Real-Time Processes

분산 실시간 프로세스의 스케줄가능성 분석 및 구현

  • 박흥복 (부경대학교 컴퓨터 멀티미디어 공학부) ;
  • 김춘배 (부경대학교 대학원 전자계산학과)
  • Published : 1999.03.01


Several approaches to anlayzing real-time schedulability have been presented, but since these used a fixed priority scheduling scheme and/or traverse all possible state spaces, there take place exponential time and space complexity of these methods. Therefore it is necessary to reduce the state space and detect schedulability at earlier time. This paper proposes and implements an advanced schedulability analysis algorithm to determine that is satisfied a given deadlines for real-time processes. These use a minimum execution time of process, periodic, deadline, and a synchronization time of processes to detect schedulability at earlier time and dynamic scheduling scheme to reduce state space using the transition rules of process algebra. From a result of implementation, we demonstrated the effective performance to determine schedulability analysis.