The Art of Multiprocessor Programming booksite多处理器编程的艺术booksite.elsevier.pptVIP

* To compute my response. * * * * * * * * * To compute my response. * Our construction is correct, that is, it is a linearizable implementation of the sequential object, because the log is immutable and each \mApply{} call can be linearized at the point in which the consensus call adding it to the log was decided. Why is our construction lock-free? We first note that the ``true head of the log, the latest node agreed on as the new head, is always added to the head array within a finite number of steps from the moment of decision. This claim follows because the nodes predecessor must alread