Lines Matching full:time
63 time daemons (\fItimed\fP) running on the machines in a local
66 The time daemons communicate with each other using the
67 \fITime Synchronization Protocol\fP (TSP) which
70 A time daemon has a twofold function.
74 among slave time daemons when, for any reason, the master disappears.
78 The next paragraphs are a brief overview of how the time daemon works.
82 A \fImaster time daemon\fP measures the time
85 The master computes the \fInetwork time\fP as the average of the
93 It then sends to each \fIslave time daemon\fP the
96 Since the correction is expressed as a time difference rather than an
97 absolute time, transmission delays do not interfere with
100 it starts a slave time daemon which
101 will ask the master for the correct time and will reset the machine's clock
103 The time daemons are able to maintain a single network time in spite of
111 terminate (for example, because of a run-time error), or
121 A time daemon on such machines may act as a \fIsubmaster\fP.
140 the kind of network on which time daemons can run.
141 The time daemon will only work on networks with broadcast capability
144 non-broadcast networks may not use the time daemon.
146 If we exclude submasters, there will normally be, at most, one master time
148 During an election, only one of the slave time daemons
153 master time daemons.
154 A master time daemon will require CPU resources
156 a slave time daemon, so it may be advisable to limit master time
160 well allow all of its machines to run master time daemons.
162 At the administrative level, a time daemon on a machine
166 options respectively at start-up time.
167 Typically, the time daemon would be instructed to ignore all but
171 implementation of the time daemon.
175 master time daemon.
182 time daemons run on multiply-connected local area networks.
183 In this case, as we have seen, time daemons running on gateway machines
185 networks as master time daemons.
188 If time daemons were started on both A and B without constraints, it would be
189 possible for submaster time daemon A to be a slave on network X
190 and the master on network Y, while submaster time daemon B is a slave on
192 This \fIloop\fP of master time daemons will not function properly
193 or guarantee a unique time on both networks, and will cause
195 of network bandwidth and CPU time.
197 than two master time daemons,
202 In order to start the time daemon on a given machine,
233 to allow this time daemon to become a master.
234 A time daemon run without this option will be forced in the state of
239 \fITimedc(8)\fP is used to control the operation of the time daemon.
246 cause election timers on several machines to expire at the same time,
254 In order to set the time on a single machine, the \fI-n\fP flag
261 \fITEMPO: A Network Time Controller for Distributed Berkeley UNIX System\fP,
272 \fIThe Berkeley UNIX 4.3BSD Time Synchronization Protocol\fP,