This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Memory Interference Model for Regularly Patterned Multiple Stream Vector Accesses
May 1995 (vol. 6 no. 5)
pp. 520-530

Abstract—Most existing analytical models for memory interference generally assume random bank selection for each memory access. In vector computers, however, memory accesses are typically regularly patterned with a number of data items being accessed concurrently from different banks. Very little is known about the queueing behavior of memory interferences in multiple stream vector accesses. This paper presents an analytical model for memory interferences due to vector accesses in multiple vector processor systems. The model captures the effects of both bank conflicts among elements within one vector access stream and conflicts among multiple vector access streams on system performance. The model is based on a closed queueing network assuming an ideal interconnection network. An approximation technique is proposed to solve the memory queueing system that serves customers in a complicated way (non-FIFO). We also carry out extensive simulation experiments to study memory interference and validate our analytical model. Simulation results and analytical results are in a very good agreement, indicating that the model is very accurate. We further validate our analysis by comparing the numerical results obtained from our analytical model with those measurement results that were published by other researchers. Based on our analytical model and simulations, we carry out performance evaluation of the multiple vector processor systems. Our numerical results show that memory access conflicts pose a severe limitation on the number of useful processors in the system, implying that memory system design is essential to high-performance computing.

[1] R. Raghavan and J. P. Hayes,“Scalar-vector memory interference in vector computers,”inProc. Int. Conf. Parallel Process., Aug. 1991, pp. 1180–1187.
[2] D.H. Bailey,“Vector computer memory bank contention,” IEEE Trans. Computers, vol. 36, pp. 293-298, 1987.
[3] I. Y. Bucher and D. A. Calahan,“Access conflicts in multiprocessor memories queueing models and simulation studies,”inProc. 1990 Int. Conf. Supercomput., 1990, pp. 428–438.
[4] D.A. Calahan, "Some Results in Memory Conflict Analysis," Proc. Supercomputing '89, pp. 775-778, Nov. 1989.
[5] P. Tang and R.H. Mendez, "Memory Conflicts and Machine Performance," Proc. Supercomputing '89, pp. 826-831, 1989.
[6] D. Y. Chang, D. J. Kuck, and D. H. Lawrie,“On the effective bandwidth of parallel memories,”IEEE Trans. Comput., vol. C-26, pp. 480–489, 1977.
[7] I.Y. Bucher and Simmons, "Measurement of Memory Access Contentions in Multiple Vector Processors," Proc. Supercomputing '91, pp. 806-817, 1991.
[8] D. T. Harper, III,“Block, multistride vector, and FFT accesses in parallel memory systems,”IEEE Trans. Parallel and Distrib. Syst., vol. 2, pp. 43–51, Jan. 1991.
[9] D.T. Harper and J.R. Jump,“Vector access performance in parallel memoriesusing a skewed storage scheme,” IEEE Trans. Computers, vol. 36, pp. 1440-1449, 1987.
[10] W. Oed and O. Lange,“On the effective bandwidth of interleaved memories invector processing systems,” IEEE Trans. Computers, vol. 34, no. 10, pp. 949-957, Oct. 1985.
[11] A. J. Pettofrezzo and D. R. Byrkit,Elements of Number Theory. Englewood Cliffs, NJ: Prentice-Hall, 1970.
[12] E.D. Lazowska, J. Zahorjan, G.S. Graham, and K.C. Sevcik, Quantitative System Performance, Prentice Hall, pp 64-66, 1984.
[13] Q. Yang and L. N. Bhuyan,“Analysis of packet-switched multiple-bus multiprocessor systems,”IEEE Trans. Comput., Mar. 1991.
[14] Q. Yang, L. Bhuyan, and B.-C. Liu,“Analysis and comparison of cache coherence protocols for a packet-switched multiprocessor,”IEEE Trans. Comput., Special Issue on Distributed Computer Systems, vol. 38, pp. 1143–1153, Aug. 1989.
[15] Q. Yang and L. W. Yang,“A novel cache design for vector computers,”in19th Annu. Int. Symp. Comput. Arch., Queensland, Australia, May 1992, pp. 362–371.
[16] K. So and V. Zecca,“Cache performance of vector processors,”inProc. 15th. Int. Symp. Comput. Arch., 1988, pp. 261–268.
[17] J. W. C. Fu and J. H. Patel,“Data prefetching in multiprocessor vector cache memories,”inProc. 18th. Int. Symp. Comput. Arch., 1991, pp. 54–63.
[18] M. Lam, E. Rothberg, and M. Wolf, “The Cache Performance and Optimizations of Blocked Algorithms,” Proc. Fourth Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '91), 1991.
[19] Q. Yang,“Introducing a new cache design into vector computers,”IEEE Trans. Comput., vol. 42, pp. 1411–1424, Dec. 1993.

Citation:
Qing Yang, Tao Yang, "A Memory Interference Model for Regularly Patterned Multiple Stream Vector Accesses," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 5, pp. 520-530, May 1995, doi:10.1109/71.382320
Usage of this product signifies your acceptance of the Terms of Use.