Computation of the distribution of the completion time when the work requirement is a ph random variableThis work was supported in part by the US Office of Naval Research under Contract no. N3014-88-K-0623, by NASA under Grant NAG-1-70, and by the Italian

DOI10.1080/15326349908807140zbMATH Open0708.60087OpenAlexW1997806963MaRDI QIDQ3490733FDOQ3490733

Authors: Kishor S. Trivedi, Andrea Bobbio 

Publication date: 1990

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

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

Recommendations

• Distribution of the minimal completion time of parallel tasks in multi-reward semi-Markov models
• scientific article; zbMATH DE number 1354850
• scientific article; zbMATH DE number 279302
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• The completion time of a job on multimode systems

zbMATH Keywords

PH distributionMarkov reward modelsparse matrix storage technique

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (6)

• Parallel computing, failure recovery, and extreme values
• On providing blocking probability and throughput guarantees in a multi-service environment
• The completion time of a job on multimode systems
• Mean completion time for a randomly varying rate of work
• Distribution of the minimal completion time of parallel tasks in multi-reward semi-Markov models
• Markov Renewal Methods in Restart Problems in Complex Systems

This page was built for publication: Computation of the distribution of the completion time when the work requirement is a ph random variableThis work was supported in part by the US Office of Naval Research under Contract no. N3014-88-K-0623, by NASA under Grant NAG-1-70, and by the Italian

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