Traffic scheduling anomalies in temporal partitions

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

Authors

Luis Almeida (Author) Other; Pedreiras, P (Author) Other; Marau, R (Author) Other

Conference proceedings International

Title: FROM MODEL-DRIVEN DESIGN TO RESOURCE MANAGEMENT FOR DISTRIBUTED EMBEDDED SYSTEMS

Pages: 95-104

Working Conference on Distributed and Parallel Embedded Systems

Braga, PORTUGAL, OCT 11-NOV 01, 2005

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-004-PQ7

DOI: 10.1007/978-0-387-39362-9_11

Abstract (EN): Many network protocols rely on temporal partitions to provide isolation between different nodes (TDMA slots) or different traffic classes (multi-phase cyclic frameworks). Typically, the duration of the slots or phases is not correlated with the duration of packet transmissions, which is variable and non-preemptive. Thus, it is possible that the limit of the slot or phase be overrun by an on-going packet transmission or, if this cannot be tolerated, idle-time must be inserted at the end of the slot or phase whenever a packet does not fit in. Nevertheless, both situations lead to scheduling anomalies in which the worst-case network delay does not occur necessarily with the synchronous release of all other packets, or just the higher priority ones. This paper highlights two such anomalies showing their origin and indicating that, in such circumstances, it is not possible to determine the worst-case network delay with exactitude in the general case. However, it is still possible to upper bound the network delay and the paper shows non-optimal solutions for those cases.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10