A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

DOI10.1007/s11241-018-9319-6zbMath1436.68066OpenAlexW2898240133MaRDI QIDQ779440

Mauro Leoncini, Paolo Valente, Manuela Montangero

Publication date: 13 July 2020

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

Full work available at URL: https://doi.org/10.1007/s11241-018-9319-6

zbMATH Keywords

branch-and-boundparallel algorithmtardinessglobal EDF scheduler

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Achieving consistency with cutting planes

Uses Software

• PICO
• SchedCAT
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• GitHub
• Using a lag-balance property to tighten tardiness bounds for global EDF
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms
• Performance of parallel branch-and-bound algorithms

This page was built for publication: A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF