A Novel k-Means Clustering Based Task Decomposition Method for Distributed Vector-Based CA Models
AbstractMore and more vector-based cellular automata (VCA) models have been built to leverage parallel computing to model rapidly changing cities and urban regions. During parallel simulation, common task decomposition methods based on space partitioning, e.g. grid partitioning (GRID) and recursive binary space partitioning (BSP), do not work well given the heterogeneity of VCA parcel tasks. In this paper, to solve this problem, we propose a novel task decomposition method for distributed VCA models based on k-means clustering, named KCP. Firstly, the polygon dataset is converted into points based on centroids, which combines the size of two parcels and the outer distance. A low-cost recursive quad-partition is then applied to decide the initial cluster centers based on parcel density. Finally, neighbor parcels can be allocated into the same subdivision through k-means clustering. As a result, the proposed KCP method takes both the number of tasks and computing complexity into consideration to achieve a well-balanced local workload. A typical urban VCA growth model was designed to evaluate the proposed KCP method with traditional spatial partitioning methods, i.e. GRID and BSP. KCP had the shortest total simulation time when compared with GRID and BSP. During experimental urban growth simulations, the time spent on a single iteration was reduced by 15% with the BSP and by 25% with the GRID method. The total simulation time with a 120 m neighborhood buffer size was reduced by more than one hour to around three minutes with 32 cores. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Li, Z.; Guan, X.; Wu, H.; Gong, J. A Novel k-Means Clustering Based Task Decomposition Method for Distributed Vector-Based CA Models. ISPRS Int. J. Geo-Inf. 2017, 6, 93.
Li Z, Guan X, Wu H, Gong J. A Novel k-Means Clustering Based Task Decomposition Method for Distributed Vector-Based CA Models. ISPRS International Journal of Geo-Information. 2017; 6(4):93.Chicago/Turabian Style
Li, Zhenqiang; Guan, Xuefeng; Wu, Huayi; Gong, Jianya. 2017. "A Novel k-Means Clustering Based Task Decomposition Method for Distributed Vector-Based CA Models." ISPRS Int. J. Geo-Inf. 6, no. 4: 93.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.