skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Runtime Scheduling Policies for Distributed Graph Algorithms

Abstract

In this paper we explore scheduling and runtime system support for unordered distributed graph computations that rely on optimistic (speculative) execution. Performance of such algorithms is impacted by two competing trends: the higher degree of parallelism enabled by optimistic execution in turn requires substantial runtime support. To address the potentially high overhead and scheduling complexity introduced by the runtime, we investigate customizable scheduling policies that augment the scheduler of the underlying runtime to adapt it to a specific graph application. We present several implementations of Distributed Control (DC), a data-driven unordered approach with work prioritization and demonstrate that customizable scheduling policies result in the most efficient implementation, outperforming the well-known -stepping Single-Source Shortest Paths (SSSP) and Jones-Plassmann vertex-coloring algorithms. We apply two scheduling techniques, flow control and adaptive frequency of network progress, which allow application-level control over the balance of domain work and the runtime work. Experimental results show the benefit of such application-aware scheduling for irregular distributed graph algorithms.

Authors:
 [1];  [1]; ORCiD logo [1];  [2]
  1. BATTELLE (PACIFIC NW LAB)
  2. Indiana University-Bloomington
Publication Date:
Research Org.:
Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1526308
Report Number(s):
PNNL-SA-134903
DOE Contract Number:  
AC05-76RL01830
Resource Type:
Conference
Resource Relation:
Conference: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2018), May 21-25, 2018, Vancouver, BC
Country of Publication:
United States
Language:
English

Citation Formats

Firoz, Jesun S., Zalewski, Marcin J., Lumsdaine, Andrew, and Barnas, Martina. Runtime Scheduling Policies for Distributed Graph Algorithms. United States: N. p., 2018. Web. doi:10.1109/IPDPS.2018.00073.
Firoz, Jesun S., Zalewski, Marcin J., Lumsdaine, Andrew, & Barnas, Martina. Runtime Scheduling Policies for Distributed Graph Algorithms. United States. doi:10.1109/IPDPS.2018.00073.
Firoz, Jesun S., Zalewski, Marcin J., Lumsdaine, Andrew, and Barnas, Martina. Mon . "Runtime Scheduling Policies for Distributed Graph Algorithms". United States. doi:10.1109/IPDPS.2018.00073.
@article{osti_1526308,
title = {Runtime Scheduling Policies for Distributed Graph Algorithms},
author = {Firoz, Jesun S. and Zalewski, Marcin J. and Lumsdaine, Andrew and Barnas, Martina},
abstractNote = {In this paper we explore scheduling and runtime system support for unordered distributed graph computations that rely on optimistic (speculative) execution. Performance of such algorithms is impacted by two competing trends: the higher degree of parallelism enabled by optimistic execution in turn requires substantial runtime support. To address the potentially high overhead and scheduling complexity introduced by the runtime, we investigate customizable scheduling policies that augment the scheduler of the underlying runtime to adapt it to a specific graph application. We present several implementations of Distributed Control (DC), a data-driven unordered approach with work prioritization and demonstrate that customizable scheduling policies result in the most efficient implementation, outperforming the well-known -stepping Single-Source Shortest Paths (SSSP) and Jones-Plassmann vertex-coloring algorithms. We apply two scheduling techniques, flow control and adaptive frequency of network progress, which allow application-level control over the balance of domain work and the runtime work. Experimental results show the benefit of such application-aware scheduling for irregular distributed graph algorithms.},
doi = {10.1109/IPDPS.2018.00073},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {8}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: