Abstract
This chapter describes a multiprocessor performance evaluation case study, and the modeling tools that were developed for this purpose. It is shown how the choice of the architecture of a multiprocessor system can be guided by analytical performance predictions in conjunction with implementation issues. The goal of the project of a multiprocessor system is the development of an efficient architecture which should not experience bottlenecks at the physical level due to contention for shared resources. A description is given of how the comparison among candidate architectures must be done using common assumptions and a similar workload model. Only after this preliminary work can an architecture be chosen and implemented as a good compromise between performance and implementation costs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajmone Marsan, M.; and Gregoretti, F. “Memory Interference Models for a Multiprocessor Systems, with a Shared Bys and a Single External Common Memory”, EUROMICRO JOURNAL, February 1981.
Ajmone Marsan, M., and Gerla, M. “Markov Models for multiple Bus Multiprocessor Systems”, IEEE Trans. on Computers, March 1982.
Ajmone Marsan, M.; Balbo, G.; and Conte, G. “Comparative Performance Analysis of Single Bus Multiprocessor Architectures”, IEEE Trans, on Computers, December 1982.
Ajmone Marsan, M.; Balbo, G.; Conte, G.; and Gregoretti, F. “Modeling Bus Contention and Memory Interference in a Multiprocessor System”, IEEE Trans, on Computers, January 1983.
Balbo, G.; and Bruell, S.C., “Computational Aspects of Aggregation in Multiple class Queueing Networks”, Performance Evaluation, August 1983.
Baskett, F.; Chandy, K.,M.; Muntz, R.R.; and Palacios, F.,G. “Open, Closed and mixed networks of queues with different class of costumers”, Communication Ass. Computing Mach., June 1976.
Baskett, F.; and Smith, A.J. “Interference in Multiprocessor Computer Systems with Interleaved Memory”, Communications of the ACM, June 1976.
Bhandarkar, D.P. “Analysis of Memory Interference in Multiprocessors”, IEEE Transactions on Computers, September 1975.
Bruell, S., C.; and Balbo, G. “Computational Algorithms for Closed Queueing Networks”. Amsterdam, The Netherlands; Elsevier, 1980.
Buzen, J.P.; and Potier, D. “Accuracy of the Exponential Assumption in Closed Queueing Models”, Proceedings 1977
SIGMETRICS/CMG International Conference on Computer Performance, Modeling, Measurement, and Management, Whashington D.C., November 1977.
Chandy, K.M.; Herzog, U.; and Woo, L. “Parametric Analysis of Queueing Network Models”, IBM J. of Res. and Dev., January 1975.
Chandy, K.M.; Herzog, U.; and Woo, L. “Approximate Analysis of General Queueing Networks”, IBM J. of Res. and Dev., January 1975.
Chandy, K.M.; and Sauer, C.H. “Approximate Methods for Analyzing Queueing Network Models of Computer Systems”, ACM Computing Surveys, September 1978.
Chang, S.S.L. “Multiple-Read Multiple-Write Memory and Its Applications”, IEEE Trans. on Computers, August 1980.
Conte, G.; Del Corso, D.; Gregoretti, F. and Pasero, E. “TOMP80: a Multiprocessor Prototype”, EUROMICRO 81, Paris, September 1981.
Denning, P.J.; and Buzen, J.P. “The Operational Analysis of Queueing Network Models”, ACM Computing Surveys, September 1978.
Fung, F.; and Torng, H. “On the Analysis of Memory Conflicts and Bus Contentions in a Multiple-Microprocessor System”, IEEE Trans. on Computers, January 1979.
Graham, G., S. Guest Editor “Special Issue: Queueing network models of computer systems” Ass. Computing Mach. Comp. Survey, September 1978.
Herzog, U.; Woo, L.; and Chandy, K.M. “Solution of Queueing Problems by a Recursive Technique”, IBM J. of Res. and Dev., May 1975.
Hoener, S.; and Roeder, W. “Efficiency of a Multiprocessor System with Time-Shared Busses”, EUROMICRO 77, September 1977.
Hoogendoorn, C.H. “A General Model for Memory Interference in Multiprocessors”, IEEE Trans. on Computers, October 1977.
Iglehart, L.D, “The regenarative Method for Simulation Analysis” in Current Trends in Programming Methodology, Vol.iii, K.M. Chandy; R.T. Yeh Eds., Prentice Hall, 1978.
Kaiser, D. “iAPX 432 Object Prime Preliminary Draft”, Intel Corporation, August 1980.
Keller, T.W. “Computer System Models with Passive Resources”, Ph.D. Thesis, Computer Science Department, University of Texas at Austin, 1976.
Kemeni, J.G.; and Snell, J.L. “Finite Markov Chains”, Van Nostrand, Princeton, 1960.
Kleinrock, L. “Queueing Systems. Vol. 1”, J. Wiley, New York, 1975.
Lavenberg, S.S. “Regenerative Simulation of Queueing Networks” IBM Research Report RC-7087, 1978.
Levy, J.V. “Buses, The Skeleton of Computer Structures”, Computer Engineering: a DEC View of Hardware System Design by C.G. Bell, J.C. Mudge, and J.E. McNamara, 1978.
Merlin, J.A.; and Farber, D.J. “RecoverabiIity of Communication Protocols — Implications of a Theoretical Study” IEEE Trans, on Commun., September 1976.
Molloy, M.K. “On the Integration of Delay and Throughput Measures in Distributed Processing Models”, PhD Thesis, University of California, Los Angeles, 1981.
Natkin, S. “Reseaux de Petri Stochastiques” These de Docteur-lngegneur, CNAM-PARIS, June 1980.
Palm, c.; “The Assignement of Workers in Servicing Machines”, The Journal of Industrial Engineering, September 1958.
Patel, J.H. “Processor-Memory Interconnections for Multiprocessors” Proc. 6-th Annual Symposium on Computer Architecture, April 1979.
Peterson, W.; and Weldon, E. “Error Correcting Codes”, MIT Press, 1961.
Peterson, J.L. “Petri Net Theory and Modeling of System”, Prentice Hall Inc. Englewood Cliff N.J., 1981.
Petri, C.A. “Communication with Automata”, PhD Thesis, Technical Report RADC-TR-65–377, New York, January 1966.
Sauer, C.H “Approximate Solution of Queueing Networks with Simultaneous Resource Possession”, IBM Research Report RC 8679, January 1981.
Sethi, A.S.; and Deo, N. “Interference in Multiprocessor Systems with Localized Memory Access Probabilities”, IEEE Transactions on Computers, February 1979.
Symons, F.J.W. “Introduction to Numerical Petri Nets, a General Graphical Model of Concurrent Processing Systems”, A.T.R., January 1980.
Swan, R.J.; Fuller, S.H.; and Seviorek, D.P. “CM*; a Modular Multimicroprocessor”, Proc. AFI PS National Computer Conference, 1977.
Thurber, K.J.; Jensen, E.D.; Jack, L.A.; Kinney, L.L.; Patton, P.C.; and Anderson, L.C. “A Systematic Approach to the Design of Digital Bussing Structures”, Proc. AFIPS Fall Joint Computer Conference 41, 1972.
Vantilborgh, H. “Exact Aggregation in Exponential Queueing Networks”, Journal of the ACM, October 1978.
Willis, P.J. “Derivation and Comparison of Multiprocessor Contention Measures”, IEE Journal of Computers and Digital Techniques, August 1978.
Wulf, W.A.; and Bell, G.C. “C.mmp, a Multiminiprocessor”, Proc. AFIPS Fall Joint Computer Conference, 1972.
Zuberek, W.M. “Timed Petri Nets and Preliminary Performance Evaluation”, Proc. of the 7-th Annual Symposium on Computer Architecture, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 D. Reidel Publishing Company
About this chapter
Cite this chapter
Marsan, M.A., Conte, G., Balbo, G. (1985). Performance Analysis of Multiprocessor Systems. In: Conte, G., Del Corso, D. (eds) Multi-Microprocessor Systems for Real-Time Applications. International Series on Microprocessor-Based Systems Engineering, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5408-3_2
Download citation
DOI: https://doi.org/10.1007/978-94-009-5408-3_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8888-6
Online ISBN: 978-94-009-5408-3
eBook Packages: Springer Book Archive