On Competitive Analysis for Polling Systems

01/07/2020
by   Jin Xu, et al.
0

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/06/2011

Comparison of Loss ratios of different scheduling algorithms

It is well known that in a firm real time system with a renewal arrival ...
06/04/2018

Improving rewards in overloaded real-time systems

Competitive analysis of online algorithms has commonly been applied to u...
08/14/2022

An Improved Greedy Algorithm for Stochastic Online Scheduling on Unrelated Machines

Most practical scheduling applications involve some uncertainty about th...
12/13/2021

On Exact and Approximate Policies for Linear Tape Scheduling in Data Centers

This paper investigates scheduling policies for file retrieval in linear...
03/30/2021

Scheduling in the Secretary Model

This paper studies Makespan Minimization in the secretary model. Formall...
08/07/2019

Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distribution

Queuing systems with redundant requests have drawn great attention becau...
02/13/2021

Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times

We present a unified framework for minimizing average completion time fo...