Scheduling multiprocessor tasks on three dedicated processors

DOI10.1016/0020-0190(92)90172-RMaRDI QIDQ1197982zbMATH OpenOpenAlexFDO

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

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(92)90172-r

zbMATH Keywords

resource allocationschedulingNP-completeparallel processingpolynomial algorithm

Mathematics Subject Classification ID

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

Recommendations

• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• scientific article; zbMATH DE number 1979516
• Scheduling multiprocessor tasks -- An overview
• Task splitting for three machine preemptive scheduling
• On multiprocessor system scheduling
• Shared processor scheduling of multiprocessor jobs

Cites work

• Complexity of Scheduling Parallel Task Systems
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• The complexity of scheduling independent two-processor tasks on dedicated processors
• `` Strong NP-Completeness Results

Cited in

(30)

• scientific article; zbMATH DE number 2086778 (Why is no real title available?)
• scientific article; zbMATH DE number 1472149 (Why is no real title available?)
• New perspectives in scheduling theory
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
• An approximation result for a duo-processor task scheduling problem
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• An approximation algorithm for scheduling on three dedicated machines
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• A graph based model for survivability applications
• On the complexity of adjacent resource scheduling
• On minimizing dataset transfer time in an acyclic network with four servers
• Comparability graph augmentation for some multiprocessor scheduling problems
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Scheduling three chains on two parallel machines
• Complexity and approximation results for scheduling multiprocessor tasks on a ring.
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Scheduling: agreement graph vs resource constraints
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Scheduling independent tasks with multiple modes
• Scheduling wagons to unload in bulk cargo ports with uncertain processing times
• Task splitting for three machine preemptive scheduling

This page was built for publication: 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 Q1197982)