Name
Abstract | ||
|---|---|---|
The effect of using a simple synchronizer on the performance of a directed, strongly connected, distributed network, is analysed. In this paper we assume that the time of message transmission is positive but negligible. It is shown that the synchronizer is sufficient to assure that a full rate of computation is achieved in networks with a global clock, in spite of the absence of a global start-up signal. In fact,unison is reached within linear time. A similar phenomenon occurs if there is no global clock, but all local clocks have the same rate. In case the local clocks do not have the same rate, it is shown that the computational rate is not slower than anysluggish clock; i.e., a clock such that between any two of its ticks, every local clock ticks at least once. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF01185865 | Mathematical Systems Theory |
Keywords | Field | DocType |
Computational Mathematic,Linear Time,Message Transmission,Full Rate,Local Clock | Vector clock,Discrete mathematics,Master clock,Clock drift,Synchronizer,Control theory,Clock domain crossing,Clock hypothesis,Real-time computing,Clock synchronization,CPU multiplier,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 5 | 0025-5661 |
Citations | PageRank | References |
9 | 1.06 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| shimon even | 1 | 2873 | 981.78 |
| Sergio Rajsbaum | 2 | 1367 | 115.89 |