3616 search results - page 111 / 724 » Conditional Memory Ordering |
165
click to vote
SBACPAD
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents the cache configuration exploration of a programmable system, in order to find the best matching between the architecture and a given application. Here, prog...
126
click to vote
SAC
1998
ACM
15 years 9 months ago
1998
ACM
In a Video-on-Demand server, requests from different clients are independent of each other and may arrive at random time. Commercial systems may contain hundreds to thousands of c...
120
click to vote
SIGMOD
1998
ACM
15 years 9 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
163
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Safety-criticalembeddedsystems having to meet real-time constraints are to be highlypredictable in order to guarantee at design time that certain timing deadlines will always be m...
125
Voted
SIAMSC
2008
15 years 4 months ago
2008
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...