First fit decreasing scheduling on uniform multiprocessors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3744543 (Why is no real title available?)
- scientific article; zbMATH DE number 3780550 (Why is no real title available?)
- scientific article; zbMATH DE number 3466528 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds for LPT Schedules on Uniform Processors
- Bounds for Multifit Scheduling on Uniform Processors
- Bounds on Multiprocessing Timing Anomalies
- NP-complete scheduling problems
Cited in
(7)- Approximation scheduling algorithms: a survey
- Shortest-elapsed-time-first on a multiprocessor
- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
- scientific article; zbMATH DE number 3843135 (Why is no real title available?)
- On a special case of uniform processor scheduling
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- scientific article; zbMATH DE number 3898232 (Why is no real title available?)
This page was built for publication: First fit decreasing scheduling on uniform multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061602)