A comparison of list schedules for parallel processing systems
From MaRDI portal
Publication:4045652
Cited in
(18)- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Task scheduling with and without communication delays: A unified approach
- Job scheduling methods for reducing waiting time variance
- A comparison of random task graph generation methods for scheduling problems
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
- A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
- Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems
- Resource allocation algorithm for light communication grid-based workflows within an SLA context
- Reliability-aware scheduling strategy for heterogeneous distributed computing systems
- Distributed scheduling using simple learning machines
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- A list-scheduling heuristic for the short-term planning of assessment centers
- Depth optimization for topological quantum circuits
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- A comparison of multiprocessor task scheduling algorithms with communication costs
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
- TWO-SIDED ELIMINATION ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS USING HOUSEHOLDER REDUCTIONS
This page was built for publication: A comparison of list schedules for parallel processing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045652)
