Results 11 to 20 of about 5,314 (170)
Engineering a cache-oblivious sorting algorithm [PDF]
ACM Journal of Experimental Algorithmics, 2007 This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort and compare the final algorithm with Quicksort, the established standard for comparison-based sorting, as well as with recent ...
Gerth Stølting Brodal +2 more
openalex +7 more sources
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model [PDF]
, 2012 In this paper we present randomized algorithms for sorting and convex hull that achieves optimal performance (for speed-up and cache misses) on the multicore model with private cache model. Our algorithms are cache oblivious and generalize the randomized divide and conquer strategy given by Reischuk and Reif and Sen.
Neeraj Sharma, Sandeep Sen
openalex +3 more sources
The Cache Complexity of Multithreaded Cache Oblivious Algorithms [PDF]
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matteo Frigo, Volker Strumpen
openalex +3 more sources
04301 Abstracts Collection – Cache-Oblivious and Cache-Aware Algorithms
, 2005 The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl, from 18.07.2004 to 23.07.2004. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed.
Lars Arge +4 more
openalex +4 more sources
BRICS Report Series, 2004 We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with non-negative edge weights. For the SSSP problem, our result closes the performance gap between the currently best <em>cache-aware</em> algorithm ...
Gerth Stølting Brodal +3 more
openalex +6 more sources
Cache-Oblivious Algorithms and Data Structures [PDF]
, 2004 Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms.
Gerth Stølting Brodal
openalex +3 more sources
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters [PDF]
, 2013 In many scientific applications it is required to reconstruct a raster dataset many times, each time using a different resolution. This leads to the following problem; let \(\mathcal{G}\) be a raster of \(\sqrt{N}\) x \(\sqrt{N}\) cells. We want to compute for every integer 2 \(\leq \mu \leq \sqrt{N}\) a raster \(\mathcal{G}_\mu\) of [\(\sqrt{N}/\mu\)]
Lars Arge +3 more
+7 more sources
A Cache Oblivious Algorithm for Matrix Multiplication Based on Peano’s Space Filling Curve
, 2006 Cache oblivious algorithms are algorithms that are designed to inherently exploit any kind of cache memory—regardless of its size or architecture. In this article, we discuss a cache oblivious algorithm for matrix multiplication. The elements of the matrices are stored according to a Peano space filling curve.
Michael Bäder, Christoph Zenger
openalex +3 more sources
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract] [PDF]
, 2019 Guy E. Blelloch, Yan Gu
openalex +2 more sources
Cache efficient simple dynamic programming [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's context-free language recognition algorithm are designed, implemented, analyzed, and empirically evaluated with timing studies and cache simulations.
Cary Cherng, Richard E. Ladner
doaj +1 more source