@inproceedings{e46f30180eb54731a34665df464acc75,
title = "Space-efficient representations of shared data for parallel computers",
abstract = "The problem of representing a set U = \{u1, ..., um\} of read-write variables on an n-node distributed memory parallel computer is considered. It is shown that U can be represented among the n nodes of a variant of the mesh-of-trees using O((m/n)polylog(m/n)) storage per node such that any n-tuple of variables may be accessed in O(log n(log log n)2) time in the worst case for m polynomial in n.",
author = "Herley, \{Kieran T.\}",
year = "1990",
doi = "10.1145/97444.97708",
language = "English",
isbn = "0897913701",
series = "Algorithms and Architectures",
publisher = "Publ by ACM",
pages = "407--416",
booktitle = "Algorithms and Architectures",
note = "SPAA '90 - Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures ; Conference date: 02-07-1990 Through 06-07-1990",
}