Dileep P. Bhandarkar
Abstract
This paper briefly describes an approximate Markov chain model for memory interference in a multiprocessor system like C.mmp. The modeling assumptions explain the level of abstraction at which the analysis is carried out. Some empirical measurements are presented to determine the model parameters for C.mmp. The analytic results obtained from the model are compared with some measured and simulation results.
- Aygun, B.: Dynamic Analysis of Execution. Ph.D. Thesis, Computer Science Dept., Carnegie-Mellon Univ., Pittsburgh, Pa., 1973.Google Scholar
- Bell, C.G. and A. Newell: Computer Structures: Readings and Examples. McGrow-Hill, New York, 1971. Google ScholarDigital Library
- Bhandarkar, D.P. and S.H. Fuller: Markov Chain Models for Analyzing Memory Interference in Multiprocessor Computer Systems. Proc. of the First Annual Symposium on Computer Architecture, Dec. 1973, pp. 1-6. Google ScholarDigital Library
- Bhandarkar, D.P.: Analytic Models for Memory Interference in Multiprocessor Computer Systems. Ph.D. Thesis, Dept. of Elec. Engg., Carnegie-Mellon Univ., Pittsburgh, Pa., Sept. 1973. (AD-773843.) Google ScholarDigital Library
- Gover, D.P.: "Probability Models for Multiprogramming Computer Systems." JACM, Vol. 14, No. 3, July 1967, pp. 623-638. Google ScholarDigital Library
- McKinney, J.M.: "A Survey of Analytic Time Sharing Models." Computer Surveys, Vol. 1, No. 2, 1969, pp. 105-116. Google ScholarDigital Library
- Riordan, J.: An Introduction to Cambinatorial Analysis. Wiley, New York, 1958, pp. 90-92.Google Scholar
- Strecker, W.D.: Analysis of the Instruction Execution Rate in Certain Computer Structures. Ph.D. Thesis, Dept. of Elec. Engg., Carnegie-Mellon Univ., Pittsburgh, Pa., June 1970. (AD-711408.) Google ScholarDigital Library
- Wulf, W.A. and C.G. Bell: C.mmp - A Multi-miniprocessor, AFIPS SJCC Proc., 1972, Vol. 41, Part II, pp. 765-777.Google Scholar
- PDP-11/20 Processor Handbook, Digital Equipment Corporation, 1971.Google Scholar
Recommendations
Memory Interference Models with Variable Connection Time
This correspondence develops two discrete memory interference models. These models, the equivalent rate model and the Markov chain model, provide for variable connection times between processors and memories if these times can be characterized by a ...
Markov chain models for analyzing memory interference in multiprocessor computer systems
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 ...
Markov chain models for analyzing memory interference in multiprocessor computer systems
ISCA '73: Proceedings of the 1st annual symposium on Computer architectureThis 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 ...
Comments