16 search results - page 4 / 4 » Constant Time per Edge is Optimal on Rooted Tree Networks |
129
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...