Least Slack Time Rate first: New Scheduling Algorithm for Multi-Processor Environment

被引：16

作者：

Hwang, Myunggwon ^{[1
]}

Kim, Pankoo ^{[1
]}

Choi, Dongjin ^{[1
]}

机构：

[1] Chosun Univ, Dept Comp Engn, Gwangju, South Korea

来源：

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010) | 2010年

基金：

新加坡国家研究基金会;

关键词：

multi-processor scheduling; scheduling algorithm; optimal scheduling; least slack time rate; LSTR;

D O I：

10.1109/CISIS.2010.20

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Real-time systems have to complete the execution of a task within the predetermined time while ensuring that the execution results are logically correct. Such systems require scheduling methods that can adequately distribute the given tasks to a processor. Scheduling methods that all tasks can be executed within a predetermined deadline are called an optimal scheduling. In this paper, we propose a new and simple scheduling algorithm (LSTR: least slack time rate first) as a dynamic-priority algorithm for a multi-processor environment and demonstrate its optimal possibility through various tests.

引用

页码：806 / 811

页数：6