A ROBUST PARALLEL FRAMEWORK FOR MASSIVE SPATIAL DATA PROCESSING ON HIGH PERFORMANCE CLUSTERS
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
Massive spatial data requires considerable computing power for real-time processing. With the help of the development of multicore technology and computer component cost reduction in recent years, high performance clusters become the only economically viable solution for this req
Bo Cheng 1,2, Xuefeng Guan 1,2,*, Huayi Wu 1,2 and Rui Li 1,2 1 State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, 129 Luoyu Road, Wuhan 430079, China; chengbo@whu.edu.cn (B.C.); wuhuayi@whu.edu.cn (H.W.); ruili@whu.edu.cn
Big data is often mined using clustering algorithms. Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a popular spatial clustering algorithm. However, it is computationally expensive and thus for clustering big data, parallel processing is required. The two
Nowadays, a vast amount of data is generated and collected every moment and often, this data has a spatial and/or temporal aspect. To analyze the massive data sets, big data platforms like Apache Hadoop MapReduce and Apache Spark emerged and extensions that take the spatial chara
High performance clusters (HPCs) based on commodity hardware are becoming more and more popular in the parallel computing community. These new platforms offer a hardware capable of a very low latency and a very high throughput at an unbeatable cost, making them attractive for a l