Results 131 to 140 of about 5,314 (170)
Cache oblivious algorithm of average filtering in image processing
2012 International Conference on Informatics, Electronics & Vision (ICIEV), 2012 Cache oblivious algorithms are cache conscious and cache efficient algorithms, independent of cache size of the computer system. We consider the simple average filtering algorithm in the field of image processing. This algorithm is used for image enhancement technique. The algorithm incurs huge number of cache misses while it processes the image matrix.
Mrityunjay Ghosh, Srabani Mukhopadhyaya
openalex +2 more sources
2013 International Conference on Emerging Trends in Communication, Control, Signal Processing and Computing Applications (C2SPCA), 2013 Cache oblivious algorithms are designed to get the good benefit from any of the underlying hierarchy of caches without the need to know about the exact structure of the cache. These algorithms are cache oblivious i.e., no variables are dependent on hardware parameters such as cache size and cache line length.
Ch Sree Kumar, Bramhadev Pattnaik
openalex +2 more sources
Cache-Oblivious Algorithms and Matrix Formats for Computations on Interval Matrices
, 2012 The paper considers the use of cache-oblivious algorithms and matrix formats for computations on interval matrices. We show how the efficient use of cache is of less importance in interval computations than in traditional floating-point ones. For interval matrices there are more important factors, like the number of rounding modes switches or the ...
Rafał Dabrowski +1 more
openalex +2 more sources
A cache-oblivious engineering of the G2V algorithm for computing Gröbner bases
ACM Communications in Computer Algebra, 2013 Fatima K. Abu Salem
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cache-Oblivious Comparison-Based Algorithms on Multisets
2005We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (the mode). We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under which cache size and block size are ...
FARZAN A +3 more
openaire +3 more sources
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017Iterative wavefront algorithms for evaluating dynamic programming recurrences exploit optimal parallelism but show poor cache performance. Tiled-iterative wavefront algorithms achieve optimal cache complexity and high parallelism but are cache-aware and hence are not portable and not cache-adaptive. On the other hand, standard cache-oblivious recursive
Rezaul Chowdhury +3 more
openaire +1 more source
An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
SIAM Journal on Computing, 2007We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations in $O(\frac{1}{B}\log_{M/B}\frac{N}{B})$ amortized memory transfers, where $M$ and $B$ are the memory and block transfer sizes of any two consecutive levels of a multilevel memory hierarchy. In a cache-oblivious data structure,
Lars Arge +4 more
openaire +1 more source
Efficient Parallel Cache-Oblivious Sorting Algorithms
2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 2022Manas Kumar Panda, G. Sajith
openaire +1 more source
Clinical management of metastatic colorectal cancer in the era of precision medicine
Ca-A Cancer Journal for Clinicians, 2022, Davide Ciardiello, Giulia Martini
exaly
The Arithmetic Optimization Algorithm
Computer Methods in Applied Mechanics and Engineering, 2021Laith Mohammad Abualigah +2 more
exaly