Affiliation:
1. Columbia University, New York, NY
Abstract
We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献