Flow and greedy algorithms of resource co-allocation in distributed systems
From MaRDI portal
Recommendations
- Resource allocation and capacity assignment in distributed systems
- A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
- Distributed Resource Allocation in Stream Processing Systems
- Publication:3494352
- scientific article; zbMATH DE number 1929963
- A distributed resource allocation algorithm for many processes
- Greedy distributed optimization of multi-commodity flows
- Greedy distributed optimization of multi-commodity flows
- Distributed algorithm design for optimal resource allocation problems via incremental passivity theory
Cites work
Cited in
(7)- Graph approach to job assignment in distributed real-time systems
- Economic model of scheduling and fair resource sharing in distributed computations
- Distributed Resource Allocation in Stream Processing Systems
- Job control in distributed environments with non-dedicated resources
- Packet task processing in distributed computational environments with inalienable resources
- Algorithm for resource allocation in data centers with independent schedulers for different types of resources
- Multilevel strategies of resource co-allocation in distributed computations with control periods
This page was built for publication: Flow and greedy algorithms of resource co-allocation in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951945)