High Throughput Disk Scheduling with Fair Bandwidth Distribution
نویسندگان
چکیده
منابع مشابه
It's not fair - evaluating efficient disk scheduling
Storage system designers prefer to limit the maximum queue length at individual disks to only a few outstanding requests, to avoid possible request starvation. In this paper, we evaluate the benefits and performance implications of allowing disks to queue more requests. We show that the average response time in the storage subsystem is reduced when queuing more requests and optimizing (based on...
متن کاملDynamic bandwidth allocation with fair scheduling for WCDMA systems
Dynamic bandwidth allocation (DBA) will play an important role in future broadband wireless networks, including the 3G and 4G WCDMA systems. A code-division generalized processor sharing (CDGPS) fair scheduling DBA scheme is proposed for WCDMA systems. The scheme exploits the capability of the WCDMA physical layer, reduces the computational complexity in the link layer, and allows channel rates...
متن کاملAn Adaptive Scheduling Scheme for Fair Bandwidth Allocation
Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are e...
متن کاملDisk Scheduling Proposal for an In-Band Bandwidth Virtualization Schema
This paper proposes a new disk scheduling algorithm for a storage virtualization schema, decoupling virtual disks and physical disks. It allows the system to virtualize not only the storage capacity, but also the storage bandwidth, following QoS directives. That virtualization can be applied to the applications bandwidth and access time requirements, allowing that each virtual disk could be use...
متن کاملCell Throughput Analysis of the Proportional Fair Scheduling Policy
The fairness concept has been widely studied in the area of data networks. The most well-known fairness criterion, max-min fairness, gives priority to the minimum rate session. Kelly questioned its appropriateness in his works on the bandwidth sharing among the end-to-end flows and proposed another fairness criterion preferring short distance flows to enhance the overall throughput, which is ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2010
ISSN: 0018-9340
DOI: 10.1109/tc.2010.105