Sökning: "OpenMP"

Visar resultat 1 - 5 av 14 avhandlingar innehållade ordet OpenMP.

1. 1. Improving Performance and Quality-of-Service through the Task-Parallel Model​ : Optimizations and Future Directions for OpenMP

   Författare :Artur Podobas; Mats Brorsson; Georgi Gaydadjiev; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Task Parallel; OpenMP; Scheduling; OmpSs; multicore; manycore; Datalogi; Computer Science;

   Sammanfattning : With the failure of Dennard's scaling, which stated that shrinking transistors will be more power-efficient, computer hardware has today become very divergent. Initially the change only concerned the number of processor on a chip (multicores), but has today further escalated into complex heterogeneous system with non-intuitive properties -- properties that can improve performance and power consumption but also strain the programmer expected to develop on them. LÄS MER

3. 2. Improving OpenMP Productivity with Data Locality Optimizations and High-resolution Performance Analysis

   Författare :Ananya Muddukrishna; Mats Brorsson; Nawal Copty; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; OpenMP; Performance Analysis; Scheduling; Locality Optimizations;

   Sammanfattning : The combination of high-performance parallel programming and multi-core processors is the dominant approach to meet the ever increasing demand for computing performance today. The thesis is centered around OpenMP, a popular parallel programming API standard that enables programmers to quickly get started with writing parallel programs. LÄS MER

4. 3. Multithreaded PDE Solvers on Non-Uniform Memory Architectures

   Författare :Markus Nordén; Michael Thuné; Sverker Holmgren; Xing Cai; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; PDE solver; high-performance; NUMA; UMA; OpenMP; MPI; data migration; data replication; thread scheduling; data affinity; Beräkningsvetenskap; Scientific Computing;

   Sammanfattning : A trend in parallel computer architecture is that systems with a large shared memory are becoming more and more popular. A shared memory system can be either a uniform memory architecture (UMA) or a cache coherent non-uniform memory architecture (cc-NUMA). LÄS MER

5. 4. Locality-aware Scheduling and Characterization of Task-based Programs

   Författare :Ananya Muddukrishna; Mats Brorsson; Christoph Kessler; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Locality-aware; Task scheduling; OpenMP; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : Modern computer architectures expose an increasing number of parallel features supported by complex memory access and communication structures. Currently used task scheduling techniques perform poorly since they focus solely on balancing computation load across parallel features and remain oblivious to locality properties of support structures. LÄS MER

7. 5. Iterative and Adaptive PDE Solvers for Shared Memory Architectures

   Författare :Henrik Löf; Jarmo Rantakokko; Sverker Holmgren; Erik Hagersten; Mark Bull; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; partial differential equations; iterative methods; finite elements; conjugate gradients; adaptive mesh refinement; multigrid; cc-NUMA; distributed shared memory; OpenMP; page migration; TLB shoot-down; bandwidth minimization; reverse Cuthill-McKee; migrate-on-next-touch; affinity; temporal locality; chip multiprocessors; CMP; Beräkningsvetenskap; Scientific Computing;

   Sammanfattning : Scientific computing is used frequently in an increasing number of disciplines to accelerate scientific discovery. Many such computing problems involve the numerical solution of partial differential equations (PDE). LÄS MER