When to give up on a parallel implementation
From MaRDI portal
Cites work
- A note on online strip packing
- Approximation algorithms for scheduling unrelated parallel machines
- Bounds on Multiprocessing Timing Anomalies
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Generalized unrelated machine scheduling problem
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- scientific article; zbMATH DE number 5764829 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- scientific article; zbMATH DE number 1003241 (Why is no real title available?)
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- Improved approximations for unrelated machine scheduling
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Meeting deadlines: how much speed suffices?
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online scheduling of malleable parallel jobs
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Online scheduling of moldable parallel tasks
- Scheduling Unrelated Machines by Randomized Rounding
- Shelf Algorithms for Two-Dimensional Packing Problems
- Stochastic _p load balancing and moment problems via the L-function method
- Stochastic load balancing on unrelated machines
- Stochastic online scheduling on unrelated machines
This page was built for publication: When to give up on a parallel implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296735)
