We consider the Virtual Clock Scheduling (VCS) algorithm and propose a Time-Priority Model (TPM) for illustrating the algorithm. We show that TPM can represent many time-dependent priority schemes such as FCFS, LCFS, RR, EDF and VGS. Based on TPM, we derive an enhanced virtual clock scheme, Gated Virtual Clock Scheduling (GVCS), which gives the same throughput and delivery guarantee as VCS, but gives a smaller delay for low-rate streams. We consider the implementation of TPM and propose a Programmable Rate-based Scheduler (PRS) which can be programmed at any time to change its configuration or discipline.
|Number of pages||6|
|Publication status||Published - 1 Dec 1997|
|Event||Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA|
Duration: 3 Nov 1997 → 8 Nov 1997
|Conference||Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)|
|City||Phoenix, AZ, USA|
|Period||3/11/97 → 8/11/97|