{'fraction_non_alphanumeric': 0.011157601115760111, 'fraction_numerical': 0.0, 'mean_word_length': 5.838095238095238, '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}}
The analysis and comparison of scheduling controls in concurrent languages through classification

Courses in concurrent programming are now a standard part of computer science curricula. The control of task scheduling and intertask communication scheduling within concurrent programs are important aspects in understanding the tasking model especially for embedded real-time systems. In order to deal with these scheduling controls in a systematic way in the classroom, the Illinois Institute of Technology has developed terminology to classify these controls. This paper describes this classification, gives examples of each control in current concurrent languages, and discusses the issues related to each control.