Workload-efficient deadline and period assignment for maintaining temporal consistency under EDF

Jianjun Li, Ming Xiong, Victor C.S. Lee, Lihchyun Shu, Guohui Li

研究成果: Article同行評審

17 引文 斯高帕斯(Scopus)

摘要

Deriving deadlines and periods for update transactions so as to maintain timeliness and data freshness while minimizing imposed workload has long been recognized an important problem in real-time database research. Despite years of active research, the state-of-the-art still has much room for improvement, particularly for periodic transactions scheduled by the Earliest Deadline First (EDF) algorithm. In this paper, we propose a practical and efficient two-phase algorithm, GEneral EDF ((G EEDF)), for assigning periods and deadlines to EDF-scheduled update transactions. Phase 1 of (G EEDF) aims at finding solutions for most inputs in linear time, based on the observation that the execution times of update transactions are relatively small compared to the validity interval lengths of real-time data objects in many real-time applications. In the remaining cases for which Phase 1 fails to derive solutions, Phase 2 is invoked by employing an existing deadline-monotonic-based algorithm, which we show is also applicable to our problem. Meanwhile, we have devised several techniques which significantly reduce the cost of schedulability test, and hence greatly improve time efficiency. Our experimental results demonstrate that (GEEDF) outperforms existing approaches in terms of generated workloads. Although Phase 2 has a pseudopolynomial time complexity, our experimental study shows that it runs much faster than other solutions with comparable quality.

原文English
文章編號6171159
頁(從 - 到)1255-1268
頁數14
期刊IEEE Transactions on Computers
62
發行號6
DOIs
出版狀態Published - 2013

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 計算機理論與數學

指紋

深入研究「Workload-efficient deadline and period assignment for maintaining temporal consistency under EDF」主題。共同形成了獨特的指紋。

引用此