Space-efficient representations of shared data for parallel computers
Kieran T. Herley · 1990
The problem of representing a set.tr k (2~1,. . . .II,,} of read-write variables on an n-node distribut,ed memory pa.rallel computer is considered.It is shown that, Cr can be represented among the n nodes of a variant. of tlie mesh-of-t,rees using O((?n/77)polyIoy( )??/)I)) storage per node such tha.tany n-tuple of variables ma.y be accessed in O(log n(10glogn)~) time in t,he worst ca.se for m polynomial in n.