Document Type
Technical Report
Publication Date
10-22-1992
Technical Report Number
PCS-TR92-184
Abstract
The segment tree is a simple and important data structure in computational geometry [7,11]. We present an experimental study of parallel algorithms for building segment trees. We analyze the algorithms in the context of both the PRAM (Parallel Random Access Machine) and hypercube architectures. In addition, we present performance data for implementations developed on the Connection Machine. We compare two different parallel alforitms, and we also compare our parallel algorithms to a good sequential algorithm for doing the same job. In this way, we evaluate the overall efficiency of our parallel methods. Our performance results illustrates the problems involved in using popular machine models(PRAM) and analysis techniques (asymptotic efficiency) to predict the performance of parallel algorithms on real machines. We present two different analyses of our algorithms and show that neither is effective in predicting the actual performance numbers that we obtained.
Dartmouth Digital Commons Citation
Su, Peter and Drysdale, Scot, "Building Segment Trees in Parallel" (1992). Computer Science Technical Report PCS-TR92-184. https://digitalcommons.dartmouth.edu/cs_tr/78