Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
One-to-Many routing on the mesh
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Implementing Shared Memory on Clustered Machines
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
The problem of simulating a PRAM with $n$ processors and memory size $m \geq n$ on an $n$-node bounded degree network is considered. A deterministic algorithm is presented that simulates an arbitrary PRAM step in $O((\log n \log m)/\log \log n)$ time in the worst case on an expander-based network. By extending a previously established lower bound, it is shown that the proposed simulation is optimal whenever $\Omega(n^{1 + \epsilon}) \leq m \leq O(2^{(\log n)^{\alpha}})$ for some positive real constants $\epsilon$ and $\alpha$.