KONTROL ALAN AĞLARI İÇİN OPTİMUM STATİK MESAJ ZAMANLAMASI

Kontrol Alan Ağı (CAN), yüksek performanslı ve yüksek güvenilirliği olan gerçek zamanlı bir haberleşme protokolüdür. Bu çalışmada, SocketCAN ile bir CAN ağı tasarlanmış ve RM algoritması kullanılarak optimum statik mesaj zamanlaması gerçekleştirilmiştir. SocketCAN, Linux işletim sistemi için geliştirilen bir CAN uygulamasıdır. CAN ağının performansı, öncelik karar mekanizmasına göre belirlenen zamanlamaya bağlıdır. Optimum iletim için anahtar faktör, mesaj önceliklerinin belirlenmesidir. RM zamanlama politikasına göre, iletilecek olan mesajların öncelikleri iletim başlamadan önce belirlenir ve bir mesajın son teslim süresi (deadline), periyoduna eşittir. En erken son teslim süresi olan mesaj, en yüksek önceliği alır.
Anahtar Kelimeler:

CAN, Statik Zamanlama, SocketCAN

OPTIMUM STATIC MESSAGE SCHEDULING FOR CONTROLLER AREA NETWORKS

Controller Area Network (CAN) is a real-time communication protocol with high performance and high reliability. In this paper, a CAN network was designed with the SocketCAN and optimum static message scheduling was realized with using the RM algorithm. SocketCAN is a CAN implementation developed for the Linux operating system. The performance of the CAN network depends on the scheduling determined by the priority decision mechanism. The key factor for optimum message transmission is to determine message priorities. According to the RM scheduling policy, the priorities of the messages are determined before the transmission starts and deadline of a message is equal to its period. The message with the earliest deadline has the higher the priority.    

___

  • Anwar, K., Khan, Z.A., 2007. Dynamic Priority Based Message Scheduling on Controller Area Network. Proceedings of International Conference on Electrical Engineering (ICEE), 1–6 April.
  • Aysan, H., Thekkilakattil, A., Dobrin, R., Punnekkat, S., 2010. Efficient fault tolerant scheduling on controller area network (CAN). 15th International Conference on Emerging Technologies and Factory Automation, 13-16 September.
  • Bini, E., Buttazzo, G.C., 2004. Schedulability analysis of periodic fixed priority systems. IEEE Transactions on Computers, 53(11), 1462-1473.
  • Bosch, R., CAN Specification Version 2.0, Stuttgart, Germany, 1991.
  • Chen, M., Yen, H.W., 2012. An Online RBF Network Approach for Adaptive Message Scheduling on Controller Area Networks. Journal of Information Science and Engineering, 28, 503-519.
  • Davis, R., Burns, A., Bril, R.J., Lukkien, J.J., 2007. Controller Area Network (CAN) Schedulability Analysis: Refuted Revisited and Revised. Real-Time Systems, 35(3), 239-272.
  • Dobrin, R., Fohler, G., 2001. Implementing off-line message scheduling on controller area network (CAN). Proceedings of Emerging Technologies and Factory Automation. Antibes-Juan Les Pins, 241-245.
  • Ercek, E., Erdoğdu, S., Uluat, M. F., 2005. Gerçek Zamanlı Sistemlerde UML Uygulamaları. EMO II. İletişim Teknolojileri Ulusal Sempozyumu, Adana.
  • Farsi, M., Ratcliff, K., Barbosa, M, 1999. An overview of controller area network, Computing & Control Engineering Journal, 10(3), 113-120.
  • Fohler, G., Lenvall, T., Buttazzo, L.G., 2001. Improved Handling of Soft Aperiodic Tasks in Offline Scheduled Real-Time Systems using Total Bandwidth Server, 8th IEEE International Conference on Emerging Technologies and Factory Automation, 15-18 October, France, 151-157.
  • Github, 2010. https://github.com/rhyttr/SocketCAN/ commit/ db198f35c3e9ab17c62 ed63d238f1c4afa9acb19.
  • Github, 2017. https://github.com/rhyttr/SocketCAN.
  • Harkut, D.G., Ali, M.S., Lohiya, P., 2014. Real-time scheduling algorithms for wireless sensor network. Circuits and Systems: An International Journal CSIJ, 1(1), 11-18.
  • Liu, C.L., Layland, J.W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM, 20(1), 46–61.
  • Livani, M.A., Kaiser, J., Jia, W.J., 1998. Scheduling Hard and Soft Real-Time Communication in The Controller Area Network (CAN). Proceedings of the 23rd IFAC Workshop on Real-Time Programming, June, 13-18, China.
  • Michta, E., 2005. Scheduling Systems. Sydenham, P.H., Thorn, R., (Ed.), Handbook of Measuring System Design, John Wiley and Sons, 1648p.
  • Mutka, M.W., 1994. Using Rate Monotonic Scheduling Technology for Real-Time Communications in a Wormhole Network. Proc. Second Workshop on Parallel and Distributed Real-Time Systems, Cancun, Mexico, 194-199.
  • Natale, M.D,. 2000. Scheduling the CAN Bus with Earliest Deadline Techniques. In Proceedings of the 21st IEEE Real-Time Systems Symposium, December 2000, 259–268.
  • Oliveira, M.P., Fernandes, A.O., Campos, S.V.A., Zuquim, A.L.A.P., Mata, J.M., 2003. Guaranteeing Fault Tolerance through Scheduling on a CAN bus. The International CAN Conference (ICC2003), 15-22.
  • Rouhifar, M., Ravanmehr, R., 2015. A Survey on Scheduling Approaches for Hard Real-Time Systems. International Journal of Computer Applications, 131(17), 41-48.
  • Shinde, V., Biday, S.C., 2017. Comparison of Real Time Task Scheduling Algorithms. International Journal of Computer Applications, 158(6), 37-41.
  • Shokry, H., Shedeed, M., Hammad, S., Shalan, M., Wahdan, A., 2009. Hardware EDF scheduler implementation on controller area network controller. In Proceedings of 4th International IEEE Design and Test Workshop (IDT) 2009, Riyadh, Saudi Arabia.
  • Sojka, M., Píša, P., Petera, M., Špinka, O., Hanzálek, Z., 2010. A Comparison of Linux CAN Drivers and their Applications. 5th IEEE International Symposium on Industrial Embedded Systems (SIES), 7-9 July, 18-27.
  • Sojka, M., Píša, P., Hanzálek, Z., 2014. Performance evaluation of Linux CAN-related system calls. 10th IEEE Workshop on Factory Communication Systems (WFCS 2014), 5-7 May, Toulouse, France, 1-8.
  • Tindell K., Burns A., Wellings A.,. Calculating Controller Area Network (CAN) Message Response Times. University of York, Department of Computre Science, York, England, 1994.
  • Zuberi, K.M., Shin, K.G., 2000. Design and implementation of efficient message scheduling for controller area network. IEEE Transactions on Computers, 49(2), 182-188.