Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 17 / Issue 6

available in:   PDF (263 kB) PS (215 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-017-06-0912


Least Slack Time Rate first: an Efficient Scheduling Algorithm for Pervasive Computing Environment

Myunggwon Hwang (Korea Institute of Science and Technology Information, South Korea)

Dongjin Choi (Chosun University, South Korea)

Pankoo Kim (Chosun University, South Korea)

Abstract: Real-time systems like pervasive computing have to complete executing a task within the predetermined time while ensuring that the execution results are logically correct. Such systems require intelligent scheduling methods that can adequately promptly distribute the given tasks to a processor(s). In this paper, we propose LSTR (Least Slack Time Rate first), a new and simple scheduling algorithm, for a multi-processor environment, and demonstrate its efficient performance through various tests.

Keywords: Least Slack Time Rate First, Multi-processor scheduling, Pervasive computing environment, scheduling algorithm

Categories: C.1, C.2