Results 121 to 130 of about 5,314 (170)
Processor-Aware Cache-Oblivious Algorithms✱
50th International Conference on Parallel Processing, 2021 Frigo et al. proposed an ideal cache model and a recursive technique to design sequential cache-efficient algorithms in a cache-oblivious fashion. Ballard et al. pointed out that it is a fundamental open problem to extend the technique to an arbitrary architecture. Ballard et al.
Yuan Tang, Weiguo Gao
openalex +2 more sources
, 2003 The cache oblivious model is a simple and elegant model to design algorithms that perform well in hierarchical memory models ubiquitous on current systems. This model was first formulated in [321] and has since been a topic of intense research. Analyzing and designing algorithms and data structures in this model involves not only an asymptotic analysis
Matteo Frigo +3 more
+4 more sources
Locality-of-Reference Optimality of Cache-Oblivious Algorithms
, 2022 The program performance on modern hardware is characterized by locality of reference, that is, it is faster to access data that is close in address space to data that has been accessed recently than data in a random location. This is due to many architectural features including caches, prefetching, virtual address translation and the physical ...
Peyman Afshani +4 more
+5 more sources
Cache oblivious algorithms for nonserial polyadic programming
The Journal of Supercomputing, 2007 The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete optimization problems. Although the loops in the nonserial polyadic dynamic programming algorithm are similar to those in matrix multiplication, the available automatic optimization techniques have little effect on this imperfect loop ...
Guangming Tan +2 more
openalex +2 more sources
Cache-oblivious algorithms, a key to better performance
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research - CASCON '10, 2010 The cheapening of CPU cores in recent years, created a very complex set of circumstances. As the number of CPU cores per computer became greater, difficulties arose which meant that memory access became the bottle-neck for performance. CPUs of the current day and age far superseded their predecessors.
Yang Yang, Simon Guo
openalex +2 more sources
Cache-Oblivious Computation: Algorithms and Experimental Evaluation
2007 International Conference on Computing: Theory and Applications (ICCTA'07), 2007 We describe our recent research results on cache-oblivious algorithms for certain types of dynamic programs and triply-nested loop computations, and for priority queues and their application in shortest path problems in graphs. We present some preliminary results from our ongoing experimental work on comparing our cache-oblivious algorithms to ...
Vijaya Ramachandran
openalex +2 more sources
Cache-Oblivious Scanline Algorithm Design
Computer Graphics, Imaging and Visualisation (CGIV 2007), 2007 This paper introduces the concept of cache-oblivious scanline algorithms and their design issues to overcome the limitations of cache size and cache line-length within existing workstations, making them suitable for the visualisation of very large 3D data sets.
Md Mizanur Rahman
openalex +2 more sources
Exponential Structures for Efficient Cache-Oblivious Algorithms
, 2002 We present cache-oblivious data structures based upon exponential structures. These data structures perform well on a hierarchical memory but do not depend on any parameters of the hierarchy, including the block sizes and number of blocks at each level. The problems we consider are searching, partial persistence and planar point location.
Michael A. Bender +2 more
openalex +2 more sources
An Efficient Cache-oblivious Parallel Viterbi Algorithm
, 2016 The Viterbi algorithm is used to find the most likely path through a hidden Markov model given an observed sequence, and has numerous applications. Due to its importance and high computational complexity, several algorithmic strategies have been developed to parallelize it on different parallel architectures.
Rezaul Chowdhury +4 more
openalex +2 more sources
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems
Mathematics in Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masud Hasan +2 more
openalex +2 more sources