Sciweavers

1182 search results - page 7 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
TON
2010
126views more  TON 2010»
13 years 2 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
DATE
2009
IEEE
117views Hardware» more  DATE 2009»
14 years 2 months ago
Using dynamic compilation for continuing execution under reduced memory availability
—This paper explores the use of dynamic compilation for continuing execution even if one or more of the memory banks used by an application become temporarily unavailable (but th...
Ozcan Ozturk, Mahmut T. Kandemir
FOCS
1999
IEEE
13 years 11 months ago
Reducing Network Congestion and Blocking Probability Through Balanced Allocation
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...
Malwina J. Luczak, Eli Upfal
PLDI
2010
ACM
14 years 17 days ago
Decoupled lifeguards: enabling path optimizations for dynamic correctness checking tools
Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executa...
Olatunji Ruwase, Shimin Chen, Phillip B. Gibbons, ...
PET
2010
Springer
13 years 11 months ago
Impact of Network Topology on Anonymity and Overhead in Low-Latency Anonymity Networks
Abstract. Low-latency anonymous communication networks require padding to resist timing analysis attacks, and dependent link padding has been proven to prevent these attacks with m...
Claudia Díaz, Steven J. Murdoch, Carmela Tr...