ScholarSpace will be down for maintenance on Thursday (8/16) at 8am HST (6pm UTC)
Please use this identifier to cite or link to this item:

A Comparison of Task Parallel Frameworks based on Implicit Dependencies in Multi-core Environments

File SizeFormat 
paper0765.pdf825.73 kBAdobe PDFView/Open

Item Summary

Title: A Comparison of Task Parallel Frameworks based on Implicit Dependencies in Multi-core Environments
Authors: Fraguela, Basilio B.
Keywords: programmability
task parallelism
programming models
Issue Date: 04 Jan 2017
Abstract: The larger flexibility that task parallelism offers with respect to data parallelism comes at the cost of a higher complexity due to the variety of tasks and the arbitrary patterns of dependences that they can exhibit. These dependencies should be expressed not only correctly, but optimally, i.e. avoiding over-constraints, in order to obtain the maximum performance from the underlying hardware. There have been many proposals to facilitate this non-trivial task, particularly within the scope of nowadays ubiquitous multi-core architectures. A very interesting family of solutions because of their large scope of application, ease of use and potential performance are those in which the user declares the dependences of each task, and lets the parallel programming framework figure out which are the concrete dependences that appear at runtime and schedule accordingly the parallel tasks. Nevertheless, as far as we know, there are no comparative studies of them that help users identify their relative advantages. In this paper we describe and evaluate four tools of this class discussing the strengths and weaknesses we have found in their use. \
Pages/Duration: 10 pages
ISBN: 978-0-9981331-0-2
DOI: 10.24251/HICSS.2017.750
Rights: Attribution-NonCommercial-NoDerivatives 4.0 International
Appears in Collections:Parallel Computing: Modern Trends in Research, Education, and Application Minitrack

Please email if you need this content in an ADA-compliant format.

Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.