Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors

DOI10.1016/0020-0190(94)90066-3zbMATH Open0788.68011OpenAlexW2073624403WikidataQ57387884 ScholiaQ57387884MaRDI QIDQ1318754FDOQ1318754

Authors: Jacek Blazewicz, Maria Grazia Speranza, Paolo Dell'Olmo, M. Drozdowski 

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90066-3

zbMATH Keywords

resource allocationschedulingNP-completeparallel processingpolynomial algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• Scheduling multiprocessor tasks on two parallel processors
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
• A graph based model for survivability applications
• Scheduling multiprocessor tasks -- An overview
• An approximation algorithm for scheduling on three dedicated machines
• A study of scheduling problems with preemptions on multi-core computers with GPU accelerators

This page was built for publication: Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors

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