{'fraction_non_alphanumeric': 0.012605042016806723, 'fraction_numerical': 0.0, 'mean_word_length': 5.75886524822695, '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}}
Dispatcher Algorithm for Effective Resource Utilization of Server using Volunteer Computing : A Case Study

Data partitioning and load balancing are important components of parallel computations. Many different partitioning strategies have been developed, with great effectiveness in parallel applications. But the problem of loadbalancing the server is not yet solved completely. New applications and architectures require new partitioning features. Existing algorithms must be enhanced to support more complex applications. This paper discusses the design and implementation of the dispatcher algorithm using volunteer computing for effective utilization of the resource of server. Also presents a case study which examines the implementation of the dispatcher algorithm, by a server, A proper scheduling and efficient load balancing across the network can lead to improve overall system performance and a lower turn-around time for individual tasks.