{'fraction_non_alphanumeric': 0.01764705882352941, 'fraction_numerical': 0.0, 'mean_word_length': 4.82051282051282, '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}}
OM Algorithm for Multi-level Queue Scheduling

Today being the era of supercomputing, managing multiple tasks with a single processor is an old story. It is the time of multitasking and multiprogramming. There exist numerous scheduling algorithms that are invented to provide more efficiency and ease of use in field of multiprocessor scheduling. Though these are competent, but the best is yet to be uncovered. This paper is an effort to add to the list of scheduling algorithms. It takes into account the SJF (Shortest Job First) scheduling algorithm to enhance and modify the concept of multi-level queue scheduling to conceptualize a new and innovative algorithm for the same.