{'fraction_non_alphanumeric': 0.013347022587268994, 'fraction_numerical': 0.0, 'mean_word_length': 5.055900621118012, '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}}
Heuristic scheduling for multimedia streams with firm deadlines

Multimedia streams such as audio and video require real-time manipulation. Unlike hard real-time tasks, however they have firm deadlines since the loss of a few frames does not lend to a significant degradation in quality. In this paper, we propose a simple but efficient scheduling scheme for multimedia streams using heuristic functions. The proposed heuristic function takes into account the fail ratio and the consecutive fail count in order to avoid consecutive fails of a multimedia task, and at the same time, to meet the given quality of all the accepted multimedia tasks in the system. By gracefully degrading the quality of the existing multimedia tasks, our scheme can meet the QoS of a newly arriving task accepted by the proposed admission control criteria. Extensive simulation has been performed to validate the effectiveness of the scheme under various multimedia task sets and QoS parameters.