DocumentCode
3618847
Title
Scheduling time constrained messages on miniMAP
Author
Lj. Beus-Dukic;A.J. Wellings
Author_Institution
Dept. of Comput. Sci., York Univ., UK
fYear
1991
fDate
6/13/1905 12:00:00 AM
Firstpage
106
Lastpage
110
Abstract
The existing OSI standards, in their present form, cannot satisfy the requirements imposed by time-critical applications. The solution being sought is for a middle tier network (MiniMAP), between the full seven layer network (MAP) and the Fieldbus type networks, which will guarantee completion of critical actions within the specified time window. The paper presents a performance analysis, based on simulation results, of the three layer MiniMAP (with MMS, LLC type 3 and 4 MAC access classes) with an end-to-end communications scheduler on the top of it. The authors study the performance of the protocol under four different scheduling policies (First Come First Served, Minimum Deadline First, Priority, Value) and using a symmetric load pattern. The performance metric for the time-constrained traffic is the percentage of messages received within their deadlines. It is shown that when employing an end-to-end scheduler the performance of MiniMAP improves significantly (up to 48%).
Keywords
"Time factors","Job shop scheduling","Process control","Timing","Communication system traffic control","Manufacturing industries","Manufacturing automation","Access protocols","Communication system control","Processor scheduling"
Publisher
ieee
Conference_Titel
Real Time Systems, 1991. Proceedings., Euromicro ´91 Workshop on
Print_ISBN
0-8186-2210-5
Type
conf
DOI
10.1109/EMWRT.1991.144090
Filename
144090
Link To Document