The use of a synchronizer yields the maximum computation rate in distributed networks

DOI10.1007/BF02679457zbMath0882.68014MaRDI QIDQ1364128

Sergio Rajsbaum, Shimon Even

Publication date: 28 September 1997

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

performance of networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

Tentative and definite distributed computations: An optimistic approach to network synchronization ⋮ On the tightness of bounds for transients of weak CSR expansions and periodicity transients of critical rows and columns of tropical matrix powers ⋮ Unison, canon, and sluggish clocks in networks controlled by a synchronizer ⋮ New transience bounds for max-plus linear systems ⋮ Resource-sharing system scheduling and circular chromatic number

Cites Work

• A lower bound on the period length of a distributed scheduler
• A characterization of the minimum cycle mean in a digraph
• Marked directed graphs
• Complexity of network synchronization
• Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
• An Optimal Synchronizer for the Hypercube
• Unison, canon, and sluggish clocks in networks controlled by a synchronizer
• Scheduling Parallel Computations
• On a Problem of Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The use of a synchronizer yields the maximum computation rate in distributed networks