DocumentCode
2181608
Title
Research on TinyOS Scheduling Strategy Based on SJP
Author
Liu, Jianhui
Author_Institution
Inf. Technol. Coll., Eastern Liaoning Univ., Dandong, China
Volume
1
fYear
2010
fDate
29-31 Oct. 2010
Firstpage
144
Lastpage
146
Abstract
Aiming at the status that the TinyOS job scheduling uses the non-privative first-come-first-served policy, the system emergency jobs can´t get quick response, and its node throughput decreases, this paper proposes a new preempting algorithm, Short Job Priority (SJP): through executing hard real-time job within absolute time deadline to meet the requirements of the system response to the real-time job, and improve the processor´s response speed; By means of executing soft real-time job based on short job priority strategy, the system throughput is increased. The TinyOS test results indicated that without affecting the original performance of TinyOS, the SJP strategy greatly improved the running effect of the sensor when it undertakes net real-time jobs.
Keywords
operating systems (computers); processor scheduling; SJP strategy; TinyOS job scheduling; hard real-time job; node throughput; nonprivative first-come-first-served policy; processor response speed; short job priority; soft real-time job; system emergency job; system response; system throughput; time deadline; Data structures; Energy consumption; Real time systems; Schedules; Scheduling; Throughput; Wireless sensor networks; SJP schedulilng strategy; TinyOS operating system; preemptible; time deadline;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Design (ISCID), 2010 International Symposium on
Conference_Location
Hangzhou
Print_ISBN
978-1-4244-8094-4
Type
conf
DOI
10.1109/ISCID.2010.53
Filename
5692684
Link To Document