Search for dissertations about: "sorting memory"

Showing result 1 - 5 of 15 swedish dissertations containing the words sorting memory.

2. 1. Concurrent Algorithms and Data Structures for Many-Core Processors

   Author : Daniel Cederman; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; composition; sorting; graphics processors; lock-free; software transactional memory; parallel; load balancing; multi-core;

   Abstract : The convergence of highly parallel many-core graphics processors with conventional multi-core processorsis becoming a reality.To allow algorithms and data structures to scale efficiently on these new platforms,several important factors needs to be considered. READ MORE

4. 2. Gaze control in episodic memory

   Author : Linus Holm; Timo Mäntylä; Bruno Laeng; Umeå universitet; []
   Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Psychology; Psykologi; Psychology; psykologi; Psychology; psykologi;

   Abstract : The role of gaze control in episodic recognition was investigated in two studies. In Study 1, participants encoded human faces inverted or upright, with or without eye movements (Experiment 1) and under sorting or rating tasks (Experiment 2) respectively. READ MORE

5. 3. A robust scheduling technique for fine-grain real-time computations

   Author : Annika Olsson; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; real-time systems; time-deterministic communication; fine-grain parallelism; sorting memory; multiprocessor architectures; robustness; data flow; scheduling technique; jitter tolerance; data-driven execution model;

   Abstract : .... READ MORE

6. 4. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming

   Author : Thomas Petig; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Message Passing; Wireless Networks; Time Division Multiple Access; Shared Memory; Fault-Tolerance; Streaming; NP-Hardness; Distributed Algorithm; Optimisation; TDMA;

   Abstract : Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. READ MORE

7. 5. Structures of String Matching and Data Compression

   Author : N Jesper Larsson; Institutionen för datavetenskap; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Implementation; Burrows-Wheeler Transform; Sliding Window; Suffix Sorting; Text Compression; Algorithms; Suffix Tree; Systems engineering; computer technology; Data- och systemvetenskap;

   Abstract : This doctoral dissertation presents a range of results concerning efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It comprises both theoretic results and practical implementations. READ MORE