Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows

Published

Author(s)

Timothy J. Blattner, Walid Keyrouz, Mary C. Brady, Shuvra S. Bhattacharyya, Milton Halem

Abstract

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) increases programmer productivity when implementing hybrid workflows for multi- core and multi-GPU systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. To demonstrate the HTGS API we implement and present two algorithms. First, a matrix multiplication, which achieves 1.3x and 1.8x speedup over the OpenBLAS library for 16k x 16k and 32k x 32k size matrices, respectively. And second, a hybrid implementation of microscopy image stitching that reduces code size by ~43% and shows favorable performance compared to a similar hybrid workflow implementation of the same algorithm that does not use HTGS.
Citation
Journal of Signal Processing Systems

Keywords

heterogeneous architectures, task graphs, hybrid workflows, dataflow, image processing, matrix multiplication

Citation

Blattner, T. , Keyrouz, W. , Brady, M. , Bhattacharyya, S. and Halem, M. (2017), A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows, Journal of Signal Processing Systems, [online], https://doi.org/10.1007/s11265-017-1262-6 (Accessed April 20, 2024)
Created June 22, 2017, Updated November 10, 2018