微信服务号

微信订阅号

2025-4-4- 7
Home > Archive>Volume 12, Issue 2, 2001 >298-302
PDF HTML XML Export Cite reminder
An Improved Schedulability Analysis Algorithm of Hard Real-Time Distributed System
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [8]
    • |
  • Related [20]
    • |
  • Cited by [2]
    • | |
  • Comments
    Abstract:

    The holistic theory is a useful approach for assessing the schedulability of hard real-time distributed systems. In this paper, an improvement on the holistic algorithm is proposed. Original holistic analysis has been extended to make it more generalized. Some real-time applications are also tested and analyzed based on research background of an hard real-time distributed information processing system. The experimental result illustrates that the worst-case response time of each task generated by new algorithm is more accurate and valid.

    Reference
    [1] Liu, C.L., Layland, J. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 1973,20(1):46～61.
    [2] Leung, J., Whitehead, J. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 1982,2(4):237～250.
    [3] Lehoczky, J., Sha, L., Ding, Y. The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Locke, D. ed. Proceedings of the 10th IEEE Real-Time Systems Symposium. Los Alamitos, CA: IEEE Computer Society Press, 1989. 166～171.
    [4] Lehoczky, J. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Vista, L.B. ed. Proceedings of the 11th IEEE Real-Time Systems Symposium. Los Alamitos, CA: IEEE Computer Society Press, 1990. 201～209.
    [5] Tindell, K., Clark, J. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming, 1994,50(2):117～134.
    [6] Tindell, K. Using offset information to analysis static priority pre-emptively scheduled task sets. Technical Report, Department of Computer Science, University of York, 1992.
    [7] Sun, Jun. Fixed-Priority end-to-end scheduling in distributed real-time systems [Ph.D. Thesis]. University of Illinois, 1997.
    [8] 胡华平,金士尧,王维.分布式实时系统的高可靠性研究与实现.计算机研究与发展,1998,35(9):841～845.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

毛羽刚,张拥军,金士尧,胡华平.一种改进的分布强实时系统可调度性分析算法.软件学报,2001,12(2):298-302

Copy
Share
Article Metrics
  • Abstract:3517
  • PDF: 4635
  • HTML: 0
  • Cited by: 0
History
  • Received:April 21,1999
  • Revised:November 23,1999
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032727Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063