A solution for the M^ X/G/1-PS process response time

DOI10.1016/0167-6377(94)90085-XMaRDI QIDQ1342272zbMATH OpenFDO

Authors C. Gary Rommel

Publication date 13 February 1995

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)90085-X

zbMATH Keywords

multitask schedulingparallel programmingprocessor- sharing systemsqueueing theory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Conditional response times in the M/G/1 processor-sharing system
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Processor-sharing queues: Some progress in analysis
• Response-Time Distribution for a Processor-Sharing System
• scientific article; zbMATH DE number 19793

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 3283404 (Why is no real title available?)
• Sharing a Processor Among Many Job Classes
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

Cited in

(5)

• An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
• A mathematical model to estimate average response time of parallel programs
• M^x/G/1 Queue with Multiple Vacations
• Performance analysis of parallel search algorithms on multiprocessor systems
• An Approximate Analysis of a UNIX Macro Process Scheduler

This page was built for publication: A solution for the \(M^ X/G/1\)-PS process response time

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