### Abstract

We introduce a new parallel algorithm for approximate breadth-first ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm. This work is based on the k-level asynchronous (KLA) paradigm that trades expensive global synchronizations in the levelsynchronous model for local synchronizations in the asynchronous model, which may result in redundant work. Instead of correcting errors introduced by asynchrony and redoing work as in KLA, in this work we control the amount of work that is redone and thus the amount of error allowed, leading to higher performance at the expense of a loss of precision. Results of an implementation of this algorithm are presented on up to 32,768 cores, showing 2.27x improvement over the exact KLA algorithm and 3.8x improvement over the level-synchronous version with minimal error on several graph inputs.

Original language | English (US) |
---|---|

Title of host publication | Languages and Compilers for Parallel Computing - 29th International Workshop, LCPC 2016, Revised Papers |

Editors | Chen Ding, John Criswell, Peng Wu |

Publisher | Springer-Verlag Berlin Heidelberg |

Pages | 40-54 |

Number of pages | 15 |

ISBN (Print) | 9783319527086 |

DOIs | |

State | Published - Jan 1 2017 |

Externally published | Yes |

Event | 29th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2016 - Rochester, United States Duration: Sep 28 2016 → Sep 30 2016 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 10136 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 29th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2016 |
---|---|

Country | United States |

City | Rochester |

Period | 9/28/16 → 9/30/16 |

### Keywords

- Approximate algorithms
- Asynchronous
- Breadth-first search
- Distance query
- Distributed memory
- Parallel graph algorithms

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Fast approximate distance queries in unweighted graphs using bounded asynchrony'. Together they form a unique fingerprint.

## Cite this

*Languages and Compilers for Parallel Computing - 29th International Workshop, LCPC 2016, Revised Papers*(pp. 40-54). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10136 LNCS). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-319-52709-3_4