uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
TaskUniVerse: A Task-Based Unified Interface for Versatile Parallel Execution
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
2018 (English)In: Parallel Processing and Applied Mathematics: Part I, Springer, 2018, p. 169-184Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2018. p. 169-184
Series
Lecture Notes in Computer Science ; 10777
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:uu:diva-338836DOI: 10.1007/978-3-319-78024-5_16ISBN: 978-3-319-78023-8 (print)OAI: oai:DiVA.org:uu-338836DiVA, id: diva2:1173782
Conference
PPAM 2017
Projects
eSSENCEAvailable from: 2018-03-23 Created: 2018-01-14 Last updated: 2018-03-26Bibliographically approved
In thesis
1. Advances in Task-Based Parallel Programming for Distributed Memory Architectures
Open this publication in new window or tab >>Advances in Task-Based Parallel Programming for Distributed Memory Architectures
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

It has become common knowledge that parallel programming is needed for scientific applications, particularly for running large scale simulations. Different programming models are introduced for simplifying parallel programming, while enabling an application to use the full computational capacity of the hardware. In task-based programming, all the variables in the program are abstractly viewed as data. Parallelism is provided by partitioning the data. A task is a collection of operations performed on input data to generate output data. In distributed memory environments, the data is distributed over the computational nodes (or processes), and is communicated when a task needs remote data.

This thesis discusses advanced techniques in distributed task-based parallel programming, implemented in the DuctTeip software library. DuctTeip uses MPI (Message Passing Interface) for asynchronous inter-process communication and Pthreads for shared memory parallelization within the processes. The data dependencies that determine which subsets of tasks can be executed in parallel are extracted from information about the data accesses (input or output) of the tasks. A versioning system is used internally to represent the task-data dependencies efficiently. A hierarchical partitioning of tasks and data allows for independent optimization of the size of computational tasks and the size of communicated data. A data listener technique is used to manage communication efficiently.

DuctTeip provides an algorithm independent dynamic load balancing functionality. Redistributing tasks from busy processes to idle processes dynamically can provide an overall shorter execution time. A random search method with high probability of success is employed for locating idle/busy nodes.

The advantage of the abstract view of tasks and data is exploited in a unified programming interface, which provides a standard for task-based frameworks to decouple framework development from application development. The interface can be used for collaboration between different frameworks in running an application program efficiently on different hardware.

To evaluate the DuctTeip programming model, applications such as Cholesky factorization, a time-dependent PDE solver for the shallow water equations, and the fast multipole method have been implemented using DuctTeip. Experiments show that DuctTeip provides both scalability and performance. Comparisons with similar frameworks such as StarPU, OmpSs, and PaRSEC show competitive results.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2018. p. 42
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1621
Keywords
parallel programming, task-based programming, distributed memory system, scientific computing, hierarchical data, hierarchical tasks
National Category
Computer Systems
Identifiers
urn:nbn:se:uu:diva-338838 (URN)978-91-513-0209-6 (ISBN)
Public defence
2018-03-02, ITC/2446, ITC, Lägerhyddsvägen 2, Uppsala, 10:00 (English)
Opponent
Supervisors
Available from: 2018-02-09 Created: 2018-01-14 Last updated: 2018-03-08

Open Access in DiVA

fulltext(564 kB)21 downloads
File information
File name FULLTEXT01.pdfFile size 564 kBChecksum SHA-512
0e06a4db39258601e56dd83fd9c340aef75b898b5e9d113cbb1b6251bd7bdba2248f7947564debc2ea66d7bc00bce19ca1a2c34487f93e34d8967a03a125a7a9
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Zafari, Afshin

Search in DiVA

By author/editor
Zafari, Afshin
By organisation
Division of Scientific ComputingComputational Science
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 21 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 78 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf