Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints (Q2018944): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:25, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints |
scientific article |
Statements
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints (English)
0 references
26 March 2015
0 references
queueing networks
0 references
stochastic bin packing
0 references
greedy random algorithm
0 references
infinite server system
0 references
fluid limit
0 references
cloud computing
0 references
virtual machine
0 references
