Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints (Q2018944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.9343851208686828
0 references
0.8962226510047913
0 references
0.8749948740005493
0 references
0.7317789196968079
0 references
0.7252986431121826
0 references
