Conditions for on-line scheduling of hard real-time tasks on multiprocessors

DOI10.1006/JPDC.1998.1484MaRDI QIDQ1290260zbMATHOpenAlexFDO

Authors M. Dominic, Bijendra N. Jain

Publication date 25 January 2000

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1998.1484

zbMATH Keywords

on-line scheduling

Mathematics Subject Classification ID

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

Recommendations

• On-line scheduling of scalable real-time tasks on multiprocessor systems.
• A survey of hard real-time scheduling for multiprocessor systems
• On the competitiveness of on-line real-time task scheduling
• On-line scheduling with hard deadlines
• Online Scheduling with Hard Deadlines on Parallel Machines
• Semi-on-line multiprocessor scheduling with given total processing time

Cited in

(4)

• Scheduling multiple variant programs under hard real-time constraints
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• On-line scheduling of scalable real-time tasks on multiprocessor systems.
• Allocation criteria for periodic hard-real-time task in multiprocessor systems

This page was built for publication: Conditions for on-line scheduling of hard real-time tasks on multiprocessors

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