{'fraction_non_alphanumeric': 0.013874066168623266, 'fraction_numerical': 0.0, 'mean_word_length': 5.513888888888889, '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}}
Deadlocks in fully uncoordinated checkpointing rollback recovery systems

Synchronization issues in checkpointing and rollback recovery schemes have been dealt with in depth over the past few years. The authors investigate the possibility of deadlocks in a fully uncoordinated checkpointing system. A protocol is first illustrated for a fully uncoordinated checkpointing scheme. Rollback propagation analysis (RPA) is performed using a stack based algorithm. The probability of deadlock (due to rollbacks) for a finite buffer size is then computed. The optimal number of buffers required to eliminate the possibility of deadlock is calculated. Finally a comparative analysis is performed between the predicted buffer size and the simulated result. The simulation study shows that the probability of deadlock decreases as the number of buffers increases, till an optimal buffer size is reached where the deadlock probability becomes zero.