Sciweavers

1182 search results - page 66 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
IMC
2005
ACM
14 years 3 months ago
The Power of Slicing in Internet Flow Measurement
Flow measurement evolved into the primary method for measuring the composition of Internet traffic. Large ISPs and small networks use it to track dominant applications, dominant ...
Ramana Rao Kompella, Cristian Estan
GLOBECOM
2006
IEEE
14 years 4 months ago
Two-phase Collision Avoidance to Improve Scalability in Wireless LANs
— IEEE 802.11 DCF exhibits poor scalability due to the large contention overhead. Therefore, the more the number of stations, the less the aggregate throughput. We propose a two-...
Seongil Han, Yongsub Nam, Yongho Seok, Taekyoung K...
PLDI
2010
ACM
14 years 7 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
VLDB
2007
ACM
95views Database» more  VLDB 2007»
14 years 10 months ago
The GCX System: Dynamic Buffer Minimization in Streaming XQuery Evaluation
In this demonstration, we present the main-memory based streaming XQuery engine GCX which implements novel buffer management strategies that combine static and dynamic analysis to...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
ECRTS
2006
IEEE
14 years 4 months ago
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo