{'fraction_non_alphanumeric': 0.018113207547169812, 'fraction_numerical': 0.0007547169811320754, 'mean_word_length': 5.63, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Massively parallel processing for dynamic airspace configuration

The design of airspace and traffic flows through airspace is currently conducted through manual processes. In order to achieve the vision of the Next Generation Air Transportation System (NextGen), airspace resources will be allocated to accommodate traffic demand dynamically. The computational loads required for wide-area dynamic airspace configuration (DAC) [1] processing is a significant impediment for transitioning this concept into a pertinent and usable technology. Customized computing hardware could be applied to address some of these issues, but they are costly and more than often the software does not scale graciously as new technologies become available. In this research effort, we address an algorithm and computing architecture for the automated partitioning of airspace into sectors that is based on the technology of Graphic Processing Units (GPU) and the Compute Unified Device Architecture (CUDA). In this paper we provide a parallel implementation of a selection of Dynamic Density (DD) factors, elements of the objective function that is used in DAC optimization. We will show that our parallel approach provides a significant overall performance gain compared with the original sequential implementation of the selected DD factors.