Sciweavers

270 search results - page 20 / 54
» Programming with Intervals
Sort
View
DYNAMO
2000
74views more  DYNAMO 2000»
13 years 11 months ago
A framework for remote dynamic program optimization
Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applie...
Michael Voss, Rudolf Eigenmann
ICALP
2009
Springer
14 years 10 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
ISPASS
2006
IEEE
14 years 3 months ago
Characterizing the branch misprediction penalty
Despite years of study, branch mispredictions remain as a significant performance impediment in pipelined superscalar processors. In general, the branch misprediction penalty can...
Stijn Eyerman, James E. Smith, Lieven Eeckhout
INFOCOM
2011
IEEE
13 years 1 months ago
Optimized asynchronous multi-channel neighbor discovery
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...
Niels Karowski, Aline Carneiro Viana, Adam Wolisz
SRDS
2003
IEEE
14 years 3 months ago
Performance and Effectiveness Analysis of Checkpointing in Mobile Environments
Many mathematical models have been proposed to evaluate the execution performance of an application with and without checkpointing in the presence of failures. They assume that th...
Xinyu Chen, Michael R. Lyu