On the time complexity of minimum and maximum global snapshot problems

DOI10.1016/S0020-0190(98)00100-8zbMATH Open1339.68114OpenAlexW2076740206MaRDI QIDQ293343FDOQ293343

Authors: Loon-Been Chen, I-Chen Wu 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001008?np=y

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• On Detection of Bounded Global Predicates
• On distributed snapshots
• Time-space tradeoffs for implementations of snapshots
• Efficient synchronous snapshots

zbMATH Keywords

computational complexitydistributed systemserror detectionglobal snapshot

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A new approach to the maximum-flow problem
• Time, clocks, and the ordering of events in a distributed system
• On Detection of Bounded Global Predicates

Cited In (2)

• An efficient minimum and maximum global snapshot algorithm
• The F-Snapshot Problem

This page was built for publication: On the time complexity of minimum and maximum global snapshot problems

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