Sciweavers

86 search results - page 9 / 18
» Avoiding Shared Clocks in Networks of Timed Automata
Sort
View
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 7 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
FSTTCS
2005
Springer
14 years 1 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
PDP
2005
IEEE
14 years 1 months ago
Memory Bandwidth Aware Scheduling for SMP Cluster Nodes
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...
Evangelos Koukis, Nectarios Koziris
DC
2008
13 years 7 months ago
Contention-free MAC protocols for asynchronous wireless sensor networks
A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of a MAC protocol are: it should be contention-free (avoid collisio...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
COMCOM
2008
100views more  COMCOM 2008»
13 years 7 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez