Advertisement

A Period Assignment Algorithm for Real-Time System Design

  • Minsoo Ryu
  • Seongsoo Hong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1579)

Abstract

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [3].

Given a task graph design allowing producer/consumer relationships among tasks [4], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a polynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

Keywords

Task Graph Nonlinear Optimization Problem Optimal Utilization Task Execution Time Range Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    T. F. Abdelzaher, E. M. Atkins, and K. G. Shin. QoS negotiation in real-time systems and its application to automated flight control. In Proceedings of IEEE Real-Time Technology and Applications, pages 228–238, December 1997.Google Scholar
  2. 2.
    V. A. F. Almeida, I. M. Vasconcelos, J. N. C. Arabe, and D. A. Menasce. Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems. In Proceedings of Supercomputing, pages 683–691, 1992.Google Scholar
  3. 3.
    R. Gerber, S. Hong, and M. Saksena. Guaranteeing real-time requirements with resource-based calibration of periodic processes. IEEE Transactions on Software Engineering, 21(7):579–592, July 1995.CrossRefGoogle Scholar
  4. 4.
    K. Jeffay. The real-time producer/consumer paradigm: A paradigm for the construction of Efficient, predictable real-time systems. In ACM/SIGAPP Symposium on Applied Computing, pages 796–804. ACM Press, February 1993.Google Scholar
  5. 5.
    J. Lehoczky, L. Sha and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of IEEE Real-Time Systems Symposium, pages 166–171, December 1989.Google Scholar
  6. 6.
    C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46–61, January 1973.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    C. Park and A. Shaw. Experimenting with a program timing tool based on source-level timing schema. In Proceedings of IEEE Real-Time Systems Symposium, pages 72–81, December 1990.Google Scholar
  8. 8.
    R. Rajkumar, C. Lee, J. Lehoczky, and D. Siewiorek. A resource allocation model for QoS management. In Proceedings of IEEE Real-Time Systems Symposium, pages 298–307, December 1997.Google Scholar
  9. 9.
    D. Seto, J. P. Lehoczky, L. Sha, and K. G. Shin. On task schedulability in real-time control systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 13–21, December 1996.Google Scholar
  10. 10.
    M. Y. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 1(3):330–343, July 1990.CrossRefGoogle Scholar
  11. 11.
    J. Xu and D. Parnas. Scheduling processes with release times, deadlines, precedence and exclusion relations. IEEE Transactions on Software Engineering, 16(3):360–369, March 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Minsoo Ryu
    • 1
  • Seongsoo Hong
    • 1
  1. 1.School of Electrical Engineering and ERC-ACISeoul National UniversitySeoulKorea

Personalised recommendations