Multiprocessor systems with reserves and preferences

DOI10.1007/BF01158901MaRDI QIDQ1105349zbMATH OpenFDO

Authors I. Mitrani

Publication date 1987

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01158901

zbMATH Keywords

breakdownsfinite state spacemultiprocessor systemspartial differential-functional equationPoisson stream of jobsserver availabilitytwo-dimensional Markov processes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Review text

Two models involving multiprocessor systems with two different groups of processors are examined. In the first model, the processors which are in use break down from time to time; one of the two groups is used only when the other one is entirely inoperative. In the second model, the breakdowns are replaced by a Poisson stream of jobs. Again, one group of processors is used in preference to the other one. In both cases, the analysis is based on finding a polynomial in two variables which satisfies a partial differential-functional equation. Exact solutions are obtained.

Recommendations

• Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies
• Modeling a Multiprocessor System with Preemptive Priorities
• scientific article; zbMATH DE number 3874592
• scientific article; zbMATH DE number 732082
• scientific article; zbMATH DE number 3880108

Cites work

• A Many-Server Queue with Service Interruptions
• scientific article; zbMATH DE number 3705055 (Why is no real title available?)
• scientific article; zbMATH DE number 3196275 (Why is no real title available?)
• Multiprocessor systems with preemptive priorities

Cited in

(23)

• Delay and partial system contents for a discrete-time G-D-c queue
• On product form approximations for communication networks with losses: Error bounds
• Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
• Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies
• On bounds of response time performance achievable by multiclass single- server queues
• Transient analysis of queues with heterogeneous arrivals
• Reliability analysis of complex communication systems
• Two processes interacting only during breakdown: The case where the load is not lost
• A multi-class discrete-time queueing system under the FCFS service discipline
• Analysis of discrete-time queues with general service demands and finite-support service capacities
• Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline
• Time-dependent analysis for a two-processor heterogeneous system with time-varying arrival and service rates
• Analysis of a discrete-time queue with general service demands and phase-type service capacities
• Performance analysis of buffers with train arrivals and correlated output interruptions
• Discrete-time queues with variable service capacity: a basic model and its analysis
• Modeling a Multiprocessor System with Preemptive Priorities
• scientific article; zbMATH DE number 3965431 (Why is no real title available?)
• Delay analysis of a discrete-time multiclass slot-bound priority system
• scientific article; zbMATH DE number 732082 (Why is no real title available?)
• Queueing models for the analysis of communication systems
• Simple performance estimates and error bounds for slotted ALOHA loss systems
• Analysis of a discrete-time queue with general independent arrivals, general service demands and fixed service capacity
• Lattice path counting and the theory of queues

This page was built for publication: Multiprocessor systems with reserves and preferences

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