Response-Time Analysis of Two Server Fork-Join Systems

Authors:
E. Varki;L. W. Dowdy
Affiliations:
-;-
Venue:
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Year:
1996

Citing 1
Cited 1

The Distribution of Queuing Network States at Input and Output Instants

Journal of the ACM (JACM)

Analysis of balanced fork-join queueing networks

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives an exact analysis of mean response time of fork-join systems. The response time is shown to be the sum of parallel wait and parallel service times which are analogous to wait and service times in non-parallel systems. It is shown that the parallel service time of a job is dependent on the state at arrival time of the job. A formal parallel wait time analysis, similar to the wait time analysis of non-parallel systems is also given. The analysis is carried out using event/time sequence (ET-S) trees, a simple modeling technique introduced in this paper.