Scheduling real-time communications with P-NET

Tovar, Eduardo; Vasques, Francisco

doi:10.1049/ic:19980530

Cited by 4 publications

(1 citation statement)

References 6 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, having defined T cycle , it is possible to set the T TR parameter in order to satisfy the pre-run-time schedulability condition (12). Considering that T cycle is the upper bound of the real token rotation time (T RR ), we must reason about T RR in order to evaluate the value of T cycle .…”

Section: Cycle Time Evaluationmentioning

confidence: 99%

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

Tovar

Vasques

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we survey the most relevant results for the priority--based schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages' response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

show abstract

Section: Cycle Time Evaluationmentioning

confidence: 99%

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

Tovar

Vasques

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

On design and formal verification of SNSP: a novel real-time communication protocol for safety-critical applications

Zhou

Min

et al. 2014

J Supercomput

View full text Add to dashboard Cite

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Tovar

Vasques

Burns

1999

Control Engineering Practice

View full text Add to dashboard Cite

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a "eldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-runtime schedulability conditions for supporting real-time tra$c with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can signi"cantly reduce the end-to-end communication delays for messages with stringent timing requirements.

show abstract

Scheduling real-time communications with P-NET

Cited by 4 publications

References 6 publications

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

On design and formal verification of SNSP: a novel real-time communication protocol for safety-critical applications

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Contact Info

Product

Resources

About