New complexity results on scheduling with small communication delays
From MaRDI portal
Publication:1894375
DOI10.1016/0166-218X(94)00063-JzbMATH Open0837.68009MaRDI QIDQ1894375FDOQ1894375
Authors: Christophe Picouleau 
Publication date: 16 April 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- UET scheduling with unit interprocessor communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- Task scheduling with interprocessor communication delays
- Tree scheduling with communication delays
Cited In (10)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
- On the complexity of scheduling with large communication delays
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Scheduling in the presence of processor networks : complexity and approximation
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- Task scheduling with interprocessor communication delays
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Approximation algorithms for scheduling with a limited number of communications
- The complexity of scheduling problems with communication delays for trees
This page was built for publication: New complexity results on scheduling with small communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894375)
