Showing 1 - 10 of 3,823
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in … problem of determining an upper bound on the minimum number of processors achieved by a schedule that minimizes the makespan … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the …
Persistent link: https://www.econbiz.de/10010847688
Persistent link: https://www.econbiz.de/10011419276
Persistent link: https://www.econbiz.de/10011421399
Persistent link: https://www.econbiz.de/10011497471
Persistent link: https://www.econbiz.de/10012106649
Persistent link: https://www.econbiz.de/10011627821
Persistent link: https://www.econbiz.de/10011628297
Persistent link: https://www.econbiz.de/10011628422
Persistent link: https://www.econbiz.de/10011588270
Persistent link: https://www.econbiz.de/10010416647