Advanced search

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

  1. 1. 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

  3. 2. 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

  4. 3. 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

  5. 4. A General Purpose Near Data Processing Architecture Optimized for Data-intensive Applications

    University essay from Lunds universitet/Institutionen för elektro- och informationsteknik

    Author : Xingda Li; Haidi Hu; [2023]
    Keywords : Technology and Engineering;

    Abstract : In recent years, as Internet of Things (IoT) and machine learning technologies have advanced, there has been increasing interest in the study of energy-efficient and flexible architectures for embedded systems. To bridge the performance gap between microprocessors and memory systems, Near-Data Processing (NDP) was introduced. READ MORE

  6. 5. Cache behaviour analysis for graph algorithms

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Johan Söderström; [2023]
    Keywords : ;

    Abstract : Graph processing is an ever-increasing significant area of research in the wake of the demand for efficient tools that process data such as graphs, which can describe sets of objects (vertices) and their relations to each other (edges). Graph algorithms traverse these graphs by visiting their vertices or additionally calculating some properties about them such as how significant a specific vertex is in the context of the greater graph. READ MORE