Even, S., and Rajsbaum, S. The use of a synchronizer yields maximum computation rate in distributed networks. 22nd Annual ACM Symposium on Theory of Computing (1990), 95--105. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Min-Max Problems - Schwiegelshohn, Thiele (1997) (Correct)
....(4) in connection with periodic graphs has raised significant interest in the past as it is the root for many problems from different application areas. This includes e.g. control theory and manufacturing [7] timing properties of discrete event systems [4] 19] parallel algorithms [20] [9], and other areas of computer science. A comprehensive treatment of the theory and applications can be found in [2] Many results have been developed while considering linear equations over a new max plus algebra, see [7] 8] 23] and [2] One of the main results is the establishment of a ....
Even, S., and Rajsbaum, S. The use of a synchronizer yields maximum computation rate in distributed networks. 22nd Annual ACM Symposium on Theory of Computing (1990), 95--105.
Adapting to Asynchronous Dynamic Networks (Extended Abstract) - Awerbuch, al. (1992) (Correct)
....factors. More precisely, f(n) O (g(n) if there exist integers k; N such that for all n N , we have f(n) log n) k Delta g(n) Previous results. The synchronizer methodology was introduced by Awerbuch [3] Synchronizers, and various aspects or applications thereof, were studied in [15, 4, 12, 25, 14, 17, 11, 23, 13]. The synchronizers fall into two categories, namely static and dynamic synchronizers. Reference Space Comm. Time [11] det. O (n) O (n) O (1) 1, 9] det. O (n) O (1) O (n) This paper (rand. O (1) O (1) O (1) Figure 1: Comparison of stretch factors of dynamic ....
Shimon Even and Sergio Rijsbaum. The use of a synchronizer yields maximum computation rate in distributed networks. In Proc. 22ndACM Symp. on Theory of Computing. ACM SIGACT, ACM, May 1990.
Network Synchronization With Polylogarithmic Overhead - Awerbuch, Peleg (1990) (17 citations) (Correct)
....in part by an Allon Fellowship, by a Walter and Elise Haas Career Development Award and by a Bantrell Fellowship. synchronous model, hence this model is more convenient for designing and analyzing network algorithms. Synchronizers, and various aspects or applications of them, were studied in [Jaf80, Awe85b, CGZ86, SM86, FLS87, LT87, AS88, PU89, ER90]. The synchronizer operates by generating a sequence of local clock pulses at each processor of the network, satisfying the following property: pulse number p is generated by a processor only after it received all the messages of the algorithm sent to it by its neighbors during their pulse number ....
Shimon Even and Sergio Rijsbaum. The use of a synchronizer yields maximum computation rate in distributed networks. In Proc. 22nd ACM Symp. on Theory of Computing. ACM SIGACT, ACM, May 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC