A Processor-Shared Queue That Models Switching Times: Normal Usage

DOI10.1137/0152050MaRDI QIDQ4012481zbMATH OpenOpenAlexFDO

Authors Charles Tier, Charles Knessl

Publication date 27 September 1992

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0152050

zbMATH Keywords

asymptotic approximationsnumerical comparisonsprocessor-shared queue

Mathematics Subject Classification ID

Singular perturbations for ordinary differential equations (34E15) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics
• On a processor sharing queue that models balking
• scientific article; zbMATH DE number 19793
• A Time-Sharing Queue
• On the transient behavior of the processor sharing queue
• scientific article; zbMATH DE number 4030964
• Processor-sharing queues: Some progress in analysis
• Predicting response times in processor-sharing queues

Cited in

(5)

• Equivalent single-queue-single-server model for a pentium processor
• Asymptotic Analysis for a Closed Processor-Sharing System with Switching Times: Normal Usage
• Processor-Shared Time-Sharing Models in Heavy Traffic
• A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics
• A Finite Capacity PS Queue Which Models Switching Times

This page was built for publication: A Processor-Shared Queue That Models Switching Times: Normal Usage

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