Solving the processor identity problem in O(n) space

The processor identity problem is the problem of assigning unique identifiers to processors that communicate through shared memory. Solutions to fundamental multiprocessor coordination problems such as the mutual exclusion problem and the choice coordination problems often rely on unique identifiers. A solution to the processor identity problem simplifies shared memory processor design by eliminating the need to encode processor identifiers in system hardware or software structures. The original solution to the processor identity problem required O(n²) space. Further refinements lowered the space requirements to O(n log²n). This paper presents a protocol which only requires O(n) space