Exact solution of a simple finite infinite source interaction model (Q1105367): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5332626 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Poisson Arrivals See Time Averages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A queueing model of finite and infinite source interaction / rank | |||
Normal rank | |||
Latest revision as of 18:00, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact solution of a simple finite infinite source interaction model |
scientific article |
Statements
Exact solution of a simple finite infinite source interaction model (English)
0 references
1987
0 references
Networks of queues with finite and infinite source customers have been used to study the interaction between the batch jobs and interactive jobs in computer systems. Earlier \textit{J. S. Kaufman} [in ``Performance '84'', North-Holland (1984; Zbl 0572.68006), pp. 345-348], developed accurate approximations for a simple non-product form network of this type. In this paper we offer exact solutions for the same model with one finite source customer. We study both FIFO and LIFO disciplines at the contention node. The results are derived for the case where the finite source think time and service time distributions are generalized hyperexponential.
0 references
batch jobs
0 references
interactive jobs
0 references
computer systems
0 references
non-product form network
0 references
exact solutions
0 references
FIFO
0 references
LIFO
0 references
