Work

Solving the Straggler Problem with Bounded Staleness

Year: 2018

Type: article

Abstract: Many important applications fall into the broad class of iterative convergent algorithms. Parallel implementations of these algorithms are naturally expressed using the Bulk Synchronous Parallel (BSP) model of computation. However, implementations using BSP are plagued by the straggler problem, where every transient slowdown of any given thread can delay all other threads. This paper presents the Stale Synchronous Parallel (SSP) model as a generalization of BSP that preserves many of its advantages, while avoiding the straggler problem. Algorithms using SSP can execute efficiently, even with significant delays in some threads, addressing the oft-faced straggler problem.

Source: Figshare

DOI: 10.1184/r1/6476339

Authors: Cipar, James, Ho, Qirong, Kim, Jin Kyu, Lee, Seunghak, Ganger, Gregory R, Gibson, Garth, Keeton, Kimberly, P Xing, Eric

Institutions: Carnegie Mellon University, Hewlett-Packard (United States)

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: NetApp, International Science and Technology Center

OpenAlex ID: W1652793671

FWCI: 11.58

Cites: 22

Cited by: 89

Related to: 10