An Efficient and Composable Parallel Task Programming Library

Composability is a key component to improve programmers' productivity in writing fast market-expanding applications such as parallel machine learning algorithms and big data analytics. These applications exhibit both regular and irregular compute patterns, and are often combined with other func...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Conference on High Performance Extreme Computing (Online) pp. 1 - 7
Main Authors: Lin, Chun-Xun, Huang, Tsung-Wei, Guo, Guannan, Wong, Martin D. F.
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2019
Subjects:
Libraries
Multicore processing
multithreading
Parallel processing
Parallel programming
Task analysis
Training
ISSN:2643-1971
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Composability is a key component to improve programmers' productivity in writing fast market-expanding applications such as parallel machine learning algorithms and big data analytics. These applications exhibit both regular and irregular compute patterns, and are often combined with other functions or libraries to compose a larger program. However, composable parallel processing has taken a back seat in many existing parallel programming libraries, making it difficult to achieve modularity in large-scale parallel programs. In this paper, we introduce a new parallel task programming library using composable tasking graphs. Our library efficiently supports task parallelism together with an intuitive task graph construction and flexible execution API set to enable reusable and composable task dependency graphs. Developers can quickly compose a large parallel program from small and modular parallel building blocks, and easily deploy the program on a multicore machine. We have evaluated our library on real-world applications. Experimental results showed our library can achieve comparable performance to Intel Threading Building Blocks with less coding effort.
ISSN:2643-1971
DOI:10.1109/HPEC.2019.8916447