On Detection of Bounded Global Predicates

DOI10.1093/COMJNL/41.4.231MaRDI QIDQ4226620zbMATH OpenOpenAlexFDO

Authors I-Chen Wu, Loon-Been Chen

Publication date 27 April 1999

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/41.4.231

zbMATH Keywords

distributed programs

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Detection of global predicates: techniques and their limitations
• Detecting conjunctions of global predicates
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Detecting global predicates in distributed systems with clocks
• Principles of Distributed Systems

Cited in

(5)

• An efficient minimum and maximum global snapshot algorithm
• On the time complexity of minimum and maximum global snapshot problems
• Precluding useless events for on-line global predicate detections
• Efficient detection of restricted classes of global predicates
• Efficient online algorithm for identifying useless states in distributed systems

This page was built for publication: On Detection of Bounded Global Predicates

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