Sojourn times in (discrete) time shared systems and their continuous time limits

DOI10.1007/S11134-008-9092-7zbMATH Open1156.90333OpenAlexW2015363366MaRDI QIDQ1007142FDOQ1007142

Authors: Arzad A. Kherani 

Publication date: 27 March 2009

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-008-9092-7

Recommendations

• ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
• An Approximate Analysis of Sojourn Times in the M/G/1 Queue With Round-Robin Service Discipline
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• On the average sojourn time under \(M/M/1/\)SRPT
• Sojourn times in a processor sharing queue with service interruptions

zbMATH Keywords

discriminatory processor sharingage based schedulingresidual processing time based schedulingtime shared systems

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• A new approach to the M/G/1 processor-sharing queue
• Title not available (Why is that?)
• Waiting Time Distributions for Processor-Sharing Systems
• Sharing a Processor Among Many Job Classes
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Asymptotic convergence of scheduling policies with respect to slowdown
• On extremal service disciplines in single-stage queueing systems
• Large deviations of sojourn times in processor sharing queues
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Quadrature Methods for Integral Equations of the Second Kind Over Infinite Intervals
• On the response time distribution in a discrete round-robin queue
• Preferential treatment for short flows to reduce web latency.
• The maximum queue length for heavy-tailed service times in the \(M/G/1\) FB queue
• Asymptotic Evaluation of Delay in the SRPT Scheduler

Cited In (3)

• ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
• An error bound for a continuous time approximation of a time-sharing queue
• Title not available (Why is that?)

This page was built for publication: Sojourn times in (discrete) time shared systems and their continuous time limits

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