Multicycle Polling Scheduling Algorithms for FieldBus Networks

Real-Time Systems

Volumn 25, Issue 2-3, 2003, Pages 157-185

  Cavalieri, Salvatore ^a   Monforte, Salvatore ^a   Corsaro, Angelo ^b   Scapellato, Giovanni ^c  

^a UNIVERSITY OF CATANIA   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Ericsson Telecomunicazioni SpA   (Italy)

Author keywords

Earliest deadline first algorithm; FieldBus communication networks; Hard real time scheduling; Priority scheduling algorithm; Rate monotonic algorithm

Indexed keywords

ALGORITHMS; BANDWIDTH; COMMUNICATION SYSTEMS; PROBLEM SOLVING; SCHEDULING;

FIELDBUS NETWORKS; MULTICYCLE POLLING SCHEDULING;

TELECOMMUNICATION NETWORKS;

EID: 0141607254     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025167907933     Document Type: Article

References (20)

1. Azevedo, J. 1996. The WorldFIP Protocol. WorldFIP Organisation.
2. CENELEC, EN50170.2 1996. General Purpose Field Communication System. Part 2: Profibus.
3. CENELEC, EN50170.3 1996. General Purpose Field Communication System. Part 3: WorldFIP.
4. CENELEC, EN50325 1999. Industrial Communication Subsystem based on ISO 11898 (CAN) for Controller-Device interfaces. Parts 1-2-3.
5. CENELEC, EN50254.2 1999. High Efficiency Communication Subsystem for Small Data Packages. Part 2: Interbus-S.
6. Decotignie, J. D., and Pleinevaux, P. 1988. Time Critical Communication Networks: Field Buses, IEEE Network 2(3).
7. Decotignie, J. D., and Pleinevaux, P. 1993. A survey on industrial communication networks. Annales des Telecommunications 48: 9-10.
8. IEC, 61158.2 1992. FieldBus Specification, Physical Layer Specification and Service Definition.
9. IEC, 61158.3 2000. FieldBus Specification, Data Link Layer Service Definition.
10. IEC, 61158.4 2000. FieldBus Specification, Data Link Layer Protocol Definition.
11. IEC, 61158.5 2000. FieldBus Specification, Application Layer Service Definition.
12. IEC, 61158.6 2000. FieldBus Specification, Application Layer Protocol Definition.
13. Lehoczky, J. P., Sha, L., and Ding Y. 1989. The rate monotonic scheduling algorithm: exact characterization and average case behaviour. In Proceedings of the 10th IEEE Real-time System Symposium, pp. 166-171.
14. Lehoczky, J. P., Sha, L., Strosnider, J. K., and Tokuda, H. 1992. Fixed priority scheduling theory for hard real-time systems. Foundations of real-time computing: scheduling and resource management. Kluwer Academic Press.
15. Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery 20(1): 46-61.
16. Raja, P., and Noubir, G. 1993. Static and dynamic polling mechanisms for FieldBus networks. ACM Operating System Review 27(1): 34-45.
17. Raja, P., Ruiz, L., and Decotignie, J. D. 1995. On the necessary real-time conditions for the producer-distributer-consumer model. In Proceedings of WFCS 1995, pp. 125-133.
18. Raja, P., Vijaynanda, K., and Decotignie, J. D. 1993. Polling algorithms and their properties for fieldbus network. In Proceedings of IECON 1993, pp. 530-534.
19. Tovar, E., and Vasques, F. 1999. Using WorldFIP to support periodic and sporadic real-time traffic. In Proceedings of the IECON 1999, pp. 1216-1221.
20. Xu, J., and Parnas, D. L. 1993. On satisfying timing constraints in hard-real-time systems. IEEE Transactions on Software Engineering 19(1).