View synchronisation is an important component of many modern Byzantine Fault Tolerant State Machine Replication (SMR) systems in the partial synchrony model. Roughly, the efficiency of view synchronisation is measured as the word complexity and latency required for moving from being synchronised in a view of one correct leader to being synchronised in the view of the next correct leader. The efficiency of view synchronisation has emerged as a major bottleneck in the efficiency of SMR systems as a whole. A key question remained open: Do there exist view synchronisation protocols with asymptotically optimal quadratic worst-case word complexity that also obtain linear message complexity and responsiveness when moving between consecutive correct leaders? We answer this question affirmatively with a new view synchronisation protocol for partial synchrony assuming minimal clock synchronisation, called \emph{Fever}. If $n$ is the number of processors and $t$ is the largest integer $<n/3$, then Fever has resilience $t$, and in all executions with at most $0\leq f\leq t$ Byzantine parties and network delays of at most $\delta \leq \Delta$ after $GST$ (where $f$ and $\delta$ are unknown), Fever has worst-case word complexity $O(fn+n)$ and worst-case latency $O(\Delta f + \delta)$.

翻译：视图同步是部分同步模型下许多现代拜占庭容错状态机复制（SMR）系统的重要组件。大体上，视图同步的效率通过从与一个正确领导者的视图同步切换到与下一个正确领导者的视图同步时所需的通信复杂度和延迟来衡量。视图同步的效率已成为整个SMR系统效率的主要瓶颈。一个关键问题仍悬而未决：是否存在视图同步协议，既能实现渐近最优的二次方最坏情况通信复杂度，又能在连续正确领导者之间切换时获得线性消息复杂度和响应性？我们通过一种新的部分同步下的视图同步协议（称为*Fever*）对此问题给出肯定答案，该协议假设最小的时钟同步。若$n$为处理器数量，$t$为最大整数$<n/3$，则Fever的容错性为$t$，并且在所有至多有$0\leq f\leq t$个拜占庭参与方且GST后网络延迟至多为$\delta \leq \Delta$（其中$f$和$\delta$未知）的执行中，Fever的最坏情况通信复杂度为$O(fn+n)$，最坏情况延迟为$O(\Delta f + \delta)$。