{'fraction_non_alphanumeric': 0.01829924650161464, 'fraction_numerical': 0.0, 'mean_word_length': 5.642857142857143, '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}}
Dynamic wavelength assignment for realizing hypercube-based Bitonic sorting on wavelength division multiplexing linear arrays

As compared to its static counterpart, the dynamic wavelength assignment (DWA) strategy can greatly reduce the number of wavelengths required in realizing parallel algorithms on wavelength division multiplexing (WDM) networks. This article addresses the DWA problem for realizing the hypercube-based Bitonic sorting on WDM linear arrays. For that purpose, the notions of dimension congestion and dimension embedding are introduced. Then, two novel dimension embedding schemes of hypercubes in linear arrays are developed. The wavelength resources consumed by either of the two schemes are much less than that required by an optimal static embedding scheme of the same description. As a result, the hypercube-based Bitonic sorting can be performed on WDM linear arrays with limited wavelength resources.