Task distributions on multiprocessor systems
From MaRDI portal
Recommendations
- Approximation algorithms for scheduling unrelated parallel machines
- An absolute approximation algorithm for scheduling unrelated machines
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
- General multiprocessor task scheduling: approximate solutions in linear time
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
Cited in
(9)- An optimal rounding gives a better approximation for scheduling unrelated machines
- An absolute approximation algorithm for scheduling unrelated machines
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS
- Assigning sporadic tasks to unrelated machines
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
- Approximation algorithms for multiprocessor scheduling under uncertainty
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Improved scheduling in rings
- On the complexity of constructing multiprocessor little-preemptive schedules
This page was built for publication: Task distributions on multiprocessor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536419)