An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

DOI10.1007/s11241-007-9035-0zbMath1141.68014OpenAlexW2025486575MaRDI QIDQ2479885

UmaMaheswari C. Devi, Vasile Bud, James H. Anderson

Publication date: 3 April 2008

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-007-9035-0

zbMATH Keywords

SchedulingPartitioningGlobal schedulingMultiprocessorsTardinessEarliest-deadline-firstMigrationsSoft real-time

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Utility accrual real-time scheduling for multiprocessor embedded systems

Cites Work

• Real time scheduling theory: A historical perspective
• Priority-driven scheduling of periodic task systems on multiprocessors
• Utilization bounds for EDF scheduling on real-time multiprocessor systems
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Earliest-deadline-first service in heavy-traffic acyclic networks.
• Proportionate progress: A notion of fairness in resource allocation
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Optimal rate-based scheduling on multiprocessors

This page was built for publication: An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems