# Tag Info

1

I did some more thinking about this and I see at least one benefit of synchronized clocks, which is 'fairness when the topology is skewed'. Imagine a situation with a server and two trusted clients. Eg. perhaps they're API servers in different data centers that end-users communicate with. Server------------------------------Client A \------Client B ...

1

The constraint as written by Lamport is $C_i(t+\mu)-C_j(t)\gt0$ or $C_i(t+\mu)\gt C_j(t)$ which can be re-written $$C_i(t+\mu) - C_i(t)\gt C_j(t) - C_i(t) \tag{*}\label{*}$$ Given Lamport's previous deductions, we recognise the boundary conditions each side must satisfy namely: $$(1-\kappa)\mu \lt C_i(t+\mu) - C_i(t)$$ $$\epsilon \gt C_j(t) - C_i(t)$$ Now, ...

1

Assume the clock condition AND its converse: $$C(a)\lt C(b) \Rightarrow a \rightarrow b \tag{*}\label{*}$$ Next, take note that $\neg(a \rightarrow b)$ implies either $b \rightarrow a$ or $a \nrightarrow b$ (i.e. if '$a$ does NOT happen before $b$' then either '$b$ happens before $a$' or they are concurrent events). Now, since the implication $\eqref{*}$ is (...

1

Every instruction in a CPU goes through an Instruction execution cycle. In other words every instruction goes through multiple stages like Fetch,Decode,Execute,Writeresult. In modern processor the number of stages can go up to 20. So for single cycle instruction execution (all stages finish their work), the clock duration need to be large and hence the ...

Only top voted, non community-wiki answers of a minimum length are eligible