Analysis of acyclic program behaviour in multiprocessor systems

The paper presents modeling of acyclic program behaviour in multiprocessor systems. The proposed mathematical method is general in that it analyzes expected response time of large class of programs with acyclic graphs. The existing methods for analysis of response time in multiprocessor systems have assumed infinite buffers size, exponential distribution of processor service times and Poisson distribution of arrival programs. In the proposed model it is assumed that the buffers (memories) have finite size, processor service times and program interarrival times have general distribution, with only limitations that the first two moments of this variables must be known