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

DOI10.1006/JPDC.1998.1484zbMATH Open0929.68010OpenAlexW1967398258MaRDI QIDQ1290260FDOQ1290260

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

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

zbMATH Keywords

on-line scheduling

Mathematics Subject Classification ID

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

Cited In (4)

• Allocation criteria for periodic hard-real-time task in multiprocessor systems
• 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.

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)