An improved hard real-time scheduling for the IEEE 802.5

Pleinevaux, P.

doi:10.1007/bf00365404

Cited by 20 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The bandwidth allocation schemes are often based on well-known real-time scheduling results, for example rate-monotonic scheduling [19,15,21], pin-wheel scheduling [5], and weighted round-robin [2]. The success of a particular bandwidth allocation scheme depends on whether a suitable media access control can be used to enforce the scheme.…”

Section: Related Workmentioning

confidence: 99%

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Mukherjee

Saha

Saksena³

et al. 1999

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Mukherjee

Saha

Saksena³

et al. 1999

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…The approach is based on the notion of Schedulable Unit which is essentially the time necessary to service a message, including the time to get the token, the time to transmit the message and the time to pass the token to another station. In (Pleinevaux 1992) we showed that the time to get the token can in some error-free conditions be larger than the ring latency. In fact, we showed that a priority inversion can happen when a message gets ready for transmission.…”

Section: The Scheduling Problemmentioning

confidence: 99%

“…The Token Ring has recently been the subject of multiple studies since Strosnider showed how the Rate Monotonic Algorithm can be applied to schedule message transmissions (Strosnider, Marchok and Lehoczky 1988). It was shown (Pleinevaux 1992) that the original approximations can be improved when taking different factors into account: ring length or concurrent alarms. Modifications of the token ring protocol have been studied in (Yao 1991) while similar studies have been made for FDDI, a token ring whose operation is based on timed tokens (Agrawal et at.…”

Section: Introductionmentioning

confidence: 99%

Real-time fault tolerant operation of the 802.5 token ring

Pleinevaux

1995

Real-Time Syst

Self Cite

View full text Add to dashboard Cite

Scheduling a hard real time application on a token ring requires that the delays to capture the token be known. Previous studies considered only a small subset of the token ring mechanisms in schedulability analyses. In this paper, we study the influence of three types of faults on the time to capture the token. These are token losses, failures of the active monitor and cable faults, We also show the influence of the stack mechanism on the delay to capture the token. The paper ends with an evaluation of these delays in various ring configurations in which the transmission speed, token hold time and ring latency are variables. We conclude that the token ring may be very difficult to schedule for hard real time applications because we do not know if other mechanisms or combinations of phenomena can introduce additional delays that make the operation of the ring unpredictable in the present state of knowledge.

show abstract

“…The gateway node N G is only able to broadcast on the TTC in the slot S G of the TDMA rounds circulating on the TTP bus. According to the MEDL of the gateway, a set of messages not exceeding size S G of the slot S G will be removed from the front of the Out TTP queue in every round, and will be packed in the S G slot (12). Once the frame is broadcast (13) it will arrive at node N 1 (14), where all the messages in the frame will be copied in the input buffers of the destination processes (15).…”

Section: Software Architecturementioning

confidence: 99%

Schedulability-driven partitioning and mapping for multi-cluster real-time systems

Pop¹,

Eles²,

Peng³

et al.

Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004.

View full text Add to dashboard Cite

We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have proposed a schedulability analysis for such systems, including a worst-case queuing delay analysis for the gateways responsible for routing inter-cluster traffic. Based on this analysis, we address design problems characteristic to multi-clusters: partitioning of the system functionality into time-triggered and event-triggered domains, and mapping of processes onto architecture nodes. We present a branch-and-bound algorithm for solving these problems. Our algorithm is able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example.

show abstract

An improved hard real-time scheduling for the IEEE 802.5

Cited by 20 publications

References 11 publications

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Real-time fault tolerant operation of the 802.5 token ring

Schedulability-driven partitioning and mapping for multi-cluster real-time systems

Contact Info

Product

Resources

About