Approximations for moments of response times in time sharing queues with limited number of service positions

DOI10.1080/15326349108807176zbMATH Open0722.60097OpenAlexW2071928027MaRDI QIDQ3209974FDOQ3209974

Authors: Benjamin Avi-Itzhak, Shlomo Halfin 

Publication date: 1991

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349108807176

Recommendations

• Publication:4860694
• Response times in M/M/1 time-sharing schemes with limited number of service positions
• Response times in processor-shared queuses with state-dependent arrival rates
• scientific article; zbMATH DE number 3943021
• Conditional response times in the M/G/1 processor-sharing system

zbMATH Keywords

linear approximationprocessor sharingtime sharing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (5)

• An approximation for the mean response time for shortest queue routing with general interarrival and service times
• Waiting time estimates for programs in a computer with limited resources
• Response times in M/M/1 time-sharing schemes with limited number of service positions
• Response times in processor-shared queuses with state-dependent arrival rates
• Title not available (Why is that?)

This page was built for publication: Approximations for moments of response times in time sharing queues with limited number of service positions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3209974)