A Java Framework for High Level Parallel Programming Using Powerlists

Niculescu, Virginia; Loulergue, Frédéric; Bufnea, Darius; Sterca, Adrian

doi:10.1109/pdcat.2017.00049

Cited by 7 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of providing a generalized formulation of the divide-and-conquer pattern came from our experience of implementing a parallel programming framework (JPLF) [48] based on a variant of this pattern that uses PowerList and Plist data structures introduced by J. Misra [38], and so oriented on data decomposition. The JPLF framework offers the possibility to develop efficient implementations based on some templates that facilitate a simple and robust implementation.…”

Section: Discussionmentioning

confidence: 99%

“…The JPLF framework offers the possibility to develop efficient implementations based on some templates that facilitate a simple and robust implementation. Using it, we proved that this can lead to efficient implementations on shared and distributed memory platforms of many divide-and-conquer algorithms [45,[48][49][50]. The templates based on PowerList allow decompositions of degree two (decomposition into two subproblems), while the variants based on PList allow decomposition with different arities [51].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

On Generalizing Divide and Conquer Parallel Programming Pattern

Niculescu¹

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

(1) Background: Structuring is important in parallel programming in order to master its complexity, and this structuring could be achieved through programming patterns and skeletons. Divide-and-conquer computation is essentially defined by a recurrence relation that links the solution of a problem to the solutions of subproblems of the same type, but of smaller sizes. This pattern allows the specification of different types of computations, and so it is important to provide a general specification that comprises all its cases. We intend to prove that the divide-and-conquer pattern could be generalized such that to comprise many of the other parallel programming patterns, and in order to prove this, we provide a general formulation of it. (2) Methods: Starting from the proposed generalized specification of the divide-and-conquer pattern, the computation of the pattern is analyzed based on its stages: decomposition, base-case and composition. Examples are provided, and different execution models are analyzed. (3) Results: a general functional specification is provided for a divide-and-conquer pattern and based on it, and we prove that this general formulation could be specialized through parameters’ instantiating into other classical parallel programming patterns. Based on the specific stages of the divide-and-conquer, three classes of computations are emphasized. In this context, an equivalent efficient bottom-up computation is formally proved. Associated models of executions are emphasized and analyzed based on the three classes of divide-and-conquer computations. (4) Conclusion: A more general definition of the divide-and-conquer pattern is provided, and this includes an arity list for different decomposition degrees, a level of recursion, and also an alternative solution for the cases that are not trivial but allow other approaches (sequential or parallel) that could lead to better performance. Together with the associated analysis of patterns equivalence and optimized execution models, this provides a general formulation that is useful both at the semantic level and implementation level.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

On Generalizing Divide and Conquer Parallel Programming Pattern

Niculescu¹

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…They are too based on algorithmic skeletons. In [1] a more detailed comparison between the performance of selected algorithms' implementations using Java parallel streams and the JPLF Powerlist implementation is done.…”

Section: Related Workmentioning

confidence: 99%

“…is split into parts that are processed in parallel. The JPLF framework [1] is a parallel framework written in Java that eases the development of parallel programs by providing data structures (i.e. lists) that naturally support divide and conquer computation and functions that take advantage of these parallel data structures.…”

Section: Introductionmentioning

confidence: 99%

PList-based Divide and Conquer Parallel Programming

Niculescu

Bufnea

Sterca

2020

J. commun. softw. syst. (Online)

Self Cite

View full text Add to dashboard Cite

This paper details an extension of a Java parallel programming framework – JPLF. The JPLF framework is a programming framework that helps programmers build parallel programs using existing building blocks. The framework is based on {\em PowerLists} and PList Theories and it naturally supports multi-way Divide and Conquer. By using this framework, the programmer is exempted from dealing with all the complexities of writing parallel programs from scratch. This extension to the JPLF framework adds PLists support to the framework and so, it enlarges the applicability of the framework to a larger set of parallel solvable problems. Using this extension, we may apply more flexible data division strategies. In addition, the length of the input lists no longer has to be a power of two – as required by the PowerLists theory. In this paper we unveil new applications that emphasize the new class of computations that can be executed within the JPLF framework. We also give a detailed description of the data structures and functions involved in the PLists extension of the JPLF, and extended performance experiments are described and analyzed.

show abstract

“…A general architecture is proposed for this kind of frameworks -MEDUGA (Model-Executors-DataManager-UserInteracter-GranularityBalancer-metricsAnalyser). This design is exemplified on a concrete framework -JPLF: Java Parallel Lists Framework [29,27]. This paper is an extension of the conference paper [30], in which the patterns and software development principles used for the JPLF implementation were analysed.…”

Section: Introductionmentioning

confidence: 99%

Reflections on the Design of Parallel Programming Frameworks

Niculescu

Sterca

Loulergue

2021

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Parallel programming is much more complex and difficult than sequential programming, and it is therefore more challenging to achieve the same software quality in a parallel context. High-level parallel programming models, if implemented as software frameworks, could increase productivity and reliability. Important requirements such as extensibility and adaptability for different platforms are required for such a framework, and this paper reflects on these requirements and their relation to the software engineering methodologies that could put them in practice. All these are exemplified on a Java framework -JPLF; this is a high-level parallel programming approach being based on the model brought by the PowerLists associated theories, and it respects the analysed requirements. The design of JPLF is analysed by explaining the design choices and highlighting the design patterns and design principles applied.

show abstract

A Java Framework for High Level Parallel Programming Using Powerlists

Cited by 7 publications

References 12 publications

On Generalizing Divide and Conquer Parallel Programming Pattern

On Generalizing Divide and Conquer Parallel Programming Pattern

PList-based Divide and Conquer Parallel Programming

Reflections on the Design of Parallel Programming Frameworks

Contact Info

Product

Resources

About