On the minimum number of processors for scheduling problems with communication delays

DOI10.1023/A:1018931508072zbMATH Open0921.90094OpenAlexW201773604MaRDI QIDQ1290161FDOQ1290161

A. Moukrim

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018931508072

zbMATH Keywords

makespanupper boundsinterprocessor communication delaysminimum number of processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (7)

• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• Upper bound on the number of processors for scheduling with interprocessor communication delays.
• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing the number of machines for minimum length schedules
• Title not available (Why is that?)

   Recommendations

• Upper bound on the number of processors for scheduling with interprocessor communication delays. 👍 👎
• Scheduling in the presence of processor networks : complexity and approximation 👍 👎
• A very difficult scheduling problem with communication delays 👍 👎
• The Complexity of Scheduling Trees with Communication Delays 👍 👎

This page was built for publication: On the minimum number of processors for scheduling problems with communication delays

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