The complexity of the 3D buildings and road networks gives the simulation of urban noise difficulty and significance. To solve the problem of computing complexity, a systematic methodology for computing urban traffic noise maps under 3D complex building environments is presented on a supercomputer. A parallel algorithm focused on controlling the compute nodes of the supercomputer is designed. Moreover, a rendering method is provided to visualize the noise map. In addition, a strategy for obtaining a real-time dynamic noise map is elaborated. Two efficiency experiments are implemented. One experiment involves comparing the expansibility of the parallel algorithm with various numbers of compute nodes and various computing scales to determine the expansibility. With an increase in the number of compute nodes, the computing time increases linearly, and an increased computing scale leads to computing efficiency increases. The other experiment is a comparison of the computing speed between a supercomputer and a normal computer; the computing node of Tianhe-2 is found to be six times faster than that of a normal computer. Finally, the traffic noise suppression effect of buildings is analyzed. It is found that the building groups have obvious shielding effect on traffic noise.
Urban Traffic Noise Maps under 3D Complex Building Environments on a Supercomputer
2018
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Storage needs in future supercomputer environments
NTRS | 1991
|Traffic noise maps as an assistance for urban planning
British Library Conference Proceedings | 1994
|Building urban area noise pollution maps and mitigating noise from emergency vehicles
European Patent Office | 2021
|Online Contents | 1972
|Online Contents | 1993