The time characteristics of cyclic service in Profibus

Li, M.; Stoeckli, L.

doi:10.1109/wpdrts.1996.557678

Cited by 3 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the timed token protocol this only happens with asynchronous (low priority) messages, as synchronous messages transmission can only be started if they fit within the time allocated for synchronous transmission. Concerning the PROFIBUS protocol, in [20] the authors propose the use of the cyclic services to support real-time communication. In their approach these cyclic services support the polling of slaves and message deadlines are guaranteed since the token cycle time is bounded.…”

Section: Previous Relevant Workmentioning

confidence: 99%

See 1 more Smart Citation

Cycle time properties of the PROFIBUS timed-token protocol

Tovar

Vasques

1999

Computer Communications

View full text Add to dashboard Cite

Abstract.A recent trend in distributed computer-controlled systems (DCCS) is to interconnect the distributed elements by means of a multi-point broadcast network. As the network bus is shared between a number of network nodes, there is an access contention, which must be solved by the medium access control (MAC) protocol. Usually, DCCS impose real-time constraints. In essence, by real-time constraints we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. This motivates the use of communication networks with MAC protocols that guarantee bounded access and response times to message requests. PROFIBUS is a fieldbus network with a MAC protocol based on a simplified version of the timed token protocol. In this paper, we analyse PROFIBUS MAC's cycle time properties, as they are crucial to guarantee a real-time behaviour of DCCS supported by this type of fieldbus networks.

show abstract

Section: Previous Relevant Workmentioning

confidence: 99%

“…Using (20), the minimum deadline supported for each high priority stream of table 1 scenario is as shown in table 3. …”

Section: =41 Msmentioning

confidence: 99%

Cycle time properties of the PROFIBUS timed-token protocol

Tovar

Vasques

1999

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Moreover, none of these works, consider the evaluation of response time guarantees for the cyclic poll Profibus messages. This type of messages was analysed in (Li and Stoeckli, 1993). In this approach, message deadlines are guaranteed since the token cycle time is bounded.…”

Section: Introductionmentioning

confidence: 99%

Designing Real-Time Systems Based on Mono-Master Profibus-DP Networks 1

Monforte¹,

Alves²,

Tovar³

et al. 2000

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Abstract:Profibus networks are widely used as the communication infrastructure for supporting distributed computer-controlled applications. Most of the times, these applications impose strict real-time requirements. Profibus-DP has gradually become the preferred Profibus application profile. It is usually implemented as a mono-master Profibus network, and is optimised for speed and efficiency. The aim of this paper is to analyse the real-time behaviour of this class of Profibus networks. Importantly, we develop a new methodology for evaluating the worst-case message response time in systems where high-priority and cyclic low-priority Profibus traffic coexist. The proposed analysis constitutes a powerful tool to guarantee prior to runtime the real-time behaviour of a distributed computer-controlled system based on a Profibus network, where the real-time traffic is supported either by high-priority or by cyclic poll Profibus messages. Porto, Portugal, E-mail: vasques@fe.up.pt Abstract: Profibus networks are widely used as the communication infrastructure for supporting distributed computer-controlled applications. Most of the times, these applications impose strict real-time requirements. Profibus-DP has gradually become the preferred Profibus application profile. It is usually implemented as a mono-master Profibus network, and is optimised for speed and efficiency. The aim of this paper is to analyse the real-time behaviour of this class of Profibus networks. Importantly, we develop a new methodology for evaluating the worst-case message response time in systems where high-priority and cyclic low-priority Profibus traffic coexist. The proposed analysis constitutes a powerful tool to guarantee prior to runtime the real-time behaviour of a distributed computer-controlled system based on a Profibus network, where the realtime traffic is supported either by high-priority or by cyclic poll Profibus messages.

show abstract