Sökning: "parallel algorithm"

Visar resultat 21 - 25 av 241 avhandlingar innehållade orden parallel algorithm.

1. 21. Performance characterization and evaluation of parallel PDE solvers

   Författare :Henrik Johansson; Jarmo Rantakokko; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Beräkningsvetenskap; Scientific Computing;

   Sammanfattning : Computer simulations that solve partial differential equations (PDEs) are common in many fields of science and engineering. To decrease the execution time of the simulations, the PDEs can be solved on parallel computers. For efficient parallel implementations, the characteristics of both the hardware and the PDE solver must be taken into account. LÄS MER

3. 22. On adaptive sorting in sequential and parallel models

   Författare :Ola Petersson; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : Sorting is probably the most well-studied problem in computer science. In many applications the elements to be sorted are not randomly distributed, but are already nearly ordered. Most existing algorithms do not take advantage of this fact. LÄS MER

4. 23. Data Movement on Emerging Large-Scale Parallel Systems

   Författare :Ivy Bo Peng; Erwin Laure; Stefano Markidis; Bronis R. de Supinski; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

   Sammanfattning : Large-scale HPC systems are an important driver for solving computational problems in scientific communities. Next-generation HPC systems will not only grow in scale but also in heterogeneity. This increased system complexity entails more challenges to data movement in HPC applications. LÄS MER

5. 24. A scalable data structure for a parallel data server

   Författare :Jonas S. Karlsson; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : Modern and future applications, such as in the telecommunication industry and real-time systems, store and manage very large amounts of information. This information needs to be accessed and searched with high performance, and it must have high availability. Databases are traditionally used for managing high volumes of data. LÄS MER

7. 25. Methods for Network Optimization and Parallel Derivative-free Optimization

   Författare :Per-Magnus Olsson; Kaj Holmberg; Athanasios Migdalas; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Derivative-free; parallelization; Steiner tree; constrained shortest path; unmanned aerial vehicles;

   Sammanfattning : This thesis is divided into two parts that each is concerned with a specific problem.The problem under consideration in the first part is to find suitable graph representations, abstractions, cost measures and algorithms for calculating placements of unmanned aerial vehicles (UAVs) such that they can keep one or several static targets under constant surveillance. LÄS MER