Real-time fieldbus communications using Profibus networks

被引:125
作者
Tovar, E [1 ]
Vasques, F
机构
[1] Polytech Inst Porto, ISEP, Dept Comp Engn, P-4200 Oporto, Portugal
[2] Univ Porto, FEUP, Dept Mech Engn, P-4099 Oporto, Portugal
关键词
fieldbuses; protocols; real-time systems;
D O I
10.1109/41.808018
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper provides a comprehensive study on how to use Profibus fieldbus networks to support real-time industrial communications, that is, on how to ensure the transmission of real-time messages within a maximum bound time, Profibus is based on a simplified timed token (TT) protocol, which is a well-proved solution for real-time communication systems. However, Profibus differs with respect to the TT protocol, thus preventing the application of the usual TT protocol real-time analysis. In fact, real-time solutions for networks based on the TT protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time is always available, at each token visit, to transmit real-time messages, Conversely, with the Profibus protocol, in the worst case, only one real-time message is processed per token visit. We propose two approaches to guarantee the real-time behavior of the Profibus protocol: 1) an unconstrained low-priority traffic profile and 2) a constrained low-priority traffic profile. The proposed analysis will show that the first profile is a suitable approach for more responsive systems (tighter deadlines), while the second allows for increased nonreal-time traffic throughput.
引用
收藏
页码:1241 / 1251
页数:11
相关论文
共 15 条
[1]   GUARANTEEING SYNCHRONOUS MESSAGE DEADLINES WITH THE TIMED TOKEN MEDIUM ACCESS-CONTROL PROTOCOL [J].
AGRAWAL, G ;
CHEN, B ;
ZHAO, W ;
DAVARI, S .
IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (03) :327-339
[2]  
*CONTR AR NETW CAN, 1992, J1583 SAE CONTR AR N
[3]  
DECOTIGNIE JD, 1993, ANN TELECOMMUN, V48, P435
[4]  
*EUR STAND, 1996, 50170 EN EUR STAND
[5]  
GROW RM, 1982, P EL 82 TOK ACC PROT, P1
[6]   SCHEDULING PERIODICALLY OCCURRING TASKS ON MULTIPLE PROCESSORS [J].
LAWLER, EL ;
MARTEL, CU .
INFORMATION PROCESSING LETTERS, 1981, 12 (01) :9-12
[7]   SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT [J].
LIU, CL ;
LAYLAND, JW .
JOURNAL OF THE ACM, 1973, 20 (01) :46-61
[8]   TIME CHARACTERISTICS OF IEEE-802.4 TOKEN BUS PROTOCOL [J].
MONTUSCHI, P ;
CIMINIERA, L ;
VALENZANO, A .
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1992, 139 (01) :81-87
[9]   Worst case response time analysis of hard real-time sporadic traffic in FIP networks [J].
Pedro, P ;
Burns, A .
NINTH EUROMICRO WORKSHOP ON REAL TIME SYSTEMS, PROCEEDINGS, 1997, :3-10
[10]  
Tindell K. W., 1994, Proceedings. Real-Time Systems Symposium (Cat. No.94CH35728), P259, DOI 10.1109/REAL.1994.342710