The Community for Technology Leaders
Green Image
<p>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.</p>
Index Termsprogram compilers; performance evaluation; parallel programming; message passing;synchronisation; graph theory; synchronized programs; distributed networks; randomprocessing times; transmission delays; synchronizer; compiler; synchronous network;asynchronous network; distributed computing; marked graphs; message transmissiondelays; processing times; performance measure; computational steps; probabilitydistributions; random variables; exponential distribution; bottleneck processor
M. Sidi, S. Rajsbaum, "On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 939-950, September 1994, doi:10.1109/71.308532
48 ms
(Ver 3.3 (11022016))