{'fraction_non_alphanumeric': 0.009195402298850575, 'fraction_numerical': 0.0, 'mean_word_length': 5.598484848484849, '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}}
Grid Computing Systems and Combinatorial Optimization

The goal of this paper is to study the applicability of a combinatorial optimization model in grid resource optimization. The advent of grid computing and demand for QoS guarantees call for a need of advance reservation mechanisms in order to coordinate resource sharing between autonomous partners. This term means the guarantee of providing specific resources at a specific time. The paper assumes that grid resource sharing can greatly benefit from the application of combinatorial optimization for improving the advance reservation mechanisms. Specifically, the temporal knapsack problem is used for modeling the advance reservation. For improving the QoS guarantees and efficient advance reservation, a new methods based on dynamic programming and a decomposition of the temporal knapsack problem is developed.