Fichas
Exam
Fichas del conjunto (8)
- 1What are the three types of Logical Time?Scalar
Vector
Matrix - 2What are the shared memory consistency models?Linearizability
Sequential Consistency
Causal Consistency
PRAM
Slow Memory - 3What are the classes in Knapp's classification of deadlock detection algorithms?Path-pushing
Edge-Chasing
Diffusing Computation
Global State - 4Why is recording global state complicated in a distributed system?There is typically no shared memory and no shared clock.
- 5Explain the concept of wait-freedom.Wait-freedom is a property that guarantees that any process can complete any synchronous operation in a finite number of steps.
- 6True or False, scalar logical clocks are strongly consistent.FALSE!
- 7True or False, scalar logical clocks can enforce total orderingTrue, but only if we use an additional metric (like the process identifier) to prioritize certain events over others.
- 8Why is causal ordering desirable in a distributed system?It builds synchronization into the system, and eliminates the need to perform additional checks.
Información
- Descripción
- COS 786 Fichas sobre Exam, creado por Regan Koopmans el 03/06/2018.
- Creado por
- Regan Koopmans
- Visitas
- 0
- Valoración