Vector Logical time

In a distributed system with n processes, what is the size of each vector timestamp?

a: n elements Explanation

Explanation

b: 2n elements Explanation

Explanation

c: n² elements Explanation

Explanation

d: log(n) elements Explanation

Explanation

Vector 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 partial ordering Explanation

Explanation

d: Can be used to establish causal ordering Explanation

Explanation

What is the primary advantage of vector clocks over scalar logical clocks?

a: They use less memory Explanation

Explanation

b: They are faster to compute Explanation

Explanation

c: They can determine causal relationships between events Explanation

Explanation

d: They provide exact physical timestamps Explanation

Explanation

When a process sends a message using vector clocks, what should it do with its vector timestamp?

a: Reset it to zero before sending Explanation

Explanation

b: Increment its own component, then attach the vector to the message Explanation

Explanation

c: Send only its own component value Explanation

Explanation

d: Attach the vector without modification Explanation

Explanation

When a process receives a message in vector logical clocks, how does it update its vector?

a: It copies the sender's vector completely Explanation

Explanation

b: It takes the maximum of each component and increments its own Explanation

Explanation

c: It adds the sender's vector to its own Explanation

Explanation

d: It only increments its own component Explanation

Explanation

What happens to a process's own clock component when it performs a local event?

a: It remains unchanged Explanation

Explanation

b: It is set to the maximum of all components Explanation

Explanation

c: It is incremented by the process's tick value Explanation

Explanation

d: It is reset to zero Explanation

Explanation

For two vector timestamps V_a and V_b, when can we say V_a < V_b (V_a happens before V_b)?

a: When all components of V_a are less than corresponding components of V_b Explanation

Explanation

b: When V_a[i] ≤ V_b[i] for all i, and V_a ≠ V_b Explanation

Explanation

c: When the sum of V_a components is less than sum of V_b components Explanation

Explanation

d: When the first component of V_a is less than first component of V_b Explanation

Explanation

What does it mean when two events have vector timestamps that are incomparable (neither V_a < V_b nor V_b < V_a)?

a: The events occurred at the same physical time Explanation

Explanation

b: One of the vector clocks is incorrect Explanation

Explanation

c: The events are concurrent (causally unrelated) Explanation

Explanation

d: There is a deadlock in the system Explanation

Explanation

In the context of vector clocks, what is the significance of the 'happens before' relation being transitive?

a: It allows for efficient storage of timestamps Explanation

Explanation

b: It ensures that causal dependencies are preserved across multiple message hops Explanation

Explanation

c: It reduces the computational complexity of clock updates Explanation

Explanation

d: It guarantees that all events can be totally ordered Explanation

Explanation