Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach
IEEE Transactions on Parallel and Distributed Systems
Providing Multimedia Traffic with Predictability
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Power-aware QoS Management in Web Servers
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
Joint optimization of hardware and network systems
Journal of Parallel and Distributed Computing
Exact admission-control for integrated aperiodic and periodic tasks
Journal of Computer and System Sciences
Cost-based admission control for Internet Commerce QoS enhancement
Electronic Commerce Research and Applications
Real-Time Robust Adaptive Modeling and Scheduling for an Electronic Commerce Server
EC-Web 2009 Proceedings of the 10th International Conference on E-Commerce and Web Technologies
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
ACM Transactions on Embedded Computing Systems (TECS)
Reliability comparison of schedulability test in ubiquitous computing
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Slack-based multiprocessor scheduling of aperiodic real-time tasks
Real-Time Systems
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
Energy- and performance-aware scheduling of tasks on parallel and distributed systems
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Analysis of an $$M/M/1+G$$M/M/1+G queue operated under the FCFS policy with exact admission control
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Abstract: The proliferation of high-volume time-critical web ser-vices 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). This paper makes two major contributions towards developing an architecture and theoretical foundations for scalable real-time servers operating in dynamic environments. First, we derive a tight utilization bound for schedulability of aperiodic tasks (requests) that allows implementing a constant time schedulability test on the server. We demonstrate that Liu and Layland's schedulable utilization bound of ln 2 does not apply to aperiodic tasks, and prove that an optimal arrival-time independent scheduling policy will meet all aperiodic task deadlines if utilization is maintained below 1 1+ p1=2 . Second, we show that aperiodic deadline-monotonic scheduling is the optimal arrival-time-independent scheduling policy for aperiodic tasks. This result is used to optimally prioritize server requests. Evaluation of a utilization control loop that maintains server utilization below the bound shows that the approach is effective in meeting all individual deadlines in a high performance real-time server.