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

Authors:
Myunggwon Hwang;Dongjin Choi;Pankoo Kim
Affiliations:
-;-;-
Venue:
CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Year:
2010

Citing 0
Cited 1

Design and Implementation of a Scalable RFID-Based Attendance System with an Intelligent Scheduling Technique

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.