Search for dissertations about: "best execution"

Showing result 11 - 15 of 46 swedish dissertations containing the words best execution.

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

4. 12. Autonomic Management of Partitioners for SAMR Grid Hierarchies

   Author : Henrik Johansson; Jarmo Rantakokko; Michael Thuné; Johan Steensland; Manish Parashar; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Beräkningsvetenskap; Scientific Computing;

   Abstract : Parallel structured adaptive mesh refinement methods decrease the execution time and memory usage of partial differential equation solvers by adaptively assigning computational resources to regions with large solution errors. These methods result in a dynamic grid hierarchy. READ MORE

5. 13. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications

   Author : Petros Voudouris; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Scheduling; Multiprocessor; WCET; Uniform; Hard; multicore; Related; DAG; Real-Time; Dynamic; Unrelated; Makespan; Homogeneous; Parallel; Identical;

   Abstract : To use multiprocessors in hard real-time systems, schedulability analysis is needed to provide formally proven guarantees for the timing behavior of the system. Programming models for parallel applications, such as OpenMP, use pragmas to specify parts of the application as parallel tasks, for example, a function or a body of a loop. READ MORE

6. 14. Towards Scalable Performance Analysis of MPI Parallel Applications

   Author : Xavier Aguilar; Erwin Laure; David Black-Schaffer; KTH; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; parallel computing; performance monitoring; performance tools; event flow graphs; Computer Science; Datalogi;

   Abstract :   A considerably fraction of science discovery is nowadays relying on computer simulations. High Performance Computing  (HPC) provides scientists with the means to simulate processes ranging from climate modeling to protein folding. READ MORE

7. 15. Model Checking of Software Systems under Weak Memory Models

   Author : Tuan-Phong Ngo; Mohamed Faouzi Atig; Parosh Aziz Abdulla; Philipp Rümmer; Viktor Vafeiadis; Uppsala universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Model checking; Concurrent program; Weak memory model; Computer Science; Datavetenskap;

   Abstract : When a program is compiled and run on a modern architecture, different optimizations may be applied to gain in efficiency. In particular, the access operations (e.g., read and write) to the shared memory may be performed in an out-of-order manner, i. READ MORE