Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10008739
Performance Evaluation of Parallel Surface Modeling and Generation on Actual and Virtual Multicore Systems
Abstract:
Even though past, current and future trends suggest that multicore and cloud computing systems are increasingly prevalent/ubiquitous, this class of parallel systems is nonetheless underutilized, in general, and barely used for research on employing parallel Delaunay triangulation for parallel surface modeling and generation, in particular. The performances, of actual/physical and virtual/cloud multicore systems/machines, at executing various algorithms, which implement various parallelization strategies of the incremental insertion technique of the Delaunay triangulation algorithm, were evaluated. T-tests were run on the data collected, in order to determine whether various performance metrics differences (including execution time, speedup and efficiency) were statistically significant. Results show that the actual machine is approximately twice faster than the virtual machine at executing the same programs for the various parallelization strategies. Results, which furnish the scalability behaviors of the various parallelization strategies, also show that some of the differences between the performances of these systems, during different runs of the algorithms on the systems, were statistically significant. A few pseudo superlinear speedup results, which were computed from the raw data collected, are not true superlinear speedup values. These pseudo superlinear speedup values, which arise as a result of one way of computing speedups, disappear and give way to asymmetric speedups, which are the accurate kind of speedups that occur in the experiments performed.
Digital Article Identifier (DAI):

References:

[1] Blelloch, G. E., Miller, G. L., Hardwick, J. C. and Talmor, D. (1999). Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica, 24(3-4), 243-269. doi: 10.1007/pl00008262
[2] Blelloch, G. E., Miller, G. L., and Talmor, D. (1996). Developing a practical projection-based parallel Delaunay algorithm. Paper presented at the Proceedings of the twelfth annual symposium on Computational geometry, Philadelphia, Pennsylvania, USA.
[3] Chen, M.-B., Chuang, T.-R., and Wu, J.-J. (2001). Efficient Parallel Implementations of 2D Delaunay Triangulation with High Performance Fortran. Paper presented at the PPSC.
[4] Chen, M.-B., Chuang, T.-R., and Wu, J.-J. (2002). A parallel divide-and-conquer scheme for Delaunay triangulation. Paper presented at the Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on.
[5] Chen, M.-B., Chuang, T.-R., and Wu, J.-J. (2006). Parallel divide-and-conquer scheme for 2D Delaunay triangulation: Research Articles. Concurr. Comput. : Pract. Exper., 18(12), 1595-1612. doi: 10.1002/cpe.v18:12
[6] Cignoni, P., Laforenza, D., Perego, R., Scopigno, R., and Montani, C. (1995). Evaluation of parallelization strategies for an incremental Delaunay triangulator in E3. Concurrency: Practice and Experience, 7(1), 61-80. doi: 10.1002/cpe.4330070106
[7] Cignoni, P., Montani, C., Perego, R. and Scopigno, R. (1993). Parallel 3D Delaunay Triangulation. Computer Graphics Forum, 12(3), 129-142. doi: 10.1111/1467-8659.1230129
[8] Gyang, N. P. (2014). Performance evaluation of parallel surface generation from LiDAR point clouds on actual and virtual multicore systems (Doctoral dissertation, Colorado Technical University).
[9] Hardwick, J. C. (1997). Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm. Paper presented at the Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, Newport, Rhode Island, USA.
[10] Held, J., Bautista, J. and Koehl, S. (2006). From a few cores to many: A tera-scale computing research overview. white paper, Intel.
[11] Kohout, J. and Kolingerová, I. (2003). Parallel Delaunay triangulation in E3: make it simple. The Visual Computer, 19(7-8), 532-548. doi: 10.1007/s00371-003-0219-x
[12] Kohout, J., Kolingerová, I. and Ára, J. (2005). Parallel Delaunay triangulation in E2 and E3 for computers with shared memory. Parallel Comput., 31(5), 491-522. doi: citeulike-article id:3386087, doi: 10.1016/j.parco.2005.02.010
[13] Kolingerová, I. and Kohout, J. (2002). Optimistic parallel Delaunay triangulation. The Visual Computer, 18(8), 511-529. doi: 10.1007/s00371-002-0173-z
[14] Lo, S. H. (2012a). Parallel Delaunay triangulation – Application to two dimensions. Finite Elements in Analysis and Design, 62(0), 37-48. doi: http://dx.doi.org/10.1016/j.finel.2012.07.003
[15] Lo, S. H. (2012b). Parallel Delaunay triangulation in three dimensions. Computer Methods in Applied Mechanics and Engineering, 237–240(0), 88-106. doi: http://dx.doi.org/10.1016/j.cma.2012.05.009
[16] Park, C.-M., Lee, S., and Park, C.-I. (2001). An improved parallel algorithm for delaunay triangulation on distributed memory parallel computers. Parallel Processing Letters, 11(02n03), 341-352. doi: doi:10.1142/S0129626401000634
[17] Puppo, E., Davis, L., De Menthon, D. and Teng, Y. A. (1994). Parallel terrain triangulation. International Journal of Geographical Information Systems, 8(2), 105-128. doi: citeulike-article-id:10466135 doi: 10.1080/02693799408901989
[18] Shewchuk, J. R. (1996). Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. Paper presented at the Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering.
[19] Teng, Y. A., Sullivan, F., Beichl, I. and Puppo, E. (1993). A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation. Paper presented at the Proceedings of the 1993 ACM/IEEE conference on Supercomputing, Portland, Oregon, United States.
Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007