Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services (2001)
| Venue: | In IEEE Real-Time Technology and Applications Symposium |
| Citations: | 31 - 13 self |
BibTeX
@INPROCEEDINGS{Abdelzaher01schedulabilityanalysis,
author = {Tarek F. Abdelzaher and Chenyang Lu},
title = {Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services},
booktitle = {In IEEE Real-Time Technology and Applications Symposium},
year = {2001},
pages = {15--25}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The proliferation of high-volume time-critical web services such as online trading calls for a scalable server design that allows meeting individual response-time guarantees of real-time transactions. A main challenge is to honor these guarantees despite unpredictability in incoming server load. The extremely high volume of real-time service requests mandates constant-time scheduling and schedulability analysis algorithms (as opposed to polynomial or logarithmic ones in the number of current requests).
