{'fraction_non_alphanumeric': 0.009512485136741973, 'fraction_numerical': 0.0, 'mean_word_length': 5.427480916030534, '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}}
Experimentation with bounded buffer synchronization

Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditional approach to teaching these topics is not effective in conveying to students how programs with incorrect synchronization actually behave. This paper introduces a simple probabilistic model for synchronization failure and shows how students can empirically study these issues. These activities are supported by a simulator that students can use to explore synchronization in the context of the bounded buffer problem. The simulator is written in Java and can be used either standalone or from a standard browser. Students can save the data and graphs generated by the simulator in a log file in HTML format.