There has been a good deal of discussion concerning the performance of ntpd.
It would be more to the point to demonstrate the superiority of some other than "Markovian" algorithm by writing a competing product and demonstrating that it works "better" in some sense. At the present time, the only alternative I know of is something called "chrony" which I have never used. Ntpd works well with a hardware reference clock. Ntpd works slightly less well using internet servers as time sources. Ntpd's performance is noticeably better using internet sources during the hours when the internet is relatively lightly loaded. If you can improve the performance without breaking something else, please demonstrate. It would be nice if the improved product did not require more resources than ntpd currently does. _______________________________________________ questions mailing list [email protected] https://lists.ntp.org/mailman/listinfo/questions
