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

• Type: Article in International Conference Proceedings Book
• Date: 2000

Authors

Eduardo Tovar (Author) Other; Francisco Vasques (Author) FEUP

Conference proceedings International

Title: EUROMICRO RTS 2000: 12TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS

Pages: 209-218

12th Euromicro Conference on Real-Time Systems

STOCKHOLM, SWEDEN, JUN 19-21, 2000

Indexing

ISI Web of Knowledge - 8 Citations

Scopus - 11 Citations

Other information

Authenticus ID: P-001-1EG

DOI: 10.1109/emrts.2000.854009

Abstract (EN): 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 protcols, where each station may transfer, at most, one Single Message per Token Visit (SMTV). In this paper, we establish an analogy between non pre-emptive 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 counterpart 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 RM/DM and EDF priority assignment schemes.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10