{'fraction_non_alphanumeric': 0.012330456226880395, 'fraction_numerical': 0.002466091245376079, 'mean_word_length': 5.151515151515151, '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}}
Framework for efficient and flexible scheduling of flash memory operations

Flash memory-based storages are used in a wide range of systems from small mobile devices to large-scale system servers. The performance demand from applications and the technology of flash memory vary widely from one system to another, making it difficult to design a universal flash memory scheduler for all systems. In this paper, we present a framework for efficient and flexible flash memory scheduling and compare a software scheduler based on the framework against an optimized hardware scheduler. The throughput of the software scheduler achieves more than 97% of that of the hardware scheduler across workloads we consider. We further highlight the extensibility of the framework with a case study on fair queueing scheduling.