Scheduling Servers with Stochastic Bilinear Rewards

12/13/2021
by   Jung-Hun Kim, et al.
6

In this paper we study a multi-class, multi-server queueing system with stochastic rewards of job-server assignments following a bilinear model in feature vectors representing jobs and servers. Our goal is regret minimization against an oracle policy that has a complete information about system parameters. We propose a scheduling algorithm that uses a linear bandit algorithm along with dynamic allocation of jobs to servers. For the baseline setting, in which mean job service times are identical for all jobs, we show that our algorithm has a sub-linear regret, as well as a sub-linear bound on the mean queue length, in the horizon time. We further show that similar bounds hold under more general assumptions, allowing for non-identical mean job service times for different job classes and a time-varying set of server classes. We also show that better regret and mean queue length bounds can be guaranteed by an algorithm having access to traffic intensities of job classes. We present results of numerical experiments demonstrating how regret and mean queue length of our algorithms depend on various system parameters and compare their performance against a previously proposed algorithm using synthetic randomly generated data and a real-world cluster computing data trace.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2022

MaxWeight With Discounted UCB: A Provably Stable Scheduling Policy for Nonstationary Multi-Server Systems With Unknown Statistics

Multi-server queueing systems are widely used models for job scheduling ...
research
06/08/2021

Job Dispatching Policies for Queueing Systems with Unknown Service Rates

In multi-server queueing systems where there is no central queue holding...
research
11/16/2020

Improved Load Balancing in Large Scale Systems using Attained Service Time Reporting

Our interest lies in load balancing jobs in large scale systems consisti...
research
02/07/2023

Strategic Behavior and No-Regret Learning in Queueing Systems

This paper studies a dynamic discrete-time queuing model where at every ...
research
05/28/2021

Learning to Schedule

This paper proposes a learning and scheduling algorithm to minimize the ...
research
05/11/2023

Scheduling Multi-Server Jobs with Sublinear Regrets via Online Learning

Nowadays, multi-server jobs, which request multiple computing devices an...
research
02/02/2018

On Learning the cμ Rule in Single and Parallel Server Networks

We consider learning-based variants of the c μ rule for scheduling in si...

Please sign up or login with your details

Forgot password? Click here to reset