The data-parallel Ada run-time system, simulation and empirical results

Mayer, Hermann; Jähnichen, Stefan

doi:10.1109/ipps.1993.262808

Cited by 8 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The non-recursive subprogram case is perhaps the simplest, since there is only one call involved and thus there is no need for a parallelism strategy such as work-sharing, work-seeking, or work-stealing 8 , nor is there a need for reduction. In addition, there are no specific restrictions on the parameter profile of the subprogram, and the compiler writer can implement the calls without the need for library support 9 .…”

Section: Non-recursive Subprogramsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Parallel programming in Ada was considered several years ago ( [8,9,10]). Mayer and Jahnichen [8] introduce a parallel keyword, which applies to for loops, allowing a specific compiler to optimize loop iterations, targeted to a multiprocessor platform. Hind and Schonberg [9] also targeted the optimization of parallel loops, introducing the concept of lightweight (mini) tasks, to reduce the overhead of using tasks for parallelism.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

Michell

Moore

Pinho

2013

Reliable Software Technologies – Ada-Europe 2013

View full text Add to dashboard Cite

The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propose a standard interface and show how it can be extended by the user or library writers to implement their own parallelization strategies.Abstract. The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propose a standard interface and show how it can be extended by the user or library writers to implement their own parallelization strategies.

show abstract

Section: Non-recursive Subprogramsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

Michell

Moore

Pinho

2013

Reliable Software Technologies – Ada-Europe 2013

View full text Add to dashboard Cite

show abstract

“…[13,14,15]) 2 . The work in [13] introduces a parallel keyword, for for loops, allowing a specific compiler to optimize loop iterations, targeted to a multiprocessor platform.…”

Section: Parallel Programming and Adamentioning

confidence: 99%

“…[13,14,15]) 2 . The work in [13] introduces a parallel keyword, for for loops, allowing a specific compiler to optimize loop iterations, targeted to a multiprocessor platform. The work in [14] is similar, as it also targets the optimization of parallel loops; furthermore, the authors state that Ada tasks are not the appropriate unit of parallelization thus proposing a concept of minitasks which can be optimized by compilers and runtimes aware of this model.…”

Section: Parallel Programming and Adamentioning

confidence: 99%

A parallel programming model for ada

Ali

Pinho

2011

Ada Lett.

View full text Add to dashboard Cite

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone.To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

show abstract

Practical Integer Sorting on Shared Memory

Bahig

Daoud

2005

High Performance Computing and Communications

View full text Add to dashboard Cite

The data-parallel Ada run-time system, simulation and empirical results

Cited by 8 publications

References 3 publications

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

Tasklettes – A Fine Grained Parallelism for Ada on Multicores

A parallel programming model for ada

Practical Integer Sorting on Shared Memory

Contact Info

Product

Resources

About