Sciweavers

16 search results - page 2 / 4
» Quantifying the Properties of SRPT Scheduling
Sort
View
WIOPT
2006
IEEE
13 years 11 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
FORMATS
2007
Springer
13 years 12 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
TMM
2002
81views more  TMM 2002»
13 years 5 months ago
Staggered push - a linearly scalable architecture for push-based parallel video servers
With the rapid performance improvements in low-cost PCs, it becomes increasingly practical and cost-effective to implement large-scale video-on-demand (VoD) systems around parallel...
Jack Y. B. Lee
MASCOTS
2004
13 years 7 months ago
Performance Engineering with the UML Profile for Schedulability, Performance and Time: A Case Study
We describe the application of a performance engineering methodology based on UML diagrams with annotations taken from the Profile for Schedulability, Performance and Time. The me...
Andrew J. Bennett, A. J. Field
PAM
2007
Springer
13 years 12 months ago
A Measurement Study of Scheduler-Based Attacks in 3G Wireless Networks
Though high-speed (3G) wide-area wireless networks have been rapidly proliferating, little is known about the robustness and security properties of these networks. In this paper, w...
Soshant Bali, Sridhar Machiraju, Hui Zang, Victor ...