A two-stage hardware scheduler combining greedy and optimal scheduling
From MaRDI portal
(Redirected from Publication:436901)
Recommendations
- Optimal scheduling for two-processor systems
- Optimal Preemptive Scheduling of Two Unrelated Processors
- scientific article; zbMATH DE number 3970495
- Ideal preemptive schedules on two processors
- On the two-phase method for preemptive scheduling
- scientific article; zbMATH DE number 1185302
- Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
- Multiprocessor scheduling by generalized extremal optimization
Cites work
- scientific article; zbMATH DE number 1303560 (Why is no real title available?)
- scientific article; zbMATH DE number 1955830 (Why is no real title available?)
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Distributed algorithm for approximating the maximum matching
- Efficient algorithms for finding maximum matching in graphs
- Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
- Matching is as easy as matrix inversion
- Matrices Associated With the Hitchcock Problem
- Maximum matching in a convex bipartite graph
This page was built for publication: A two-stage hardware scheduler combining greedy and optimal scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436901)