Microsimulation is a class of Urban Building Energy Modeling techniques in which energetic interactions between buildings are explicitly resolved. Examples include SUNtool and CitySim+, both of which employ a sophisticated radiosity-based algorithm to solve for radiation exchange. The computational cost of this algorithm increases in proportion to the square of the number of surfaces of which an urban scene is comprised. To simulate large scenes, of the order of 10,000 to 1,000,000 surfaces, it is desirable to divide the scene to distribute the simulation task. However, this partitioning is not trivial as the energy-related interactions create uneven inter-dependencies between computing nodes. To this end, we describe in this paper two approaches ( K-means and Greedy Community Detection algorithms) for partitioning urban scenes, and subsequently performing building energy microsimulation using CitySim+ on a distributed memory High-Performance Computing Cluster. To compare the performance of these partitioning techniques, we propose two measures evaluating the extent to which the obtained clusters exploit data locality. We show that our approach using Greedy Community Detection performs well in terms of exploiting data locality and reducing inter-dependencies among sub-scenes, but at the expense of a higher data preparation cost and algorithm run-time.
Engineering High-Performance Community Detection Heuristics for Massive Graphs