{'fraction_non_alphanumeric': 0.010922330097087379, 'fraction_numerical': 0.0048543689320388345, 'mean_word_length': 6.783018867924528, '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}}
Performability Evaluation of Resource Scheduling Algorithms for Computational Grids

Resource scheduling is a fundamental issue in achieving high performance on computational grids. In this paper, we concentrate on parallel resource scheduling problems for hierarchical resource scheduling architecture of computational grids, and propose a stochastic reward nets (SRN) based performability evaluation framework for evaluating the performability of resource scheduling algorithms for computational grid with resource unavailability. Within the proposed framework, performability model of hierarchical resource scheduling is constructed, 36 combinations of 6 global job scheduling algorithms and 6 local processor allocation algorithms are specified in the uniform performability model, and performability metrics are derived