On optimal lateness and tardiness scheduling in real-time systems

DOI10.1007/BF02320193MaRDI QIDQ1184690zbMATH OpenFDO

Authors Alexander D. Stoyenko, Leonidas Georgiadis

Publication date 28 June 1992

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02320193

zbMATH Keywords

time-dependent

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Probabilistic games; gambling (91A60)

Recommendations

• Extremal scheduling of parallel processing with and without real-time constraints
• Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling

Cites work

• A Real-Time System Design Methodology^*
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• scientific article; zbMATH DE number 3885030 (Why is no real title available?)
• scientific article; zbMATH DE number 3685168 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• On optimal lateness and tardiness scheduling in real-time systems
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• On the development of practical nonlinear filters
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Optimal scheduling with strict deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(20)

• Convex comparison of service disciplines in real time queues
• On optimal lateness and tardiness scheduling in real-time systems
• LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
• Personalized queues: the customer view, via a fluid model of serving least-patient first
• Rate monotonic vs. EDF: judgment day
• Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems
• Dual-priority versus background scheduling: A path-wise comparison
• Loss ratio of the EDF scheduling policy with early discarding technique
• Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
• Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
• Punctuality and idleness in just-in-time scheduling
• On queues with impatience: stability, and the optimality of earliest deadline first
• Extremal scheduling of parallel processing with and without real-time constraints
• Algorithm Theory - SWAT 2004
• A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
• Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
• Random trees in queueing systems with deadlines
• An earlier time for inserting and/or accelerating tasks
• Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
• The space of EDF deadlines: The exact region and a convex approximation

This page was built for publication: On optimal lateness and tardiness scheduling in real-time systems

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