Allocation of interdependent resources for maximal throughput
From MaRDI portal
Recommendations
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
- A queueing analysis of data networks
- Queueing and scheduling in random environments
Cited in
(16)- Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Breaking \(1-1/e\) barrier for non-preemptive throughput maximization
- Maximizing throughput in queueing networks with limited flexibility
- Randomized scheduling algorithm for queueing networks
- Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
- On the throughput of a resource sharing model.
- Scheduling Resources for Throughput Maximization
- Robustness of efficient server assignment policies to service time distributions in finite-buffered lines
- scientific article; zbMATH DE number 4008075 (Why is no real title available?)
- Dynamic server allocation for unstable queueing networks with flexible servers
- Profit maximization in flexible serial queueing networks
- DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES
- A push-pull network with infinite supply of work
- Asymptotically optimal parallel resource assignment with interference
This page was built for publication: Allocation of interdependent resources for maximal throughput
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4951465)
