Markov chain models for analyzing memory interference in multiprocessor computer systems

  • Authors:
  • Dileep P. Bhandarkar;Samuel H. Fuller

  • Affiliations:
  • Carnegie-Mellon University, Pittsburgh, Pennsylvania;Carnegie-Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
  • Year:
  • 1973

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper discusses various analytical techniques for studying the extent of memory interference in a multiprocessor system with a crosspoint switch for processor-memory communication. Processor behavior is simplified to an ordered sequence of a memory request followed by an interval of processing time. The system is assumed to be bus bound; in other words, by the time the processor-memory bus completes servicing a processor's request the processor is ready to initiate another request and the memory module is ready to accept another request. The techniques discussed include discrete and continuous time Markov chain models as well as several approximate analytic methods.