Abstract
Proposed is a new I/O scheduling for SSD, proportional work-conserving. The proposed scheduling algorithm provides proportional fairness among tasks. To provide proportional fairness, proportional work-conserving differentiates probability to fully utilise the task's quantum, which is controlled by adjusting opportunistic waiting time. Its proportional fairness is formally proveds and its validity through numerical evaluation and experimental results from Linux implementation are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
