{'fraction_non_alphanumeric': 0.013468013468013467, 'fraction_numerical': 0.0, 'mean_word_length': 5.371428571428571, '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 novel scheduling strategy for an efficient deadlock detection

Deadlock is one of the most important problems in distributed and centralized systems. Many algorithms are introduced for the detection of deadlock; however some of them suffer from increasing the number of processes, while the others take long processing time. This paper studies the impact of deadlock detection on the overall performance of deadlock handling. Network performance largely relies on the accuracy of deadlock detection. This paper proposes a deadlock detection protocol based on threads, processes which are acquired, released or stopped and which thread wait for the other and causes the deadlock. Our algorithm makes the detection goes faster, reliable and schedules the threads in order to detect which thread would initiate the deadlock. Our algorithm simulation results forecasted the deadlock initiator.