| 
|
QuoteRef: argeL9_2000
Topic:
memory cache
Topic:
code optimization
Reference
Arge, L., Chase, J., Vitter, J.S., Wickremesinghe, R., "Efficient sorting using registers and caches", in Naher, S., Wagner, D. (ed.), Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrucken, Germany, September 2000, Springer, LNCS 1675, pp. 51-62. Google
abstract ;;Quote: R-MERGE is a cache-conscious sorting algorithm; uses mergesort and quicksort to avoid memory stalls; 10% to 36% speedup
54 ;;Quote: algorithms should reduce memory stalls as well as instructions; sequential access is faster than random access; using registers wins on both counts
Topic: memory cache (29 items)
Topic: code optimization (54 items)