{'fraction_non_alphanumeric': 0.013785790031813362, 'fraction_numerical': 0.0, 'mean_word_length': 5.9411764705882355, '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}}
Performance Evaluation of Batch Scheduling Strategy with Precedence Constraints for Computational Grid

Computational grid is computation platform of geographically distributed heterogeneous computational machines which can be accessed by needy users via a single interface. Efficient scheduling is the core concern in computational grid for achieving the user's need with optimizing Quality of Service (QoS) parameters. The mapping problem of batch of jobs onto computational nodes with heterogeneities optimizing QoS with precedence constraints in grid had been manifested as NP-Complete. Present study presented the Precedence based Batch Scheduling Strategy (PBSS) in which independent jobs in the batch are considered of having noncommunicating modules with precedence constraints represented by Direct Acyclic Graph (DAG). A comparative performance analysis is done to evaluate the significance of PBSS with its peers for the middleware.