Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"cache oblivious"”.

  1. Cache Oblivious Data Structures

    This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching …

    waterloo Repository record for Cache Oblivious Data Structures (opens in a new tab)

  2. Cache-Oblivious Searching and Sorting in Multisets

    … to searching and sorting in multisets in the cache-oblivious model: Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context …

    waterloo Repository record for Cache-Oblivious Searching and Sorting in Multisets (opens in a new tab)

  3. Detecting genomic elements of extreme conservation in higher eukaryotes by integration of hash mapping and cache-oblivious in-memory computing

    … that integrates the ideas of hash mapping and cache-oblivious in-memory computing. Our algorithm leverages the concept of help-me-help-you, where the data structures are tailored to maximize cache-hit while minimizing cache-miss. As a result, our hybrid algorithm is approximately 800 times …

    missouri Repository record for Detecting genomic elements of extreme conservation in higher eukaryotes by integration of hash mapping and cache-oblivious in-memory computing (opens in a new tab)

  4. Algorithms and data structures for cache-efficient computation: theory and experimental evaluation

    The ideal-cache model is an abstraction of the memory hierarchy in modern computers which facilitates the design of algorithms that can use the caches (i.e., memory levels) in the hierarchy efficiently without using the knowledge of cache parameters. In addition to possibly running faster than …

    texas Repository record for Algorithms and data structures for cache-efficient computation: theory and experimental evaluation (opens in a new tab)

  5. Efficient Data Structures for Text Processing Applications

    … efficient solutions for the last problem in both cache-aware and cache-oblivious models.

    ucf Repository record for Efficient Data Structures for Text Processing Applications (opens in a new tab)

  6. Work-Stealing Scheduler for Parallel Cache-Adaptive Algorithms

    … hierarchical memory structures, such as multiple cache levels, main memory, and external storage, pose significant challenges in optimizing memory usage for algorithm efficiency. Traditional models like the Disk Access Model (DAM) and advancements such as cache-oblivious algorithms have focused on …

    wustl Repository record for Work-Stealing Scheduler for Parallel Cache-Adaptive Algorithms (opens in a new tab)

  7. Efficient distance computations of VLMCs in DNA sequencing

    … two VLMCs. This has been shown to currently be cache inefficient. In this thesis, we reduce the execution time and memory access of the d∗ v dissimilarity function, a problem that involves quickly accessing data. We investigated cacheoblivious and other data structures that were adapted to store …

    chalmers Repository record for Efficient distance computations of VLMCs in DNA sequencing (opens in a new tab)

  8. Various Algorithms for High Throughput Sequencing

    … in advance. Using our new index, we design a cache oblivious algorithm that makes an efficient use of the modern hardware to quickly cluster the reads in the dataset according to their position on the reference.Next, we show an algorithm for aligning two-pass Single Molecule Sequencing reads. …

    toronto-retro Repository record for Various Algorithms for High Throughput Sequencing (opens in a new tab)