Sciweavers

83 search results - page 10 / 17
» Test point insertion based on path tracing
Sort
View
101
Voted
INFOCOM
2006
IEEE
15 years 5 months ago
Scalable Clustering of Internet Paths by Shared Congestion
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
CGO
2003
IEEE
15 years 3 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 1 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 5 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
IMC
2005
ACM
15 years 5 months ago
Poisson versus Periodic Path Probing (or, Does PASTA Matter?)
Abstract— The well-known PASTA (“Poisson Arrivals See Time Averages”) property states that, under very general conditions, the fraction of Poisson arrivals that observe an un...
Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Cons...