New strategies for assigning real-time tasks to multiprocessor systems

DOI10.1109/12.477248MaRDI QIDQ4421135zbMATH OpenOpenAlexFDO

Authors

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/88bda55e6fa9db04f2e995310dbb97afac257451

zbMATH Keywords

Optimal schedulingtask assignment scheme

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• An optimal multiprocessor real-time scheduling algorithm
• Allocation criteria for periodic hard-real-time task in multiprocessor systems
• Multiprocessor scheduling for real-time systems
• scientific article; zbMATH DE number 749829
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Cited in

(20)

• scientific article; zbMATH DE number 7561425 (Why is no real title available?)
• A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
• A new strategy for improving the effectiveness of resource reclaiming algorithms in multiprocessor real-time systems
• Measuring the performance of schedulability tests
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• Scalable online feasibility tests for admission control in a Java real-time system
• Rate monotonic schedulability tests using period-dependent conditions
• On-line schedulability tests for adaptive reservations in fixed priority scheduling
• A non-preemptive scheduling algorithm for soft real-time systems
• A survey of real-time scheduling on multiprocessor systems
• On fixed priority scheduling, offsets and co-prime task periods
• Architecture aware semi partitioned real-time scheduling on multicore platforms
• Rate-monotonic scheduling for hard-real-time systems
• A technique for adaptive scheduling of soft real-time tasks
• Lowest priority first based feasibility analysis of real-time systems
• A survey of hard real-time scheduling for multiprocessor systems
• Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios
• A framework for solving sequence problem of multiple input streams
• A Note on "New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems"
• Non-preemptive scheduling to maximize the minimum global inter-completion time

This page was built for publication: New strategies for assigning real-time tasks to multiprocessor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421135)