Parallelism in Ada: Status and Prospects

Pinho, Luís Miguel; Moore, Brad; Michell, Stephen

doi:10.1007/978-3-319-08311-7_8

Cited by 4 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tasklets are considered to be blocked when they are waiting for a resource, which is not an executor nor a core (e.g. executing an entry call) 4 .…”

Section: Progressmentioning

confidence: 99%

“…As specified in the model [4] and presented in the introduction, tasklets run at the priority (and/or with the deadline) of the associated task. We consider that each Ada task (or priority) is provided with a specific executor pool, where all executors carry the same priority and deadline of the task and share the same budget and quantum.…”

Section: Modelmentioning

confidence: 99%

“…This work is part of an ongoing effort to incorporate fine-grained parallelism models and constructs into existing programming languages, such as CPLEX (for C Parallel Language Extensions) [1], the C++ "Technical Specification for C++ Extensions for Parallelism" [2], or, the topic of this work, the tasklet model for Ada [3,4,5].…”

Section: Introductionmentioning

confidence: 99%

“…This model is refined in [4], where each Ada task is seen as an execution graph of execution of multiple control-dependent tasklets using a fork-join model. Tasklets can be spawned by other tasklets (fork), and need to synchronize with the spawning tasklet (join).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Execution Model for Fine-Grained Parallelism in Ada

Pinho¹,

Moore

Michell

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper extends the authors earlier proposal for providing Ada with support for fine-grained parallelism with an execution model based on the concept of abstract executors, detailing the progress guarantees that these executors must provide and how these can be assured even in the presence of potentially blocking operations. The paper also describes how this execution model can be applied to real-time systems.

show abstract

“…Tasklets are considered to be blocked when they are waiting for a resource, which is not an executor nor a core (e.g. executing an entry call) 4 .…”

Section: Progressmentioning

confidence: 99%

Section: Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Execution Model for Fine-Grained Parallelism in Ada

Pinho¹,

Moore

Michell

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The current proposal to extend Ada with a fine-grained parallelism model [1,2,3,4] is based on the notion of tasklets, which are non-schedulable computation units (similar to Cilk [6] or OpenMP [7] tasks).…”

Section: Introductionmentioning

confidence: 99%

Real-Time Fine-Grained Parallelism in Ada

et al. 2015

Self Cite

View full text Add to dashboard Cite

show abstract

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

Royuela

Martorell

Quiñones

et al. 2018

Reliable Software Technologies – Ada-Europe 2018

View full text Add to dashboard Cite

There is a growing need to support parallel computation in Ada to cope with the performance requirements of the most advanced functionalities of safety-critical systems. In that regard, the use of parallel programming models is paramount to exploit the benefits of parallelism. Recent works motivate the use of OpenMP for being a de facto standard in high-performance computing for programming shared memory architectures. These works address two important aspects towards the introduction of OpenMP in Ada: the compatibility of the OpenMP syntax with the Ada language, and the interoperability of the OpenMP and the Ada runtimes, demonstrating that OpenMP complements and supports the structured parallelism approach of the tasklet model. This paper addresses a third fundamental aspect: functional safety from a compiler perspective. Particularly, it focuses on race conditions and considers the fine-grain and unstructured capabilities of OpenMP. Hereof, this paper presents a new compiler analysis technique that: 1) identifies potential race conditions in parallel Ada programs based on OpenMP or Ada tasks or both, and 2) provides solutions for the detected races.Royuela, S. [et al.]. Safe parallelism: Compiler analysis techniques for Ada and OpenMP.

show abstract

Parallelism in Ada: Status and Prospects

Cited by 4 publications

References 7 publications

An Execution Model for Fine-Grained Parallelism in Ada

An Execution Model for Fine-Grained Parallelism in Ada

Real-Time Fine-Grained Parallelism in Ada

Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP

Contact Info

Product

Resources

About