{'fraction_non_alphanumeric': 0.021574973031283712, 'fraction_numerical': 0.0, 'mean_word_length': 5.3561643835616435, '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}}
Network Aspects of Grid Scheduling Algorithms

Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly computing- and data-interisive jobs. In order to obtain quality schedules, different factors such as resource load and data location need to be taken into account. We study the use of simultaneous data transfer and job execution (vs. data pre-staging), and the use of capacitated VPNs to secure upfront resource-to-resource bandwidth availability (vs. a pure FCFS connection setup policy) for different network bandwidths. Our results show that average job response time and resource reservation accuracy can be improved by including network information in traditional scheduling strategies, and even more by preventing discrimination of certain job types by making upfront bandwidth reservations for those types.