Zeta

Response time
DOI: 10.1145/2391229.2391241 Publication Date: 2012-11-13T15:04:07Z
ABSTRACT
This paper presents a scheduling model for class of interactive services in which requests are time bounded and lower result quality can be traded shorter execution time. These applications include web search engines, finance servers, other interactive, on-line services. We develop an efficient algorithm, Zeta, that allocates processor among service to maximize the minimize variance response.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (29)
CITATIONS (48)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....