Fairness of proportional work-conserving I/O scheduling


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, that 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.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Optimal Throughput Fairness Tradeoffs for Downlink Non-Orthogonal Multiple Access Over Fading Channels - 2018ABSTRACT:Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest jointly of
PROJECT TITLE :Max-Min Fairness Rate Control in Wireless Networks: Optimality and Algorithms by Perron-Frobenius Theory - 2018ABSTRACT:Rate adaptation and power control are two key resource allocation mechanisms in multiuser wireless
PROJECT TITLE :Anonymity and Fairness in Packet Scheduling: A Quantitative TradeoffABSTRACT:Fairness among multiple users sharing a standard resource is an important criterion in the planning and evaluation of scheduling algorithms
PROJECT TITLE :Weighted sum throughput maximisation for cooperative relay-aided multi-cell orthogonal frequency division multiple access cellular networks considering partial fairnessABSTRACT:This study addresses resource allocation
PROJECT TITLE :Adaptive rate-based congestion control with weighted fairness through multi-loop gradient projection internal model controllerABSTRACT:As a transmission control protocol (TCP) implementation imposes the sources

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry