Advanced real-time scheduling using the IEEE 802.5 token ring

Strosnider, J.K.; Marchok, T.E.; Lehoczky, John P.

doi:10.1109/real.1988.51099

Cited by 78 publications

(21 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Token rings and/or token buses are better suited for such messages. Strosnider and Marchok extended the Rate Monotonic Algorithm (RMA) to schedule transmission of periodic messages on an IEEE 802.5 token ring network [98]. They used the priority mechanism of the IEEE 802.5 standard to implement the priority scheme of the RMA.…”

Section: A Multiple-access Networkmentioning

confidence: 99%

Real-time computing: a new discipline of computer science and engineering

1994

View full text Add to dashboard Cite

Section: A Multiple-access Networkmentioning

confidence: 99%

Real-time computing: a new discipline of computer science and engineering

1994

View full text Add to dashboard Cite

“…Furthermore, r Xu is the minimum release time of the task; O must be greater than this required value. 5 Xu and Parnas [3] use the term 'exclusion' between two tasks to mean no part of the execution of either task can overlap; where the critical section is small a total exclusion constraint is too harsh, and an alternative concurrency control protocol (such as the priority ceiling protocol) can be used more efficiently; of course, the priority ceiling protocol cannot be used in a static cyclic schedule…”

Section: Constraint: Task B Is Constrained To Run Only When a Task A mentioning

confidence: 99%

“…(assuming the communications sub-system can provide such guarantees [4], [5]). Task 2 is released after the worst-case message arrival time.…”

Section: Introductionmentioning

confidence: 99%

The End Of The Line For Static Cyclic Scheduling?

Audsley

Tindell

Burns

1993

Fifth Euromicro Workshop on Real-Time Systems

View full text Add to dashboard Cite

One common way of constructing hard real-timeThe following section describes the assumed computational model. Section 3 provides a practical motivation for the use of offsets in hard real-time system design. Section 4 describes an efficient optimal priority assignment algorithm for tasks with offsets. Section 5 gives analysis to bound worst-case response times for such tasks. Section 6 shows how the analysis enables scheduling of task sets with precedence and exclusion constraints, previously deemed schedulable using only static cyclic scheduling technology. Concluding remarks are offered in Section 7. Computational ModelA fixed number of transactions are assigned to a processor 2 . Each transaction is composed of a fixed number of tasks. Each task in a transaction requires a bounded amount of computation time for each invocation. A transaction may arrive periodically or sporadically, but with a minimum time between subsequent arrivals 3 -this minimum time is denoted the period. For each transaction arrival, each task is released (i.e. placed in a notional priority-ordered run queue) at a fixed offset in time, measured relative to the arrival time of the transaction; we assume that this offset is less than the period of the transaction. Necessarily all tasks in a given transaction must share the same period. Each task is assigned a unique static priority; tasks are dispatched preemptively based on this priority. For the moment we assume that tasks cannot lock semaphores and hence cannot be blocked (we will lift this restriction later). Tasks are permitted to have response times greater than their periods (and hence have arbitrary deadlines [6]). Furthermore, tasks are assumed to have a release jitterthis occurs when the arrival time (i.e. time when a task wishes to run) and the release time (i.e. the time when the task is placed in the priority-ordered run-queue) are not

show abstract

“…The majority of the standard communication networks do not adapt well to real-time communications, and do not support prioritybased scheduling of messages. However, there are some standard communication networks that have been used to carry out hard real-time communications, such as the token-bus [10], FDDI [1], the CAN bus [11], etc. The analysis of the message traffic in these communication resources is carried out using techniques similar to RMA with the processor resources.…”

Section: Linear System Modelmentioning

confidence: 99%

Schedulability analysis of distributed hard real-time systems with multiple-event synchronization

Gutiérrez

Harbour

Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000

View full text Add to dashboard Cite

Advanced real-time scheduling using the IEEE 802.5 token ring

Cited by 78 publications

References 4 publications

Real-time computing: a new discipline of computer science and engineering

Real-time computing: a new discipline of computer science and engineering

The End Of The Line For Static Cyclic Scheduling?

Schedulability analysis of distributed hard real-time systems with multiple-event synchronization

Contact Info

Product

Resources

About