JUCS - Journal of Universal Computer Science 17(6): 912-925, doi: 10.3217/jucs-017-06-0912
Least Slack Time Rate first: an Efficient Scheduling Algorithm for Pervasive Computing Environment
expand article infoMyunggwon Hwang‡, Dongjin Choi§, Pankoo Kim|
‡ Korea Institute of Science and Technology Information, Daejeon, Republic of Korea§ Chosun University, Gwangju, Republic of Korea| Chosun University, Gwangju

Corresponding author: Myunggwon Hwang ( gh@kisti.re.kr )

© Myunggwon Hwang, Dongjin Choi, Pankoo Kim.
This article is freely available under the J.UCS Open Content License.
Citation: Hwang M, Choi D, Kim P (2011) Least Slack Time Rate first: an Efficient Scheduling Algorithm for Pervasive Computing Environment. JUCS - Journal of Universal Computer Science 17(6): 912-925. https://doi.org/10.3217/jucs-017-06-0912
Open Access
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