{'fraction_non_alphanumeric': 0.0224, 'fraction_numerical': 0.0, 'mean_word_length': 5.481865284974093, '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}}
Priority based heuristic job scheduling algorithm for the computational grid

This paper presents a model for high-level quality of service (QoS) maintenance within business grid environment. A grid is an infrastructure for resource sharing. Scientific applications require high computing power in processing and can be achieved only in computational grids. For efficient and effective job scheduling, policies allocate different jobs to the resources. The main idea behind the job scheduling is to reduce makespan and improve resource utilization. Business grid environment designed a Business Grid Quality of Service (BGQoS) Algorithm which comprises Grid Resource Consumer (GRC) and Grid Resource Provider (GRP). The success of application is directly related to whether grid resource providers can satisfy the Service Level Agreement (SLA) introduced by grid resource consumers. QoS algorithm allows each authorized GRC to specify a set of QoS required parameters, a time constraint and a cost constraint. BGQoS failed to consider priority and deadline as constraints. To evaluate priority and deadline, proposed a new algorithm, Priority Enhanced Business Grid Quality of Service (PEBGQoS). PEBGQoS produce better makespan and satisfies the SLA.