LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems

DOI10.1016/S0005-1098(96)00245-2zbMath0881.90068OpenAlexW2019456514WikidataQ126588050 ScholiaQ126588050MaRDI QIDQ1360477

Bo-Chao Cheng, Alexander D. Stoyenko, Sanjoy K. Baruah, Thomas J. jun. Marlowe

Publication date: 17 July 1997

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(96)00245-2

zbMATH Keywords

heuristiccomplex-task-multiple-processor modelleast space-time first

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

The job shop scheduling problem with convex costs ⋮ LSTF

Cites Work

• Unnamed Item
• A new algorithm for scheduling periodic, real-time tasks
• On optimal lateness and tardiness scheduling in real-time systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems