Self-adaptive admission control policies for resource-sharing systems Export

@inproceedings{Gupta2009, abstract = {We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variability, with the aim of minimizing the mean response time. It is well known that in such resource sharing systems, as the number of tasks concurrently sharing the resource is increased, the server throughput initially increases, due to more efficient utilization of resources, but starts falling beyond a certain point, due to resource contention and thrashing. Most admission control mechanisms solve this problem by imposing a fixed upper bound on the number of concurrent transactions allowed into the system, called the Multi-Programming-Limit (MPL), and making the arrivals which find the server full queue up. Almost always, the MPL is chosen to be the point that maximizes server efficiency.}, address = {New York, NY, USA}, author = {Gupta, Varun and Balter, Mor H.}, booktitle = {SIGMETRICS '09: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems}, citeulike-article-id = {5457852}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1555349.1555385}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1555349.1555385}, doi = {10.1145/1555349.1555385}, isbn = {978-1-60558-511-6}, keywords = {qos, scheduling}, location = {Seattle, WA, USA}, pages = {311--322}, posted-at = {2009-08-18 07:48:16}, priority = {2}, publisher = {ACM}, title = {Self-adaptive admission control policies for resource-sharing systems}, url = {http://dx.doi.org/10.1145/1555349.1555385}, year = {2009} }

TY - CONF ID - Gupta2009 L3 - citeulike-article-id:5457852 N2 - We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variability, with the aim of minimizing the mean response time. It is well known that in such resource sharing systems, as the number of tasks concurrently sharing the resource is increased, the server throughput initially increases, due to more efficient utilization of resources, but starts falling beyond a certain point, due to resource contention and thrashing. Most admission control mechanisms solve this problem by imposing a fixed upper bound on the number of concurrent transactions allowed into the system, called the Multi-Programming-Limit (MPL), and making the arrivals which find the server full queue up. Almost always, the MPL is chosen to be the point that maximizes server efficiency. CY - Seattle, WA, USA SN - 978-1-60558-511-6 AD - New York, NY, USA EP - 322 TI - Self-adaptive admission control policies for resource-sharing systems PB - ACM T2 - SIGMETRICS '09: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems SP - 311 KW - qos KW - scheduling AU - Gupta, Varun AU - Balter, Mor PY - 2009/// UR - http://dx.doi.org/10.1145/1555349.1555385 ER -