download0 view182
twitter facebook

공공누리This item is licensed Korea Open Government License

Title
Least Slack Time Rate First: an Efficient Scheduling Algorithm for Pervasive Computing Environment
Author(s)
황명권
Publication Year
2011-03-28
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.
Keyword
Least Slack Time Rate; Multi-processor scheduling; pervasive computing environment; scheduling algorithm
Journal Title
J.UCS : the journal of universal computer science
Citation Volume
17
ISSN
0948-695x
Files in This Item:
There are no files associated with this item.
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
URI
https://repository.kisti.re.kr/handle/10580/13964
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART73223695
Export
RIS (EndNote)
XLS (Excel)
XML

Browse