3202 search results - page 362 / 641 » Memory access scheduling |
163
click to vote
PATMOS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The load-store queue (LQ-SQ) of modern superscalar processors is responsible for keeping the order of memory operations. As the performance gap between processing speed a...
152
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
132
click to vote
SIGIR
2003
ACM
15 years 12 months ago
2003
ACM
As a result of the anonymity in todays Web search, it is not possible to receive a personalized search result. Neither prior search results nor search results from other users are ...
162
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
144
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. JH, designed by Wu, is one of the 14 second round candidates in the NIST Hash Competition. This paper presents the first analysis results of JH by using rebound attack. ...