Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service

Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair to individual jobs. The standard method for balancing average QoS and fairness is optimize the p metric, 1 < p < . Thus we consider server scheduling strategies to optimize the p norms of the standard QoS measures, flow and stretch. We first show that there is no no(1) competitive online algorithm for the p norms of either flow or stretch. We then show that the standard clairvoyant algorithms for optimizing average QoS, Shortest Job First (SJF) and Shortest Remaining Processing Time (SRPT), are almost fully scalable for the p norms of flow and stretch. And that the standard nonclairvoyant algorithm for optimizing average QoS, Shorest Elapsed Time First (SETF), is also almost fully scalable for the p norms of flow. In contrast, we show that the Round Robin, or Processor Sharing algorithm, which is someti...

• Type: Journal
• Year: 2010
• Where: SIAMCOMP
• Authors: Nikhil Bansal, Kirk Pruhs
• Keywords: Algorithms, Average Qos, Nonclairvoyant Algorithm, SIAMCOMP 2010