Algorithm for resource allocation in data centers with independent schedulers for different types of resources
From MaRDI portal
(Redirected from Publication:895300)
Recommendations
- Resource allocation algorithm in data centers with a unified scheduler for different types of resources
- Multi-stage resource-aware scheduling for data centers with heterogeneous servers
- Ant algorithms for scheduling computations in data centers
- Flow and greedy algorithms of resource co-allocation in distributed systems
- A game theory approach to fair and efficient resource allocation in cloud computing
Cites work
- A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems
- Algorithm for synthesis of real-time systems under reliability constraints
- An algorithm for constructing single machine schedules based on ant colony approach
- Finding the k Shortest Paths
- Scheduling algorithms for real-time computing systems admitting simulation models
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Some algorithms of solving minimax multiprocessor scheduling problem
Cited in
(5)- Normative dynamic analysis of extreme operational modes of a heterogeneous computing system
- Multi-stage resource-aware scheduling for data centers with heterogeneous servers
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Ant algorithms for scheduling computations in data centers
- Resource allocation algorithm in data centers with a unified scheduler for different types of resources
This page was built for publication: Algorithm for resource allocation in data centers with independent schedulers for different types of resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895300)
