Sciweavers

1661 search results - page 115 / 333
» Real-time specification patterns
Sort
View
RTAS
2005
IEEE
15 years 7 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
TACAS
2004
Springer
107views Algorithms» more  TACAS 2004»
15 years 7 months ago
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
Pavel Krcál, Wang Yi
RTAS
2003
IEEE
15 years 7 months ago
Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network
This paper presents a novel approach for calculating a probabilistic worst-case response-time for messages in the Controller Area Network (CAN). CAN uses a bit-stuffing mechanism...
Thomas Nolte, Hans Hansson, Christer Norström
CCS
2010
ACM
15 years 4 months ago
Fast-flux service network detection based on spatial snapshot mechanism for delay-free detection
Capturing Fast-Flux Service Networks (FFSNs) by temporal variances is an intuitive way for seeking to identify rapid changes of DNS records. Unfortunately, the features regard to ...
Si-Yu Huang, Ching-Hao Mao, Hahn-Ming Lee
AIRWEB
2008
Springer
15 years 3 months ago
A large-scale study of automated web search traffic
As web search providers seek to improve both relevance and response times, they are challenged by the ever-increasing tax of automated search query traffic. Third party systems in...
Gregory Buehrer, Jack W. Stokes, Kumar Chellapilla