Search for dissertations about: "data partitioning"

Showing result 1 - 5 of 168 swedish dissertations containing the words data partitioning.

2. 1. Data Partitioning Methods and Parallel Block-Oriented PDE Solvers

   Author : Jarmo Rantakokko; Michael Thuné; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; data assimilation; data partitioning; meteorology; multiblock; Navier-Stokes; object-oriented; oceanography; parallel computing; Numerical Analysis; Numerisk analys;

   Abstract : Data partitioning methods for block-structured problems within scientific computing have been studied. The applications are variational data assimilation in meteorology, ocean modeling, and airflow simulation with multiblock grids. READ MORE

4. 2. Efficient Partitioning of Dynamic Structured Grid Hierarchies

   Author : Johan Steensland; Michael Thuné; Jarmo Rantakokko; Charles Norton; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; scientific computing; partitioning; structured grids; adaptive mesh refinement; dynamic load balancing; Beräkningsvetenskap; Scientific Computing;

   Abstract : This thesis aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications executing on general parallel computers. The key contributions are (1) A conceptual dynamically adaptive meta-partitioner able to select and configure an appropriate partitioning technique, based on application and computer state, and (2) A characterization of new and existing domain-based partitioners, enabling a mapping from application and computer state onto appropriate partitioners, and (3) Sketched scalable solutions, expressed in terms of natural regions and expert algorithms, for the problem to efficiently partition large-scale SAMR applications with deep grid hierarchies executing on general parallel computers, and (4) A software partitioning tool Nature+Fable, implementing the greater parts of these sketched scalable solutions and engineered as part of the meta-partitioner. READ MORE

5. 3. Graph Partitioning and Planted Partitions

   Author : Mikael Onsjö; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

   Abstract : Graph partitioning is the problem of splitting a graph into two or morepartitions of fixed sizes while minimizing the number of edges that are “cut”.This is an important problem with a wide range of applications in fields suchas VLSI design, parallel processing, bioinformatics, data mining etc. READ MORE

6. 4. Adaptive Resource Management Techniques for High Performance Multi-Core Architectures

   Author : Nadja Holtryd; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Cache Partitioning; Bandwidth Partitioning; Resource Management; Performance Isolation; Multi-Core Architectures; Prefetch Throttling;

   Abstract : Reducing the average memory access time is crucial for improving the performance of applications executing on multi-core architectures. With workload consolidation this becomes increasingly challenging due to shared resource contention. Previous works has proposed techniques for partitioning of shared resources (e.g. READ MORE

7. 5. Studies in Applied Data Structures

   Author : Kurt Swanson; Institutionen för datavetenskap; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; Sparse Matrix; Suffix Tree; Roundness; Range searching; Data- och systemvetenskap; computer technology;

   Abstract : The design of efficient data structures is of primary importance in creation of theoretical algorithms as well their more tangible descendants, computer programs. In this dissertation we study computational aspects of data structures and their respective algorithms from a theoretical viewpoint, which are however of direct importance in the implementation of solutions for real-world problems. READ MORE