Efficient detection of a locally stable predicate in a distributed system

DOI10.1016/J.JPDC.2006.12.004zbMATH Open1115.68028OpenAlexW2140593089MaRDI QIDQ878680FDOQ878680

Authors: Ranganath Atreya, Neeraj Mittal, Ajay D. Kshemkalyani, Vijay K. Garg, Mukesh Singhal 

Publication date: 26 April 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.9984

Recommendations

• Principles of Distributed Systems
• scientific article; zbMATH DE number 3956427
• Detection of global predicates: techniques and their limitations
• Efficient detection of a class of stable properties
• Strong stable properties in distributed systems

zbMATH Keywords

termination detectionDeadlock detectionglobal virtual time computationinconsistent snapshotsmonitoring distributed computationstable property detection

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (7)

• On Detecting Regular Predicates in Distributed Systems
• Title not available (Why is that?)
• Fast Detection of Stable and Count Predicates in Parallel Computations
• Principles of Distributed Systems
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Deadlock resolution in wait-for graphs by vertex/arc deletion
• Title not available (Why is that?)

This page was built for publication: Efficient detection of a locally stable predicate in a distributed system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878680)