计算机科学 ›› 2010, Vol. 37 ›› Issue (4): 80-.

• 计算机网络与信息安全 • 上一篇    下一篇

基于TinyOS的HRRF调度策略

李海成   

  1. (辽东学院信息技术分院 丹东118003)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(69873007),辽宁省教育厅科学基金项目(2008212),辽宁学院科学基金项目(2009-Z03)资助。

Research on HRRF Scheduling Strategy Based on TinyOS

LI Hai-cheng   

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对传感器网络操作系统"I}inyOS采用非剥夺的先来先服务调度策略,系统紧急任务不能得到及时响应及节点吞吐量下降的情况,提出了一种可抢占HRRF(Highest Response-Ratio First)作业调度策略。HRRF算法采用对于实时性较强的任务优先调度策略,满足了系统对实时任务的响应,提高了处理器的响应速度;对于软实时任务采用高响应比(任务等待时间/需运行时间)调度策略,提高了系统的效率。在hinyOS上的测试表明,HRRF策略在不影响TinyOS原有性能的情况下极大改善了传感器网络承担实时性

关键词: TinyOS操作系统,HRRF调度策略,可抢占,余实时性

Abstract: Currently the TinyOS task scheduling is based on first comcfirst-served non-preempting strategy, which is not able to give emergency tasks quick response, and throughput of nodes is lower. To address this issue, this paper proposed a preempting algorithm, HRRF ( Highest Response-Ratio First) Algorithm. Through executing real-time tasks within an higher priority, it met system requirement for the real-time response, and improved processor' s response speed. Through executing soft real-time tasks based on Highest Response-Ratio (waited time/run time) scheduling priority strategy,system throughput was increased. The TinyOS test result indicated that under the condition of not affer ting (decreasing) the original performance, HRRF strategy greatly improved sensor network performance in working on real-time tasks.

Key words: TinyOS, HRRF algorithm, Preemptive scheduling, Real-time

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!