Physical Sciences and Mathematics Commons^™

Time-Optimal Tree Computations On Sparse Meshes, D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J. L. Schwing

Computer Science Faculty Publications

The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the MMB. Specifically, we show that the task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite …