Scheduling preemptive multiprocessor tasks on dedicated processors

DOI10.1016/0166-5316(94)90058-2MaRDI QIDQ4309189zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Paolo Dell'Olmo, M. Drozdowski, Lucio Bianco

Publication date 1 November 1994

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(94)90058-2

Mathematics Subject Classification ID

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

Cited in

(6)

• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Scheduling multiprocessor tasks -- An overview
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness

This page was built for publication: Scheduling preemptive multiprocessor tasks on dedicated processors

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