{'fraction_non_alphanumeric': 0.016519823788546256, 'fraction_numerical': 0.0, 'mean_word_length': 5.0198675496688745, '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}}
A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks

In this paper, a load sharing problem involving the optimal load allocation of a linear data file over N processors interconnected in a bus-oriented network is investigated. Three distinct types of bus networks are examined in the case when there is more than one outstanding divisible job in the network. These are a network with a control processor for load distribution, a network without control processor but whose processors are equipped with front-end processors for communications off-loading, and finally a network without control processor and with processors without front-end processors. It is found that a multi-job scheme outperforms a single-job scheme in terms of the total solution finish time. Closed form solutions and simple recursive algorithms for the determination of the optimal load allocation are also presented.