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

DOI10.1016/S0020-0190(97)00119-1zbMath1337.68045OpenAlexW2081894714MaRDI QIDQ287150

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 complexityschedulingpolynomial time algorithmparallel processingprecedence 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

• Unnamed Item
• Multiprocessor scheduling with communication delays
• A linear-time algorithm for a special case of disjoint set union
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks with chain constraints
• Optimal scheduling for two-processor systems
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling Interval-Ordered Tasks
• Concurrent Task Systems
• An Almost-Linear Algorithm for Two-Processor Scheduling
• `` Strong NP-Completeness Results
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Sequencing of Two Equivalent Processors

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