Skip to main content
Log in

Memory conflict resolution in vector supercomputers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper presents a simulation study of several conflict-handling methods in shared-memory vector processors. These methods differ with respect to (1) the way memory sections are accessed, (2) the types of conflicts that may occur, (3) whether a conflict halts the vector stream or not, and (4) buffering of pending requests. In the first method, access privilege to a particular section of memory is exclusively granted to each vector stream in its own time phase. This static control strategy prevents contention in the memory interconnect at the expense of a limited capability to adapt to dynamic situations. Two dynamic methods are also considered, in which simultaneous bank conflicts and line conflicts may occur and are resolved at run time. A fourth method helps to identify the relative contribution of the different types of memory conflicts. We also study linked conflicts that occur due to buffering in the time-phased strategy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bailey, D.H. 1987. Vector computer memory bank contention. IEEE Trans. Comps., C-36 (Mar.): 293–298.

    Google Scholar 

  • Bucher, I.Y., and Simmons, M.L. 1987. A close look at vector performance of register-to-register vector computers and a new model. In Proc., 1987 ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, ACM Press, pp. 39–46.

  • Bucher, I.Y., and Simmons, M.L. 1991. Measurement of memory access contention in multiple vector processor systems. In Proc., Supercomputing '91 Conf. (Albuquerque, New Mex., Nov. 18–22), IEEE Comp. Soc. Press, pp. 806–817.

    Google Scholar 

  • Calahan, D.A. 1988. An analysis of vector startup access delays. IEEE Trans. Comps., C-37 (Sept.): 1134–1137.

    Google Scholar 

  • Calahan, D.A., and Bailey, D.H. 1988. Measurement and analysis of memory conflicts in vector multiprocessors. In Performance Evaluation of Supercomputers (J.L. Martin, ed.), Elsevier.

  • Cheung, T., and Smith, J.E. 1986. A simulation study of the CRAY X-MP memory system. IEEE Trans. Comps., C-35 (July): 613–622.

    Google Scholar 

  • Cray Research. 1984. CRAY X-MP Series Mainframe Reference Manual. Cray Research, Inc., Mendota Heights, Minn.

    Google Scholar 

  • Cray Research. 1985. CRAY-2 Computer System Functional Description. Cray Research, Inc., Mendota Heights, Minn.

    Google Scholar 

  • Kampe, F.C., and Nguyen, T.M. 1988. Performance comparison of the CRAY-2 and CRAY X-MP on a class of seismic data processing algorithms. Parallel Computing, 7: 41–53.

    Google Scholar 

  • Mudge, T.N., Hayes, J.P., and Windsor, D.C. 1987. Multiple bus architectures, IEEE Comp., 20 (June): 42–48.

    Google Scholar 

  • Oed, W., and Lange, O. 1985. On the effective bandwidth of interleaved memories in vector processor systems. IEEE Trans. Comps., C-34 (Oct.): 949–957.

    Google Scholar 

  • Rau, B.R. 1979. Interleaved memory bandwidth in a model of multiprocessors. IEEE Trans. Comps., C-28 (Sept.): 678–681.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weiss, S. Memory conflict resolution in vector supercomputers. J Supercomput 6, 71–85 (1992). https://doi.org/10.1007/BF00128643

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00128643

Keywords

Navigation