Fast scheduling and partitioning algorithm in the multi-processor system with redundant communication resources
From MaRDI portal
Recommendations
- Resource-constrained scheduling of partitioned algorithms on processor arrays
- Optimal scheduling algorithms for communication constrained parallel processing
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Multistep scheduling algorithm for parallel and distributed processing in heterogeneous systems with communication costs
- scientific article; zbMATH DE number 42110
- Robust partitioned scheduling for real-time multiprocessor systems
Cited in
(3)
This page was built for publication: Fast scheduling and partitioning algorithm in the multi-processor system with redundant communication resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737347)