Unison, canon, and sluggish clocks in networks controlled by a synchronizer

DOI10.1007/BF01185865zbMATH Open0833.68009OpenAlexW2046750829MaRDI QIDQ4850331FDOQ4850331

Authors: Shimon Even, Sergio Rajsbaum 

Publication date: 9 October 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185865

Recommendations

• Publication:4206383
• The use of a synchronizer yields the maximum computation rate in distributed networks
• Graph Transformations
• Synchronous vs. asynchronous unison

zbMATH Keywords

synchronizerunisonlocal clockssluggish clock

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Self-stabilizing systems in spite of distributed control
• Marked directed graphs
• Complexity of network synchronization
• Stabilizing unison
• The use of a synchronizer yields the maximum computation rate in distributed networks
• Title not available (Why is that?)

Cited In (10)

• On the performance of a retransmission-based synchronizer
• On the microscopic view of time and messages
• Upper and lower bounds for stochastic marked graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
• Graph Transformations
• The effect of forgetting on the performance of a synchronizer
• Title not available (Why is that?)
• The use of a synchronizer yields the maximum computation rate in distributed networks

This page was built for publication: Unison, canon, and sluggish clocks in networks controlled by a synchronizer

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