期刊文献+

混合实时事务的延期单调速率调度算法及其可调度性分析 被引量:2

A Deferred Rate Monotonic Scheduling Algorithm and Schedulability Analysis for Hybrid Real-Time Transactions
下载PDF
导出
摘要 对于含有实时和非实时两部分的混合实时应用 ,传统的单调速率调度算法 (RM)已不再适用 .为此 ,该文引入“混合实时事务”的概念 ,并针对这类事务提出一种延期单调速率调度算法 (DRM) ;着重分析了DRM算法对混合实时事务的可调度性 ;进行了实验测试与性能分析比较 .结果表明 ,事务集中混合实时事务占的比例越高 ,混合事务中非实时子事务占的比例越大 ,该算法的CPU使用率阈值就越高 ,且在各种情况下 ,DRM算法与RM算法相比性能都更优 ,最低情况也与之一样 . For a kind of hybrid real time applications consisting of both real time and non real time parts, the traditional Rate Monotonic Scheduling Algorithm (RM) is no longer suitable. Therefore, based on the split transaction model, this paper introduces the concept of hybrid real time transaction, under which each transaction is divided into hard real time subtransaction(s) and non real time subtransaction(s). All of the hard real time subtransactions of hybrid transactions and other hard real time transactions together form a real time transaction set in the system, while all of the non real time subtransactions of hybrid transactions and other non real time transactions in the system compose the non real time transaction set. The transactions in the non real time set can expire without matter and thus may be scheduled with any scheduling algorithm. For the hybrid real time transactions, authors propose a new scheduling algorithm, called Deferred Rate Monotonic scheduling Algorithm (DRM). In the paper, the algorithm and the schedulability of the DRM for real time transactions with static priorities are discussed with emphases. Finally, the performance of the DRM algorithm is experimentally examined and compared with the RM algorithm based on the rate of CPU utilization in detail. The experiments show that in any case, the performance of the DRM algorithm is better than that of the RM algorithm for hybrid real time transactions,and even in the extreme case of full hard real time transactions,they are also the same.
出处 《计算机学报》 EI CSCD 北大核心 2004年第3期289-294,共6页 Chinese Journal of Computers
基金 国家自然科学基金 (6 0 0 730 4 5) 预研项目基金 (JW0 52 9) "十五"预研项目基金 (J1 5.3.3)资助
关键词 实时数据库 事务处理 延期单调速率调度算法 可调度性分析 混合实时事务 scheduling algorithm deferred rate monotonic scheduling algorithm hybrid real time transaction schedulability analysis
  • 相关文献

参考文献7

  • 1[1]Liu C.L., Layland J.W.. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 1973, 20(1): 40~61
  • 2[2]Lehoczky J.P., Sha L., Ding Y.. The rate-monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of Real-Time Systems Symposium, 1989, 166~171
  • 3[3]Harbour M.G., Klein M.H., Lehoczky J.P.. Timing analysis for fixed-priority scheduling of hard-time systems. IEEE Transactions on Software Engineering, 1994, 20(1): 13~28
  • 4[6]Gavin L.. Scheduling-oriented models for real-time. The Computer Journal, 1995, 38(6):443~456
  • 5[7]Robert A., Hector G.M.. Scheduling real-time transactions. ACM SIGMOD Record, 1988, 17(1): 71~81
  • 6[8]Lee C.G., Hahn J., Seo Y.M.. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on Computers, 1998, 47(6): 700~713
  • 7[9]Susan V.V., Sasa T.. Satisfying temporal consistency constraints of real-time databases. The Journal of Systems and Software,1999, 45(1): 45~60

同被引文献18

  • 1Baker T P.Stack-based scheduling of real-time processes[J].Real-Time Systems, 1991 ;3 ( 1 ) : 67- 100.
  • 2Baruah S K,Howell R R,Rosier L E.Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor[J].Real-Time Systems, 1990 ; (2) : 173- 179.
  • 3Baruah S K,Mok A K,Rosier L E.Preemptively scheduling hard-real-time sporadic tasks on one processor[C].In:Proceedings of the 11th IEEE Real-Time Systems Symposium, 1990 : 182-190.
  • 4K Jeffay,D L Stone.Accounting for Interrupt Handling Costs in Dynamic Priority Task Systems[C].In:Proceedings of IEEE Real-Time Systems Sympsium, 1993 : 212-221.
  • 5G C Buttazzo,G Lipari.Scheduling Analysis of Hybrid Real-Time Task Sets[C],In:Proceedings of the 9th IEEE Euromicro Workshop on Real-Time Systems ,Toledo ,Spain, 1997:200-206.
  • 6T P Baker.Stack-based Scheduling of Real-Time Processes[J].The Journal of Real-Time Systems, 1991 ;3(1 ) :76-100.
  • 7Spuri M,G Butazzo.Scheduling aperiodic tasks in dynamic priority systems[J].Real-Time Systems Journal, 1996; (10) : 179-210.
  • 8Audsley N C,Bums A,Davis R.Fixed priority preemptive scheduling:an historical perspective[J].Real Time Systems, 1995;8(3):173-198.
  • 9Sha L,Goodenough J,Real-time scheduling theory and Ada[J],IEEE Computer, 1990 - 23 (4) : 54-62.
  • 10On the complexity of fixed-priority scheduling of periodic,real-time tasks[J].Performance Evaluation, 1990;2(4) :237-250.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部