A Real-Time Scheduling Mechanism in Multiprocessor System for Supporting Multimedia

멀티미디어 지원을 위한 다중 프로세서 시스템에서 실시간 스케줄링 기법

  • 임순영 (군산대학교 정보통신공학과) ;
  • 이재완 (군산대학교 정보통신공학과) ;
  • 전칠환 (군산대학교 전기공학과)
  • Published : 1997.12.01


This paper presents a mechanism which supplies tasks with fast turn-around time on real-time multimedia environments. Tasks are classified into periodic and aperiodic tasks according to their executing period, and the types of them are classified into three groups : critical tasks, essential tasks and common tasks by the degree of its urgency. In the case of periodic tasks, we defer the execution of it within the extent to keep the deadline as long as possible and serve the aperiodic tasks, and provide aperiodic tasks with fast turn-around time. Changing the priority of each task is allowed within the same type and it is scheduled by using the dynamic priority. The emergency tasks are executed within deadline in any circumstances, and the least laxity one is served first when many real-time tasks are waiting for execution. The result of simulation shows that the proposed mechanism is better than the EDZL, known as suboptimal in multiprocessor systems, in the point of rum-around time.