The completion time of a job on multimode systems

DOI10.2307/1427109MaRDI QIDQ3769747zbMATH OpenOpenAlexFDO

Authors Vidyadhar G. Kulkarni, Victor F. Nicola, Kishor S. Trivedi

Publication date 1987

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427109

zbMATH Keywords

Different types of preemption disciplinesjob completionprocessor-sharing disciplinesemi-Markov processtransform techniquestypes of breakdowns and repair

Mathematics Subject Classification ID

Markov renewal processes, semi-Markov processes (60K15) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 1354850
• scientific article; zbMATH DE number 4030964
• Processor-Shared Time-Sharing Models in Heavy Traffic
• 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
• The M/G/1 processor-sharing model: Transient behavior

Cited in

(22)

• Mathematical problems in the theory of processor-sharing queueing systems
• Numerical analysis of gracefully degrading fault-tolerant computer systems: Semi-Markov and Laguerre transform approach
• Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
• On preemptive-repeat LIFO queues
• Hitting times in Markov chains with restart and their application to network centrality
• Parallel computing, failure recovery, and extreme values
• Markov Renewal Methods in Restart Problems in Complex Systems
• Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals
• Mean completion time for a randomly varying rate of work
• 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 National Research Council CNR under the project “Material and Devices for Solid State Electronics” Grant no. 86.02177.61.
• The expected cumulative operational time for finite semi-Markov systems and estimation
• Reliability of manufacturing equipment in~complex~environments
• Distribution of the minimal completion time of parallel tasks in multi-reward semi-Markov models
• Queues with interruptions: a survey
• Characterizing heavy-tailed distributions induced by retransmissions
• scientific article; zbMATH DE number 967325 (Why is no real title available?)
• On the completion time of a job processed on an unreliable machine
• Gradient estimation for smooth stopping criteria
• Completion times of jobs on two-state service processes and their asymptotic behavior
• Specification techniques for Markov reward models
• Modeling discrete event systems with state-dependent deterministic service times
• Two queues with alternating service and server breakdown

This page was built for publication: The completion time of a job on multimode systems

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