Published March 28, 2011
| Version v1
Journal article
Open
Least Slack Time Rate first: an Efficient Scheduling Algorithm for Pervasive Computing Environment
Creators
- 1. Korea Institute of Science and Technology Information, Daejeon, Republic of Korea
- 2. Chosun University, Gwangju, Republic of Korea
- 3. Chosun University, Gwangju,
Description
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.
Files
jucs_article_29943.pdf
Files
(269.5 kB)
Name | Size | Download all |
---|---|---|
md5:85f8a5cf894a77cdd62eec463425c0ce
|
269.5 kB | Preview Download |