For the most recent entries see the Petri Nets Newsletter.

On the performance of synchronized programs in distributed networks with random processing times and transmission delays.

Rajsbaum, Sergio; Sidi, Moshe

In: IEEE Trans. on parallel and distributed systems, pages 939-950. 1994.

Abstract: A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, is studied under the assumption that message transmission delays and processing times are random. The main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network per unit time. The effect of the topology and the probability distributions of the random variables on the behavior of the network is analyzed. For random variables with exponential distribution, asymptotically tight bounds are provided, and the effect of a bottleneck processor is studied


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography