A note on scheduling multiprocessor tasks with precedence constraints on parallel processors

DOI10.1016/S0020-0190(97)00119-1MaRDI QIDQ287150zbMATHOpenAlexFDO

Authors A. K. Amoura

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00119-1

zbMATH Keywords

computational complexityschedulingparallel processingpolynomial time algorithmprecedence constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• scientific article; zbMATH DE number 3884111 (Why is no real title available?)
• A linear-time algorithm for a special case of disjoint set union
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Concurrent Task Systems
• Multiprocessor scheduling with communication delays
• Optimal Sequencing of Two Equivalent Processors
• Optimal scheduling for two-processor systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Interval-Ordered Tasks
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks with chain constraints
• `` Strong NP-Completeness Results

This page was built for publication: A note on scheduling multiprocessor tasks with precedence constraints on parallel processors

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