{'fraction_non_alphanumeric': 0.011639185257032008, 'fraction_numerical': 0.0, 'mean_word_length': 5.615384615384615, '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}}
A Deadline-Aware Concurrency Control Scheme for Composite Services

This paper proposed a concurrency control scheme for composite services with time constraints. In the proposed scheme, in order to determine the dependency relations between the composite services more accurately, the proposed scheme analyzes the SQL statements executed by the composite services at run-time to identify the dependency relation among the composite services. The proposed scheme also analyzes the workflow specifications of the composite services, and, uses the information gathered from the analysis to reduce the overhead in detecting cycles in the serialization graph. The proposed scheme takes into account of the time constraints on the composite services while scheduling the execution of the composite services. This measure reduced the number of composite services that failed to meet their deadlines. The empirical results show that the proposed scheme performs better than the existing concurrency control schemes for composite services.