Complexity of network synchronization
Journal of the ACM (JACM)
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Investigations of fault-tolerant networks of computers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Stochastic Petri nets: an elementary introduction
Advances in Petri nets 1989
Unison in distributed networks
Sequences
The use of a synchronizer yields maximum computation rate in distributed networks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Upper and lower bounds for stochastic marked graphs
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Fast Bounds for Stochastic Petri Nets
International Workshop on Timed Petri Nets
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Analysis of a Distributed Scheduler for Communication Networks
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Shuffle-Oriented Interconnection Networks
Shuffle-Oriented Interconnection Networks
Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
Theoretical Computer Science
A performance analysis of local synchronization
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
On the costs and benefits of stochasticity in stream processing
Proceedings of the 47th Design Automation Conference
On the performance of a retransmission-based synchronizer
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Analysis of Delays Caused by Local Synchronization
SIAM Journal on Computing
On bottleneck analysis in stochastic stream processing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On the performance of a retransmission-based synchronizer
Theoretical Computer Science
| Hi-index | 0.01 |
A synchronizer is a compiler that transforms a program designed to run in a synchronousnetwork into a program that runs in an asynchronous network. The behavior of a simplesynchronizer, which also represents a basic mechanism for distributed computing and forthe analysis of marked graphs, was studied by S. Even and S. Rajsbaum (1990) under theassumption that message transmission delays and processing times are constant. Westudy the behavior of the simple synchronizer when processing times and transmissiondelays are random. The main performance measure is the rate of a network, i.e., theaverage number of computational steps executed by a processor in the network per unittime. We analyze the effect of the topology and the probability distributions of therandom variables on the behavior of the network. For random variables with exponentialdistribution, we provide tight (i.e., attainable) bounds and study the effect of abottleneck processor on the rate.