Izvorni znanstveni članak
https://doi.org/10.24138/jcomss.v16i2.1029
PList-based Divide and Conquer Parallel Programming
Virginia Niculescu
; Babe¸s-Bolyai University, Cluj-Napoca, Romania
Darius Bufnea
; Babe¸s-Bolyai University, Cluj-Napoca, Romania
Adrian Sterca
; Babe¸s-Bolyai University, Cluj-Napoca, Romania
Sažetak
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.
Ključne riječi
parallel computation; divide and conquer; recursive data structures; framework
Hrčak ID:
240389
URI
Datum izdavanja:
15.6.2020.
Posjeta: 1.037 *