Pages that link to "Item:Q4421135"
From MaRDI portal
The following pages link to New strategies for assigning real-time tasks to multiprocessor systems (Q4421135):
Displayed 15 items.
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- On-line schedulability tests for adaptive reservations in fixed priority scheduling (Q438225) (← links)
- Cluster scheduling for real-time systems: utilization bounds and run-time overhead (Q554016) (← links)
- Measuring the performance of schedulability tests (Q813145) (← links)
- A technique for adaptive scheduling of soft real-time tasks (Q813149) (← links)
- Scalable online feasibility tests for admission control in a Java real-time system (Q853608) (← links)
- Lowest priority first based feasibility analysis of real-time systems (Q897377) (← links)
- Rate-monotonic scheduling for hard-real-time systems (Q1278515) (← links)
- Non-preemptive scheduling to maximize the minimum global inter-completion time (Q1810562) (← links)
- Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios'' (Q1944894) (← links)
- A survey of real-time scheduling on multiprocessor systems (Q2090220) (← links)
- Architecture aware semi partitioned real-time scheduling on multicore platforms (Q2356295) (← links)
- Rate monotonic schedulability tests using period-dependent conditions (Q2460198) (← links)
- A FRAMEWORK FOR SOLVING SEQUENCE PROBLEM OF MULTIPLE INPUT STREAMS (Q3065616) (← links)
- (Q5091067) (← links)