New strategies for assigning real-time tasks to multiprocessor systems
From MaRDI portal
Publication:4421135
DOI10.1109/12.477248zbMath1048.68534OpenAlexW2101300711MaRDI QIDQ4421135
No author found.
Publication date: 1995
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/88bda55e6fa9db04f2e995310dbb97afac257451
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
On fixed priority scheduling, offsets and co-prime task periods, Scalable online feasibility tests for admission control in a Java real-time system, Lowest priority first based feasibility analysis of real-time systems, Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios, On-line schedulability tests for adaptive reservations in fixed priority scheduling, Rate monotonic schedulability tests using period-dependent conditions, Cluster scheduling for real-time systems: utilization bounds and run-time overhead, Unnamed Item, A FRAMEWORK FOR SOLVING SEQUENCE PROBLEM OF MULTIPLE INPUT STREAMS, Non-preemptive scheduling to maximize the minimum global inter-completion time, Rate-monotonic scheduling for hard-real-time systems, A survey of real-time scheduling on multiprocessor systems, Measuring the performance of schedulability tests, A technique for adaptive scheduling of soft real-time tasks, Architecture aware semi partitioned real-time scheduling on multicore platforms
