Transience bounds for distributed algorithms

DOI10.1007/978-3-642-40229-6_6MaRDI QIDQ2842661zbMATH OpenOpenAlexFDO

Authors Bernadette Charron-Bost, Matthias Függer, Thomas Nowak

Publication date 16 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40229-6_6

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• New transience bounds for max-plus linear systems
• An overview of transience bounds in max-plus algebra
• Time bounds on synchronization in a periodic distributed system
• scientific article; zbMATH DE number 732976
• The use of a synchronizer yields the maximum computation rate in distributed networks

Cited in

(6)

• scientific article; zbMATH DE number 7561283 (Why is no real title available?)
• Algorithm for the CSR expansion of max-plus matrices using the characteristic polynomial
• New transience bounds for max-plus linear systems
• Constant space and non-constant time in distributed computing
• Computational techniques for reachability analysis of Max-Plus-Linear systems
• Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach

This page was built for publication: Transience bounds for distributed algorithms

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