Distributed Computing Column C y n t h i a Dwork IBM A l m a d e n Research Center In Memoriam Paris Kanellakis and Maria-Teresa Otoya In P O D C ' 9 6 J i m Aspnes and William Hurwood [3] presented a beautiful p a p e r on the cooperative collect problem. In m a n y s h a r e d - m e m o r y applications processes r e p e a t e d l y require up-to-date, or fresh, information a b o u t all values stored in a p a r t i c u l a r set of registers. In the simplest version of this problem all values are present at the s t a r t a n d each process gathers the values only once, so freshness is not an issue. In the full (repeated) version the values m a y change at any time. If each process reads every register itself, then even in the simple version of the p r o b l e m not only is the total n u m b e r of reads
/lp/association-for-computing-machinery/distributed-computing-column-SP0QR0ubJG