International Journal of Automotive Technology

The Korean Society of Automotive Engineers (한국자동차공학회)
권호 표지

OPTIMAL PERIOD AND PRIORITY ASSIGNMENT FOR A NETWORKED CONTROL SYSTEM SCHEDULED BY A FIXED PRIORITY SCHEDULING SYSTEM

  • Shin, M. (ACE Lab, Hanyang University) ;
  • SunWoo, M. (Department of Automotive Engineering, Hanyang University)
  • Published : 2007.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

Keywords

References

  1. Audsley, N. (1991). Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. University of York, Department of Computer Science, Report No. YCS 164
  2. Audsley, N., Burns, A. and Richardson, A. J. (1991). Hard real-time scheduling: the deadline monotonic approach. Proc. 8th IEEE Workshop on Real-Time Systems Operating Systems and Software, Atlanta, Georgia, USA, 166-171
  3. Audsley, N., Burns, A., Tindell, K., Richardson, M. and Wellings, A. (1993). Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering J. 8, 5, 284-292 https://doi.org/10.1049/sej.1993.0034
  4. Choi, J., Shin M. and Sunwoo, M. (2004). Development of time analysis tool for distributed real-time control system. Int. J. Automotive Technology 5, 4, 269-276
  5. Davis, L. (1985). Applying adaptive algorithms to epistatic domains. Proc. Int. Joint Conf. Artificial Intelligence, Los Angeles, California, USA, 162-164
  6. Davis, R. and Burns, A. (1995). Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems. Information Processing Letters 53, 5, 249-254 https://doi.org/10.1016/0020-0190(94)00200-I
  7. Faucou, S., Deplanche, A. and Beauvais, J. (2000). Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems. 2000 IEEE Int. Workshop on Factory Communication Systems, Proto, Portugal, 257-265
  8. Garcia, J. and Harbour, M. (1995). Optimized priority assignment for tasks and messages in distributed hard real-time systems. Proc. 3rd Workshop on Parallel and Distributed Real-Time Systems, Santa Barbara, California, USA, 124-132
  9. Gen, M. and Cheng, R. (2000). Genetic Algorithms & Engineering Optimization. Wiley-Interscience
  10. Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press
  11. Kai, M. and Shimada, M. (1999). Task scheduling algorithms based on heuristic search taking account of communication overhead. 1999 IEEE Pacific Rim Conf. Communication, Computers and Signal Processing, Victoria, British Columbia, Canada, 154-150
  12. Kai, M. and Hatori, T. (2001). Parallelized search for the optimal/sub-optimal solutions of task scheduling problem taking account of communication overhead. 2001 IEEE Pacific Rim Conf. Communication, Computers and Signal Processing, Victoria, British Columbia, Canada, 327-330
  13. Kopetz, H. (1997). Real-time Systems, Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers. Boston
  14. Lee, W. and Sunwoo, M. (2003). A study on timing model and analysis of LIN protocol. Proc. Spring Conf., Korean Society of Automotive Engineers, 952-957
  15. Lehoczky, J., Sha, L. and Ding, Y. (1989). The rate monotonic scheduling algorithm: exact characterization and average case behavior. Proc. 10th IEEE Real-Time Systems Symp., Santa Monica, California, USA, 166-171
  16. Liu, C. and Layland, J. (1997). Scheduling algorithms for multiprogramming in a hard-teal-time environment. J. Association for Computing Machinery 20, 1, 46-61
  17. McDowell, M. (1991). Priority-based scheduling of scarce resources. 1991 IEEE Aerospace Applications Conf., Crested Butte, Colorado, USA
  18. Sha, L., Rajkumar, R. and Lehoczky, J. (1990). Priority inheritance protocols: An approach to real-time synchronization, IEEE Trans. Computers 39, 9, 1175-1185 https://doi.org/10.1109/12.57058
  19. Shin, M., Lee, W. and Sunwoo, M. (2005). Optimal period selection to minimize the end-to-end response time. Int. J. Automotive Technology 6, 1, 71-77
  20. Surma, D., Sha, E. and Kogge, P. (1998). Compile-time priority assignment and re-routing for communication minimization in parallel systems. Proc. 1998 IEEE Int. Symp. Circuits and Systems, Monterey, California, USA, 486-489
  21. Tindell, K. and Hansson, H. (1996). Real-time Systems by Fixed Priority Scheduling. Technical Report, Department of Computer Science. Uppsala University
  22. Tindell, K. (1994). Fixed Priority Scheduling of Hard Real-time Systems. Ph. D. Dissertation. Department of Computer Science. University of York. Heslington, UK
  23. Tindell, K., Burns, A. and Wellings, A. (1992). Allocating real-time tasks: An NP-hard problem made easy. Real-Time Systems J. 4, 2, 133-151