Skip to main content

New Access Order to Reduce Inter-Vector Conflicts

  • Conference paper
Vector and Parallel Processing – VECPAR’98 (VECPAR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1573))

Included in the following conference series:

  • 556 Accesses

Abstract

In vector processors, when several vector streams concurrently access the memory system, references of different vectors can interfere in the access to the memory modules, causing module conflicts. Besides, in a memory system where several modules are mapped in every bus, delays due to bus conflicts are added to module conflict delays. This paper proposes an access order to the vector elements that avoids conflicts when the concurrent access corresponds to vectors of a subfamily, and the request rate to the memory modules is less than or equal to the service rate. For other cases of concurrent access, the proposal dramatically reduces conflicts.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berry, M., et al.: Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers. Int. Journal for Supercomputer Applications (1989)

    Google Scholar 

  2. Cheung, T., Smith, J.E.: A Simulation Study of the CRAY X-MP Memory System. IEEE Transactions on Computers C-35(7) (october1980)

    Google Scholar 

  3. del Corral, A.M., Llaberia, J.M.: Reduce Conflicts between Vector Streams in Complex Memory Systems. CEPBA Report. DAC-UPC Report (June 1994)

    Google Scholar 

  4. del Corral, A.M., Llaberia, J.M.: Eliminating Conflicts between Vector Streams in Interleaved Memory Systems. CEPBA Report. DAC-UPC Report (August 1995)

    Google Scholar 

  5. del Corral, A.M., Llaberia, J.M.: Avoiding Inter-Vector-Conflicts in Complex Memory Systems. CEPBA Report, DAC-UPC Report (March 1996)

    Google Scholar 

  6. Detert, U., Hofemann, G.: CRAY X-MP and Y-MP memory performance. Parallel Computing, 17 (1991)

    Google Scholar 

  7. FU, J.W.C., Patel.J.H.: Memory Reference Behavior of Compiler Optimized Programs on High Speed Architectures. In: International Conference on Parallel Processing, vol. II (1993)

    Google Scholar 

  8. Harper III, D.T., Jump, J.R.: Vector Access Performance in Parallel Memories Using a Skewed Storage Scheme. IEEE Transactions on Computers C-36(12) (December 1987)

    Google Scholar 

  9. Harper III, D.T., Linebarger, D.A.: Conflict-free Vector Access Using a Dynamic Storage Scheme. IEEE Transactions on Computers C-40(3) (March 1991)

    Google Scholar 

  10. Harper III, D.T., Jump, J.R.: Vector Access Performance in Parallel Memories Using a Skewed Storage Scheme. IEEE Transactions on Computers C-36(12) (December 1987)

    Google Scholar 

  11. Hennessy, J.L., Patterson, D.A.: Computer Architecture. A Quantitative Approach. Morgan Kaufmann Publishers, inc., San Francisco (1990)

    Google Scholar 

  12. Hockney, R.W., Jesshope, C.R.: Parallel Computers 2. Adam Hilger (1988)

    Google Scholar 

  13. Kitai, K., Isobre, T., Sakakibara, T., Yazawa, S., Tamaki, Y., Tanaka, T., Ishii, K.: Distributed Storage Control Unit for the Hitachi S-3800 Multivector Supercomputer. In: Int. Conference on Supercomputing (1994)

    Google Scholar 

  14. Kurian, L., Choi, B., Hulina, P.T., Coroor, L.D.: Module Partitioning and Interleaved Data Placement Schemes to Reduce Conflicts in Interleaved Memories. In: International Conference on Parallel Processing, vol. 1 (1994)

    Google Scholar 

  15. Lee, D.L.: Prime-way Interleaved Memory. In: International Conference on Parallel Processing, vol. I (1993)

    Google Scholar 

  16. Oed, W., Lange, O.: On the Effective Bandwidth of Interleaved Memories in Vector Processor Systems. IEEE Transactions on Computers C-34(10) (October 1985)

    Google Scholar 

  17. Raghavan, R., Hayes, J.: Reducing Interference Among Vector Accesses in Interleaved Memories. IEEE Transactions on Computers 42(4) (April 1993)

    Google Scholar 

  18. Raghavan, R., Hayes, J.P.: On Randomly Interleaved Memories. In: Proceedings of the Supercomputing 1990 (November 1990)

    Google Scholar 

  19. Smith, J.E., Taylor, W.R.: Accurate Modelling of Interconnection Networks. In: Int. Conference on Supercomputing, pp. 264–273 (1991)

    Google Scholar 

  20. Smith, J.E., Hsu, W.C., Hsiung, C.: Future General Purpose Supercomputer Architectures. In: Proc. Supercomputing 1990 (1990)

    Google Scholar 

  21. Torrellas, J., Zhang, Z.: The Performance of Cedar Multistage Switching Network. In: Proceeding of the Supercomputing 1994 (November 1994)

    Google Scholar 

  22. Valero, M., Lang, T., Llaberia, J.M., Peiron, M., Ayguade, E., Navarro, J.J.: Increasing the Number of Strides for Conflict-free Vector Access. In: Int. Symp. on Comp. Architecture (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

del Corral, A.M., Llaberia, J.M. (1999). New Access Order to Reduce Inter-Vector Conflicts. In: Hernández, V., Palma, J.M.L.M., Dongarra, J.J. (eds) Vector and Parallel Processing – VECPAR’98. VECPAR 1998. Lecture Notes in Computer Science, vol 1573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703040_32

Download citation

  • DOI: https://doi.org/10.1007/10703040_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66228-0

  • Online ISBN: 978-3-540-48516-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics