1 / 1

A Cache-Oblivious Implicit Dictionary with the Working Set Property

This research by Jakob Truelsen and Casper Kejlberg-Rasmussen at Aarhus University investigates a cache-oblivious implicit dictionary that adheres to the working set property. The property is defined as n > 2k, ensuring efficient data retrieval and storage mechanisms. The study provides insights into optimizing data structures for massive data algorithms, enhancing computational efficiency, and reducing space complexities. The work is part of MADALGO, a center funded by the Danish National Research Foundation, focusing on advanced data algorithms.

abby
Télécharger la présentation

A Cache-Oblivious Implicit Dictionary with the Working Set Property

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Jakob Truelsen Aarhus University Casper Kejlberg-Rasmussen Aarhus University A Cache-Oblivious Implicit Dictionary with the Working Set Property n 2k 0 iffx = min(x,y) x y 1 iffx = max(x,y) MADALGO – Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation

More Related