{'fraction_non_alphanumeric': 0.012108980827447022, 'fraction_numerical': 0.0, 'mean_word_length': 5.318471337579618, '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}}
Collaborative Path Prediction in Cache Pre-fetching for Distributed State Machines

Modeling distributed processes using state machines is gaining importance as the serverless computing becomes more widespread. One of the important issues in distributed state machine execution is to perform better caching approaches. Due to the nature of state machines, the amount of different paths that can be executed by a state machine is limited. This property can be utilized to perform better caching by predicting which path is going to be taken. In this paper, we analyze former execution history of distributed state machines to perform better predictions. We also run experiments to find out if collaboratively using the history of the state machine instances makes any significant improvements on pre-fetching decision. Our results show that pre-fetching significantly decrease the number of cache misses while history sharing between instances provides improvements in a more limited fashion.