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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
