Hierarchical Parallelism Control for Multigrain Parallel Processing

Obata, Motoki; Shirako, Jun; Kaminaga, H.; Ishizaka, Kazuhisa; Kasahara, Hironori

doi:10.1007/11596110_3

Cited by 25 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple example is the initialization of multi-dimensional Kokkos::View. Simply parallelizing over one dimension and then iterating serially over the others often does not expose enough parallelism to leverage all architectures [8], [19]. Consider a 3D View of extents 200 Â 200 Â 200.…”

Section: Mdrangepolicymentioning

confidence: 99%

Kokkos 3: Programming Model Extensions for the Exascale Era

Trott

Lebrun-Grandié

Arndt

et al. 2022

IEEE Trans. Parallel Distrib. Syst.

241

View full text Add to dashboard Cite

As the push towards exascale hardware has increased the diversity of system architectures, performance portability has become a critical aspect for scientific software. We describe the Kokkos Performance Portable Programming Model that allows developers to write single source applications for diverse high-performance computing architectures. Kokkos provides key abstractions for both the compute and memory hierarchy of modern hardware. We describe the novel abstractions that have been added to Kokkos version 3 such as hierarchical parallelism, containers, task graphs, and arbitrary-sized atomic operations to prepare for exascale era architectures. We demonstrate the performance of these new features with reproducible benchmarks on CPUs and GPUs.

show abstract

Section: Mdrangepolicymentioning

confidence: 99%

Kokkos 3: Programming Model Extensions for the Exascale Era

Trott

Lebrun-Grandié

Arndt

et al. 2022

IEEE Trans. Parallel Distrib. Syst.

241

View full text Add to dashboard Cite

show abstract

“…Their effort concentrates on translation of global shared variables, implementation of the reduction clause and synchronization directives. Task based implementations in the nano-threads [13] programming model represent program as task graphs representing hierarchical parallelism. As part of our earlier work [14] we used SMARTS runtime system to create data flow execution model using a task based translation.…”

Section: A Implementationmentioning

confidence: 99%

Parallelizing ultrasound image processing using OpenMP on multicore embedded systems

Huang

Stotzer

et al. 2012

2012 IEEE Global High Tech Congress on Electronics

View full text Add to dashboard Cite

The shift towards multicore architectures poses significant challenges to the programmers. Unlike programming on single core architectures, multicore architectures require the programmer to decide on how the work needs to be distributed across multiple processors. In this contribution, we analyze the needs of a high-level programming model to program multicore architectures. We use OpenMP as the high-level programming model to increase programmer productivity, reduce time to market and development/design costs for these systems. In this work, we have explored the medical ultrasound application using OpenMP on a TI-based Tomahawk platform that is a six-core, high performance multicore DSP system. This application is heavily based on image processing and the goal is to achieve desired level of image quality. We have explored the different cache configurations of the system. In this process, we were able to study the performance impacts of data locality when data objects are placed into different components of the Tomahawk memory system.

show abstract

“…Other source-to-source research compilers such as Oscar [25] and Cetus [26] simply do not support the C99 standard.…”

Section: Related Workmentioning

confidence: 99%

Effects Dependence Graph: A Key Data Concept for C Source-to-Source Compilers

Lossing¹,

Guillou²,

Irigoin³

2016

2016 IEEE 16th International Working Conference on Source Code Analysis and Manipulation (SCAM)

View full text Add to dashboard Cite

International audienceOptimizations, transformations and analyses are applied to programs by compilers at the intermediate representation level, which usually does not include explicit variable declarations. This description level is fine for middle-ends and for source-to-source optimizers of simple languages. Meanwhile, the C language has become much more flexible since the C99standard, and let variable and type declarations appear almost anywhere in source code.We present in this paper a new concept to manage C99 declarations in a source-to-source compiler: the Effects Dependence Graph, which is an extension of the classical Data Dependence Graph. It deals particularly efficiently with user-defined type declarations or dependent types like Variable-Length Array. It is also interesting because no legal scheduling transformationis hindered and because existing algorithms are either not or slightly modified. Finally it reduces the need for variable, struct and array privatization or live range analyses in automatic parallelizers.To the best of our knowledge, the declaration issue is ignored in the literature: existing C source-to-source compilers either do not support C99, or accept only restricted portions of code, and production compilers use low-level intermediate representations, possibly with annotations. In this way our solution addresses a wider range of compiler analysis issues

show abstract

Hierarchical Parallelism Control for Multigrain Parallel Processing

Cited by 25 publications

References 14 publications

Kokkos 3: Programming Model Extensions for the Exascale Era

Kokkos 3: Programming Model Extensions for the Exascale Era

Parallelizing ultrasound image processing using OpenMP on multicore embedded systems

Effects Dependence Graph: A Key Data Concept for C Source-to-Source Compilers

Contact Info

Product

Resources

About