본문 바로가기
  • Home

L-RE Coordinates Algorithm for Task Scheduling in Real-time Multiprocessor System

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2007, 12(3), pp.147-154
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

황월 1 Yong-Soo Kim 1

1경원대학교

Accredited

ABSTRACT

Task scheduling is an essential part of any computer system for allocating tasks to a processor of the system among various competitors. As we know, in real-time system, the failure of scheduling a hard real-time task may lead to disastrous consequence. Besides efficiency, resource and speed, real-time system has to take time constraint in serious consideration. This paper proposes a priority-driven scheduling algorithm for real-time multiprocessor system, which is called L-RE coordinates algorithm. L-RE coordinates is a new way of describing the task scheduling problem. In the algorithm, we take both deadline and laxity into consideration for allocating the priority. The simulation result shows that the new algorithm is viable and performance better than EDF and LLF algorithm on schedulability and context switch respectively.

Citation status

* References for papers published after 2023 are currently being built.