A cyclic-service finite source model with round-robin scheduling

Abstract

A cyclic-service finite source model with round-robin scheduling is considered. A single server scans sources in a cyclic manner whether there is a request or not. Each request consists of multiple tasks and only one task can be served when the server scans. We provide the exact analysis of the average response time in a heterogeneous finite source model, where the service times of tasks are distributed according to general probability distributions which may be different from one source to another. Further, we derive the Laplace-Stieltjes transform of the probability distribution function of the waiting time.