Implementing Mutual Exclusion Algorithm by Burns and Lynch in Java: Could there be issues due to instruction reordering?

Question

I found a fairly simple n-process mutual exclusion algorithm on page 4 (836) in the following paper:
          \"Mutual Exc

Answer 1

In the java memory model you have no guarantee that a write to F[i] will be visible to another Thread reading from it later.

The standard solution for this kind of visibility problem is to declare the shared variable as volatile, but in this case F is an array and write/reads to F[i] do not change the value of F.

It is not possible to declare an "array of volatiles ...", but one can declare F as AtomicIntegerArray and use compareAndSet to atomically change the array content without worrying about Thread-visibility.