{'fraction_non_alphanumeric': 0.0178359096313912, 'fraction_numerical': 0.0, 'mean_word_length': 4.929577464788732, '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}}
Modification over C-Look Disk scheduling

Disk scheduling is responsibility of operating system. To achieve this, it is required that disk drives should have fast access time and bandwidth. To improve both access time and bandwidth we need to schedule the servicing of disk I/O Request in efficient way. There are various Algorithm proposed previously for Disk scheduling. With any scheduling algorithms, performance depends heavily on the number and types of requests. For example suppose there is only one request to serve, then all algorithms are force to behave like FCFS. For every scheduling algorithm, we calculate head movement. Algorithm giving least head movement is better for a given list of request. This paper presents a new algorithm giving least head movement and is basically a modification over C_Look scheduling algorithm.