By Topic

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tovar, E. ; Dept. of Comput. Eng., Polytech. Inst. of Porto, Portugal ; Vasques, F. ; Burns, A.

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed priority-based dispatching mechanisms at each master's application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model raises several issues well known within the real-time systems community. Message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks

Published in:

Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on

Date of Conference: