By Topic

On maximum rate control of weighted fair scheduling for transactional systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jeng Farn Lee ; Inst. of Inf. Sci., Sinica Acad., Taiwan ; Yeali Sun ; Meng Chan Chen

While existing weighted fair scheduling schemes guarantee minimum service rates of a shared server (such as a computer or a communication channel), maximum rate control was generally enforced by employing policing mechanisms. The previous approaches use either a concatenation of rate controller and scheduler, or a policer in front of scheduler. The concatenation method uses two sets of queues and management apparatus, and thus incurs overhead. The other method allows bursty job requests that may violate maximum rate constraint. In this paper, we present a new weighted fair scheduling scheme, WF2Q-M, to simultaneously support maximum rate control by distributing the excess bandwidths of maximum rate constrained sessions to other sessions without recalculating the virtual starting and finishing times of regular sessions. In terms of performance metrics, we prove that WF2Q-M is theoretically bounded by a fluid reference model. A procedural scheduling implementation of WF2Q-M is proposed and proof of correctness is given. Finally, we conduct extensive experiments to show the performance of WF2Q-M is just as we claim.

Published in:

Real-Time Systems Symposium, 2003. RTSS 2003. 24th IEEE

Date of Conference:

3-5 Dec. 2003