Power efficient rate monotonic scheduling for multi-core systems
From MaRDI portal
Publication:663432
DOI10.1016/j.jpdc.2011.07.005zbMath1231.68087OpenAlexW1997710288MaRDI QIDQ663432
Hameed Hussain, Nasro Min-Allah, Albert Y. Zomaya, Samee Ullah Khan
Publication date: 14 February 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.07.005
real-time systemsfixed-priority schedulingnon-preemptive schedulingfeasibility analysisonline schedulability tests
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (2)
Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling ⋮ Lowest priority first based feasibility analysis of real-time systems
Cites Work
- Utilization bound for periodic task set with composite deadline
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Power efficient rate monotonic scheduling for multi-core systems
