{'fraction_non_alphanumeric': 0.022135416666666668, 'fraction_numerical': 0.0, 'mean_word_length': 5.252032520325203, '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}}
Partitioning bin-packing algorithms for distributed real-time systems

In this paper, we study extensions to bin packing algorithms to pack software modules into processors in real-time systems. We refer to this approach as Partitioning Bin-Packing. In this study, we analytically show that with partitioning bin-packing techniques the number of bins required by traditional bin packing can be reduced. We also evaluate heuristics to minimise both the number of processors (bins) needed and the network bandwidth required by communicating software modules that are partitioned across different processors. We find that a significant reduction in the number of bins is possible. Finally, different heuristics lead to different tradeoffs in processing vs. network needs.