Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
Yehuda Afek, Pazi Boxer, Dan Touitou · 2000
In this paper we prove: For any constant d there is a large enough n such that there is no long-lived adaptive implementation of collect or renaming in the read write model with n processes that uses d or less MWMR registers.