Download:
|
by Khawar M. Zuberi, Kang G. Shin
http://kabru.eecs.umich.edu/papers/publications/1997/zuberi_tra97.ps
Add To MetaCart
Abstract:
Network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. In this paper we present the mixed traffic scheduler (MTS), which provides higher schedulability than fixed-priority schemes like deadline-monotonic (DM) while incurring less overhead than dynamic earliest-deadline (ED) scheduling. Through simulations, we compare the performance of MTS with that of DM and ED * (an imaginary scheduler which works like ED, except it incurs less overhead). Our simulations show that MTS performs much better than DM and at the same level as ED*, except under high loads and tight deadlines, when ED * is superior. I.
Citations
|
239
|
On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks, Performance Evaluation 2
– Leung, Whitehead
- 1982
|
|
143
|
Real-Time Communication in Multi-Hop Networks
– Kandlur, Shin, et al.
- 1994
|
|
123
|
TTP – A protocol for fault-tolerant real-time systems
– Kopetz, Grunsteidl
- 1994
|
|
104
|
On non-preemptive scheduling of periodic and sporadic tasks
– Jeffay, Stanat, et al.
- 1991
|
|
98
|
On the ability of establishing real-time channels in point-to-point packet-switching networks
– Zheng, Shin
- 1994
|
|
74
|
Wellings,A.: ”Calculating Controller Area Network (CAN) Message Response
– Tindell, Burns
- 1995
|
|
67
|
Analysing Real-Time Communications: Controller Area Network (CAN
– Tindell, Hansson, et al.
- 1994
|
|
30
|
Smart networks for control
– Raji
- 1994
|
|
19
|
Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints
– Zhao, Ramamritham
- 1987
|
|
6
|
An inside look at the fundamentals of CAN
– Zeltwanger
- 1995
|
|
4
|
A field bus approach to local control networks
– Lenhart
- 1993
|
|
3
|
Real-time communications in a computer-controlled workcell
– Shin
- 1991
|