Sciweavers

16 search results - page 1 / 4
» Quantifying the Properties of SRPT Scheduling
Sort
View
MASCOTS
2003
13 years 6 months ago
Quantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
Mingwei Gong, Carey L. Williamson
CN
2006
93views more  CN 2006»
13 years 5 months ago
Revisiting unfairness in Web server scheduling
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Ti...
Mingwei Gong, Carey L. Williamson
RTS
2008
74views more  RTS 2008»
13 years 4 months ago
Quantifying and suppressing the measurement disturbance in feedback controlled real-time systems
In the control of continuous and physical systems, the controlled system is sampled sufficiently fast to capture the dynamics of the system. In general, this property cannot be app...
Mehdi Amirijoo, Jörgen Hansson, Svante Gunnar...
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 3 days ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
FMCAD
2006
Springer
13 years 9 months ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch