Communication response time in P-NET networks: Worst-case analysis considering the actual token utilization

被引:16
作者
Tovar, E [1 ]
Vasques, F
Burns, A
机构
[1] Polytech Inst Porto, Dept Comp Engn, Oporto, Portugal
[2] Univ Porto, Dept Mech Engn, Oporto, Portugal
[3] Univ York, Dept Comp Sci, York YO1 5DD, N Yorkshire, England
关键词
real-time communication; worst-case message response time; fieldbus networks; medium access control protocols; P-NET;
D O I
10.1023/A:1014554317965
中图分类号
TP301 [理论、方法];
学科分类号
081202 [计算机软件与理论];
摘要
Fieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which distributed computer-controlled systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilized by all stations. However, such analysis can be proved to be quite pessimistic. In this paper, we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilization by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.
引用
收藏
页码:229 / 249
页数:21
相关论文
共 17 条
[1]
AGRAWAL G, 1992, INT CON DISTR COMP S, P468, DOI 10.1109/ICDCS.1992.235007
[2]
APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING [J].
AUDSLEY, N ;
BURNS, A ;
RICHARDSON, M ;
TINDELL, K ;
WELLINGS, AJ .
SOFTWARE ENGINEERING JOURNAL, 1993, 8 (05) :284-292
[3]
*CENELEC, 1996, GEN PURP FIELD COMM
[4]
THE OSI REFERENCE MODEL [J].
DAY, JD ;
ZIMMERMANN, H .
PROCEEDINGS OF THE IEEE, 1983, 71 (12) :1334-1340
[5]
Grow R, 1982, P EL 82 TOK ACC PROT
[6]
JENKINS C, 1997, 50170 EN I MEAS, V1
[7]
LENHART G, 1993, ADV INSTRUM, V48, P357
[8]
SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT [J].
LIU, CL ;
LAYLAND, JW .
JOURNAL OF THE ACM, 1973, 20 (01) :46-61
[9]
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
[10]
*P NET, 1994, P NET STAND