802.4 Rate Monotonic scheduling in hard
โ
J. Orozco; R. Cayssials; J. Santos; E. Ferro
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 757 KB
This paper presents an analysis of the Rate Monotonic scheduling of an 802.4 network operating in a hard real-time environment. The worst-case number of priority inversions is determined. With that, an iterative algorithm is derived to partition the set of nodes in priority classes and to assign the