Non pre-emptive scheduling of messages on SMTV token-passing networks

Authors:
Eduardo Tovar;Francisco Vasques
Affiliations:
Department of Computer Engineering, ISEP, Polytechnic Institute of Porto, Portugal;Department of Mechanical Engineering, FEUP, Portugal
Venue:
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Year:
2000

Citing 6
Cited 1

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Stack-based scheduling for realtime processes

Real-Time Systems
Real-time fault-tolerant communication in computer networks

Real-time fault-tolerant communication in computer networks
Improvement in feasibility testing for real-time tasks

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers

Static-priority scheduling of sporadic messages on a wireless channel

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, one Single Message per Token Visit (SMTV). In this paper, we establish an analogy between non preemptive task scheduling in single processors and scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non pre-emptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM and EDF priority assignment schemes.