Sciweavers

3927 search results - page 350 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
IEEEPACT
2000
IEEE
15 years 11 months ago
Exploring Sub-Block Value Reuse for Superscalar Processors
The performance potential of a value reuse mechanism depends on its reuse detection time, the number of reuse opportunities, and the amount of work saved by skipping each reuse un...
Jian Huang, David J. Lilja
DKE
2006
67views more  DKE 2006»
15 years 7 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
ASPLOS
1994
ACM
15 years 11 months ago
Reactive Synchronization Algorithms for Multiprocessors
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
Beng-Hong Lim, Anant Agarwal
MIDDLEWARE
2007
Springer
16 years 1 months ago
The case for aspect-oriented reflective middleware
The emergence of applications domains such as pervasive and autonomic computing has increased the need for customisation and dynamic adaptation of both distributed systems, and th...
Paul Grace, Eddy Truyen, Bert Lagaisse, Wouter Joo...
CASES
2003
ACM
16 years 4 days ago
Frequent loop detection using efficient non-intrusive on-chip hardware
Dynamic software optimization methods are becoming increasingly popular for improving software performance and power. The first step in dynamic optimization consists of detecting ...
Ann Gordon-Ross, Frank Vahid