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

DOI10.1007/S11241-018-9319-6MaRDI QIDQ779440zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Leoncini, Manuela Montangero, Paolo Valente

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

parallel algorithmbranch-and-boundtardinessglobal EDF scheduler

Mathematics Subject Classification ID

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

Recommendations

• Tardiness bounds under global EDF scheduling on a multiprocessor
• Tight Tardiness Bounds for Pseudo-Harmonic Tasks Under Global-EDF-Like Schedulers
• Minimizing total tardiness on parallel machines with preemptions
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
• Global EDF scheduling for parallel real-time tasks
• Utilization-Tensity Bound for Real-Time DAG Tasks under Global EDF Scheduling
• Generalized tardiness bounds for global multiprocessor scheduling
• scientific article; zbMATH DE number 2080870

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
• GitHub
• Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• PICO: An object-oriented framework for parallel branch and bound
• Performance of parallel branch-and-bound algorithms
• Proportionate progress: A notion of fairness in resource allocation
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Using a lag-balance property to tighten tardiness bounds for global EDF

Cited in

(3)

• Using a lag-balance property to tighten tardiness bounds for global EDF
• Tight Tardiness Bounds for Pseudo-Harmonic Tasks Under Global-EDF-Like Schedulers
• Achieving consistency with cutting planes

Describes a project that uses

Uses Software

• GitHub
• SchedCAT
• PICO

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

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