License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2017.20
URN: urn:nbn:de:0030-drops-86496
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8649/
Go to the corresponding LIPIcs Volume Portal


Chauhan, Himanshu ; Garg, Vijay K.

Fast Detection of Stable and Count Predicates in Parallel Computations

pdf-format:
LIPIcs-OPODIS-2017-20.pdf (0.6 MB)


Abstract

Enumerating all consistent states of a parallel computation that satisfy a given predicate is an important problem in debugging and verification of parallel programs. We give a fast algorithm to enumerate all consistent states of a parallel computation that satisfy a stable predicate. In addi- tion, we define a new category of global predicates called count predicates and give an algorithm to enumerate all consistent states (of the computation) that satisfy it. All existing predicate detection algorithms, such as BFS, DFS and Lex algorithms, do not exploit the knowledge about the nature of the predicates, and thus may visit all global states of the computation in the worst case. In comparison, our algorithms only visit the states that satisfy the given predicate, and thus take time and space that is a polynomial function of the number of states of interest. In doing so, they provide a significant reduction exponential in many cases in time complexities in comparison to existing algorithms.

BibTeX - Entry

@InProceedings{chauhan_et_al:LIPIcs:2018:8649,
  author =	{Himanshu Chauhan and Vijay K. Garg},
  title =	{{Fast Detection of Stable and Count Predicates in Parallel Computations}},
  booktitle =	{21st International Conference on Principles of Distributed Systems (OPODIS 2017)},
  pages =	{20:1--20:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-061-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{95},
  editor =	{James Aspnes and Alysson Bessani and Pascal Felber and Jo{\~a}o Leit{\~a}o},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8649},
  URN =		{urn:nbn:de:0030-drops-86496},
  doi =		{10.4230/LIPIcs.OPODIS.2017.20},
  annote =	{Keywords: Algorithms, Theory, Predicate Detection, Parallel Programs}
}

Keywords: Algorithms, Theory, Predicate Detection, Parallel Programs
Seminar: 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
Issue Date: 2018
Date of publication: 16.03.2018


DROPS-Home | Fulltext Search | Imprint Published by LZI