Advanced search

Showing result 1 - 5 of 174 essays matching the above criteria.

  1. 1. Cache replacement policies and their impact on graph database operations

    University essay from Lunds universitet/Institutionen för datavetenskap

    Author : Tora Elding Larsson; Lukas Gustavsson; [2024]
    Keywords : Technology and Engineering;

    Abstract : .... READ MORE

  3. 2. Relaxed Priority Queue & Evaluation of Locks

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : Andreas Rudén; Ludvig Andersson; [2023-10-23]
    Keywords : Concurrency; Data Structures; Algorithms; Priority Queue; Semantic Relaxation; Lock-free; Scalability; Performance;

    Abstract : We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. READ MORE

  4. 3. A dynamic approach to sorting with respect to big data

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Filip Almström; [2023]
    Keywords : DynamicSort; sorting; dynamic; big data; comparing; characteristics; run-time;

    Abstract : This study introduces a dynamic approach to sorting, making use of predictions and data gathered during run-time to optimize the sorting of the current data set. This approach is used to develop a sorting algorithm called DynamicSort which partitions data and calculates a partial standard deviation for each partition to determine which of two sorting algorithms should be used to sort the partition. READ MORE

  5. 4. A Study of the Reuse-Distance Behavior of Instructions

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Eduard Ispas; [2023]
    Keywords : ;

    Abstract : Cache replacement policies play a critical role in optimizing the performance of cache memory in computer systems. While policies like Least Recently Used (LRU) are popular, they have proven to be inefficient under certain circumstances. READ MORE

  6. 5. Further Developing Preload Lists for the Tor Network

    University essay from Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Author : Daniel Bahmiary; [2023]
    Keywords : Tor; DNS; Preload list; Crawling; Tor; DNS; Preload lista; Webbkrypning;

    Abstract : A recently proposed defense for the anonymity network Tor uses preload lists of domains to determine what should be cached in the Domain Name System (DNS) caches of Tor relays. The defense protects against attacks that infer what is cached in Tor relays. READ MORE