N. W. Rickert. Non byzantine clock synchronization --- a programming experiment. ACM Operating System Review, 22(1):73--78, January 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....record [ 17 ] represents an alternative approach. A method involving interpolation between start and end timing pulses [ 18 ] was initially explored but, though suitable for gauging intra node process activity, was not found to be sufficiently accurate. A number of convergence algorithms [ 19, 20 ] exist but these may not provide accurate timing at the inception of an algorithm. However, unlike distributed or networked methods [ 21 ] it is possible to have an initial traffic free phase; and one can assume that faults are rare, allowing a centralized algorithm. A criterion for a portable ....

....requires bounded accuracy at a time signalled from the central farmer. This contrasts with toolkits that allow a trace to be initiated when a process ascertains it has reached a steady state. Note that for cooperative algorithms using the median may be unsuitable since no new value is introduced [ 20 ] and convergence is therefore not guaranteed. The calculation of the median is not onerous if we can employ [ 29, pp. 476 479 ] n X i=1 x i Gamma xm jx i Gamma xm j = 0 (5) with n data values x i having median xm ) to form an iterative and logarithmically convergent equation. Other ....

[Article contains additional citation context not shown here]

N. W. Rickert. Non byzantine clock synchronization --- a programming experiment. ACM Operating System Review, 22(1):73--78, January 1988.

....belongs to the latter class. 4.1. Data Filtering Algorithm Interactive convergence algorithms use statistical clustering techniques such as the fault tolerant average (FAT) algorithm of [12] the CNV algorithm of [17] the majority subset al..gorithm of [19] the non Byzantine algorithm of [30] and the egocentric algorithm of [31] A variation on the FAT algorithm suggested in a recent paper [6] attempts to bound the offset errors when reading a remote clock by casting out readings where the measured roundtrip delay is above a specified value. This algorithm has features in common with ....

Rickert, N.W.NonByzantine clock synchronization - a programming experiment. ACM Operating Systems Review 22, 1 (January 1988), 73-78.

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