{'fraction_non_alphanumeric': 0.0155195681511471, 'fraction_numerical': 0.0, 'mean_word_length': 5.364806866952789, '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}}
Adaptive load balancing with bidirectional piggybacking

Computer network technology is no longer experimental. Having come of age, this technology is now both practical and necessary. Downsizing of computers and open and high-speed networks have required multimedia processing as well as traditional data processing on a networked system connected by various types of computers. However, in current network systems, users are responsible for job submission, while simultaneously considering what and where the necessary and available resources are. This will create a heavier burden in the future. A framework of load balancing with distributed dispatchers that uses an analysis of network delay and job characteristics is proposed here. Examining an adaptive load balancing scheme with bidirectional piggybacking permits basic study of this framework. First a bidirectional piggybacking is proposed that uses the results of a job as an information carrier for a remote server and that uses the request of a job as an information carrier for a local server. We also propose a load balancing scheme using bidirectional piggybacking. This scheme is then compared with other schemes on homogeneous and heterogeneous environments with and without communication delay. Finally, the reliability of piggy-backed information on the arrival rate of local/remote job, communication delay, etc. are discussed. The effects of this scheme based on bidirectional piggybacking are also discussed.