Skip to Main Content
This correspondence seeks to generalize and clarify the general model for memory interference (GMI) in multiprocessors as proposed by Hoogendoorn. The interference model creates a queueing network where some service centers are FCFS with constant service times; therefore, we also apply the mean value analysis (MVA) approxdmation suggested by Reiser to solve this model. Furthermore, we reduce the computations in this approximation by applying the iterative scheme suggested by Schweitzer. Although many authors have studied the memory interference problem, nobody has used the above-mentioned MVA approximations. We study these MVA approximations in the context of the memory interference problem and show that they produce better results with much less computation.