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.

MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Cache-efficient structures. B-...

Компания Google представила новый поисковый сервис cs.opensource.google, предназначенный для поиска по коду в git-репозиториях открытых проектов, разработка которых ведётся при участии Google. Из проиндексированных проектов отмечаются Angular, Bazel, Dart, ExoPlayer, Firebase SDK, Flutter, Go, gVisor, Kythe, Nomulus, Outline и Tensorflow. Аналогичные поисковые системы ранее были запущены для поиска по коду Chromium и Android.