Journal of Institute of Control, Robotics and Systems (제어로봇시스템학회논문지)

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Optimal Period and Priority Assignment Using Task & Message-Based Scheduling in Distributed Control Systems

분산 제어 시스템에서의 태스크와 메시지 기반 스케줄링을 이용한 최적 주기와 우선순위 할당

  • 김형육 (강원대학교 제어계측공학과) ;
  • 이철민 (강원대학교 제어계측공학과) ;
  • 박홍성 (강원대학교 전기전자정보통신공학부)
  • Published : 2002.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.

Keywords

References

  1. A. Burns, 'Preemptive priority based sheduling : An appropriate engineering appproach in Principles of real-time systems, Prentice Hall, 1994
  2. K. Ramamritham and J. A. Stankovic, 'Scheduling algorithm and operating systems support for real-time systems,' Proc. of IEEE, pp. 55-69, Jan., 1994 https://doi.org/10.1109/5.259426
  3. N. C. Audsley, A. Burns and A. J. Wellings, 'Deadline monotone scheduling theory and application,' Control Eng. Practice, vol. 1, no. 1, pp. 71-78, 1993 https://doi.org/10.1016/0967-0661(93)92105-D
  4. J. Xu and D. Parnas, 'Scheduling processes with release times, deadlines, precedence and exclusion relations,' IEEE Tr. on Software Engineering,' pp. 360-369, March, 1990 https://doi.org/10.1109/32.48943
  5. R. Gerber and S. S. Hong, 'Guaranteeing real-time requirements with resource-based calibration of periodic processes,' IEEE. Tr. on Software Engineering, 21(7), July, 1995 https://doi.org/10.1109/32.392979
  6. 홍성수, 최종호, 박홍성, '주기조정과 커널 자동 생성을 통한 다중 루프 시스템의 구현,' 제어.자동화.시스템공학 논문지, 제3권, 제2호, pp. 187-196, 4, 1997
  7. J. Y.-T. Leung and J. Whitehead, 'On complexity of fixed-proority scheduling of periodic real-time tasks,' Performance Evaluation, 2(4), pp. 237-250, December, 1982 https://doi.org/10.1016/0166-5316(82)90024-4
  8. F. Vasques and G. Juanole, 'Pre-run-time schedulability analysis in fiedbus networks,' IEEE, 1994
  9. P. Lorenz and Z. Mammeri, 'Real-time software architecture : Application to FIP filedbus,' Proc. of AARTC, pp. 415-423, 1995
  10. M. J. Johnson, 'Proof that timing requirements of the FDDI token ring protocol are satisfied,' IEEE Tr. on Communications, COM-35, no. 6, June, 1987 https://doi.org/10.1109/TCOM.1987.1096832
  11. B. Chen and W. Zhao, 'Properties of the timed token protocol,' Technical Report 92-038, Oct., Dept. of Computer Science, Taxas A&M Univ, 1992
  12. K. Tindell, H. Hansson, and A. Wellings, 'Analyzing real-time dommunications : Controller area network,' IEEE Real-time Systems Symposium, 1994 https://doi.org/10.1109/REAL.1994.342710
  13. S. Faucou, A.-M. Deplanche and J.P. Beauvais, 'Deuristic techniques for allocationg and scheduling comkunicating,' WFCS-2000, pp. 257-265, 2000 https://doi.org/10.1109/WFCS.2000.882557
  14. K. Tindell, 'Holistic schedulability analysis for distributed hard real-time systems,' Technical Report, YCS-197, Dept. of Computer Science Univ. of York, Nov., 1994
  15. J. W. Park, Y. S. Kim, S. S. Hong, M. Saksena, S. H. Noh and W. H. Kwon, 'Network conscious of distributed real-time systems,' Journal of System Architecture, pp. 131-156, 1998 https://doi.org/10.1016/S1383-7621(97)00079-9