Scalar Logical time

What is the primary purpose of scalar logical clocks in distributed systems?

a: To synchronize physical time across all processes Explanation

Explanation

b: To order events in a distributed system without relying on physical time Explanation

Explanation

c: To measure network latency between processes Explanation

Explanation

d: To encrypt messages between processes Explanation

Explanation

What does the 'happens before' relation (→) represent in distributed systems?

a: Physical time ordering between events Explanation

Explanation

b: Causal ordering between events across processes Explanation

Explanation

c: Random ordering of events Explanation

Explanation

d: Alphabetical ordering of process names Explanation

Explanation

When a process sends a message, it

a: increments its clock before the send event and sends a message with the time before the increment Explanation

Explanation

b: increments its clock after the send event and sends a message with the time after the increment Explanation

Explanation

c: increments its clock after the send event and sends a message with the time before the increment Explanation

Explanation

d: increments its clock before the send event and sends a message with the time after the increment Explanation

Explanation

Scalar logical clocks can be used to

a: Totally order events by themselves Explanation

Explanation

b: Can only establish Partial Ordering Explanation

Explanation

c: Can be used along with arbitrary tiebreaks to establish total ordering Explanation

Explanation

d: Can be used along with arbitrary tiebreaks to establish partial ordering Explanation

Explanation

What happens when a process receives a message in scalar logical clock systems?

a: It only increments its own clock by 1 Explanation

Explanation

b: It sets its clock to the message timestamp Explanation

Explanation

c: It sets its clock to max(own_clock, message_timestamp) and then increments Explanation

Explanation

d: It ignores the message timestamp Explanation

Explanation

When are two events considered concurrent in scalar logical time?

a: When they occur at the same physical time Explanation

Explanation

b: When neither event happens before the other (a ↛ b and b ↛ a) Explanation

Explanation

c: When they have the same logical timestamp Explanation

Explanation

d: When they occur on the same process Explanation

Explanation

What is the clock condition that logical clocks must satisfy?

a: If a → b, then C(a) > C(b) Explanation

Explanation

b: If a → b, then C(a) = C(b) Explanation

Explanation

c: If a → b, then C(a) < C(b) Explanation

Explanation

d: If a → b, then C(a) ≥ C(b) Explanation

Explanation

What is strong consistency in logical clock systems?

a: a → b if and only if C(a) < C(b) Explanation

Explanation

b: a → b implies C(a) < C(b) only Explanation

Explanation

c: All processes have the same clock value at any given time Explanation

Explanation

d: Physical and logical time are synchronized Explanation

Explanation

How do scalar logical clocks handle the transitivity property of the happens-before relation?

a: By using vector timestamps Explanation

Explanation

b: By ensuring that if a → b and b → c, then C(a) < C(b) < C(c) Explanation

Explanation

c: By synchronizing physical clocks Explanation

Explanation

d: By using process IDs as tie-breakers Explanation

Explanation