Title :
Analysis of memory interference in buffered multiprocessor systems in presence of hot spots and favorite memories
Author :
Das, Sajal K. ; Sen, Sanjoy K.
Author_Institution :
Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA
Abstract :
We present a discrete Markov chain model for analyzing the effect of memory interference in processor-memory interconnections of buffered multiprocessor systems. Each module is assumed to be one of the following three types-hot memory, favorite memory and memory which is neither hot nor favorite. The analytical solutions are restricted to 2×M and N×2 systems, where N and M are respectively the number of processors and memory modules. The general case is analyzed using simulation studies and compared with the analytic results. In all cases the main criterion of the system performance are the effective bandwidth, mean queue length and mean waiting time for a memory request. It is expected that increasing the number K of hot modules will improve the performance. We also estimate the asymptotic bandwidth and propose a heuristic to find an upper bound on K beyond which the bandwidth saturates
Keywords :
Markov processes; performance evaluation; shared memory systems; asymptotic bandwidth; buffered multiprocessor systems; discrete Markov chain model; favorite memory; hot memory; hot spots; mean queue length; mean waiting time; memory interference; memory request; processor-memory interconnections; simulation studies; upper bound; Analytical models; Bandwidth; Communication switching; Interference; Multiprocessing systems; Multiprocessor interconnection networks; Resource management; Switches; System performance; Upper bound;
Conference_Titel :
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Conference_Location :
Honolulu, HI
Print_ISBN :
0-8186-7255-2
DOI :
10.1109/IPPS.1996.508070
