Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5015938> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Q5015938 subject Q7483203.
- Q5015938 subject Q8250013.
- Q5015938 subject Q8335125.
- Q5015938 abstract "In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a CPU cache without having the size of the cache (or the length of the cache lines, etc.) as an explicit parameter. An optimal cache-oblivious algorithm is a cache-oblivious algorithm that uses the cache optimally (in an asymptotic sense, ignoring constant factors). Thus, a cache oblivious algorithm is designed to perform well, without modification, on multiple machines with different cache sizes, or for a memory hierarchy with different levels of cache having different sizes. Cache-oblivious algorithms are contrasted with explicit blocking, as in loop nest optimization, which explicitly breaks a problem into blocks that are optimally sized for a given cache.Optimal cache-oblivious algorithms are known for the Cooley–Tukey FFT algorithm, matrix multiplication, sorting, matrix transposition, and several other problems. Because these algorithms are only optimal in an asymptotic sense (ignoring constant factors), further machine-specific tuning may be required to obtain nearly optimal performance in an absolute sense. The goal of cache-oblivious algorithms is to reduce the amount of such tuning that is required.Typically, a cache-oblivious algorithm works by a recursive divide and conquer algorithm, where the problem is divided into smaller and smaller subproblems. Eventually, one reaches a subproblem size that fits into cache, regardless of the cache size. For example, an optimal cache-oblivious matrix multiplication is obtained by recursively dividing each matrix into four sub-matrices to be multiplied, multiplying the submatrices in a depth-first fashion. In tuning for a specific machine, one may use a hybrid algorithm which uses blocking tuned for the specific cache sizes at the bottom level, but otherwise uses the cache-oblivious algorithm.".
- Q5015938 wikiPageExternalLink FrigoLePr99.pdf.
- Q5015938 wikiPageExternalLink Prokop99.pdf.
- Q5015938 wikiPageExternalLink ~piyush.
- Q5015938 wikiPageExternalLink BRICS2002.
- Q5015938 wikiPageExternalLink lecture15.pdf.
- Q5015938 wikiPageExternalLink chap.pdf.
- Q5015938 wikiPageWikiLink Q13404475.
- Q5015938 wikiPageWikiLink Q1589327.
- Q5015938 wikiPageWikiLink Q163310.
- Q5015938 wikiPageWikiLink Q17082383.
- Q5015938 wikiPageWikiLink Q17090479.
- Q5015938 wikiPageWikiLink Q17092099.
- Q5015938 wikiPageWikiLink Q17092365.
- Q5015938 wikiPageWikiLink Q179310.
- Q5015938 wikiPageWikiLink Q179976.
- Q5015938 wikiPageWikiLink Q223683.
- Q5015938 wikiPageWikiLink Q2565212.
- Q5015938 wikiPageWikiLink Q269878.
- Q5015938 wikiPageWikiLink Q331716.
- Q5015938 wikiPageWikiLink Q352090.
- Q5015938 wikiPageWikiLink Q3531564.
- Q5015938 wikiPageWikiLink Q4043169.
- Q5015938 wikiPageWikiLink Q4388313.
- Q5015938 wikiPageWikiLink Q49108.
- Q5015938 wikiPageWikiLink Q4926939.
- Q5015938 wikiPageWikiLink Q5167446.
- Q5015938 wikiPageWikiLink Q5295.
- Q5015938 wikiPageWikiLink Q5653913.
- Q5015938 wikiPageWikiLink Q6675847.
- Q5015938 wikiPageWikiLink Q671298.
- Q5015938 wikiPageWikiLink Q7483203.
- Q5015938 wikiPageWikiLink Q787114.
- Q5015938 wikiPageWikiLink Q816319.
- Q5015938 wikiPageWikiLink Q8250013.
- Q5015938 wikiPageWikiLink Q8335125.
- Q5015938 wikiPageWikiLink Q8366.
- Q5015938 wikiPageWikiLink Q93028.
- Q5015938 comment "In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a CPU cache without having the size of the cache (or the length of the cache lines, etc.) as an explicit parameter. An optimal cache-oblivious algorithm is a cache-oblivious algorithm that uses the cache optimally (in an asymptotic sense, ignoring constant factors).".
- Q5015938 label "Cache-oblivious algorithm".