The completion time of a job on multimode systems
DOI10.2307/1427109zbMATH Open0632.60101OpenAlexW4238662130MaRDI QIDQ3769747FDOQ3769747
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
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
semi-Markov processtransform techniquesprocessor-sharing disciplinejob completionDifferent types of preemption disciplinestypes of breakdowns and repair
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Markov renewal processes, semi-Markov processes (60K15)
Cited In (20)
- Parallel computing, failure recovery, and extreme values
- Modeling discrete event systems with state-dependent deterministic service times
- Specification techniques for Markov reward models
- Queues with interruptions: a survey
- Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals
- 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.
- Hitting times in Markov chains with restart and their application to network centrality
- Characterizing Heavy-Tailed Distributions Induced by Retransmissions
- On preemptive-repeat LIFO queues
- The expected cumulative operational time for finite semi-Markov systems and estimation
- Gradient estimation for smooth stopping criteria
- Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- Two queues with alternating service and server breakdown
- On the completion time of a job processed on an unreliable machine
- 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
- 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
- Reliability of manufacturing equipment in~complex~environments
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)
