Response time analysis of two server fork-join systems

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.