scientific article
From MaRDI portal
Publication:2741503
zbMath0982.68016MaRDI QIDQ2741503
No author found.
Publication date: 24 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- A note on Graham's bound
- Three, four, five, six, or the complexity of scheduling with communication delays
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- Bounds on Multiprocessing Timing Anomalies