Abstract
In this paper, the message buffering in multiprocessor system with I/O devices is presented. The equilibrium distribution of probability of buffers’ numbers in the system is determined. Finding of busy periods for the number of buffer units allows to assign processors utilization in the system and next to define control points for demanded parallelism degree, utilization factor of processors, etc. Through analysis of storage reservation methods and analysis of storage area behavior the optimal length of messages and number of messages depending upon buffer assignment schemes is determined. The effectiveness of message buffering is appointed. The utilization of storage area and its probability of overflow is defined. The choice of the optimal size of buffer in multiprocessor system as a result of this analysis is presented.
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
F.Baskett, K.M.Chandy, R.R.Muntz, F.G.Palacios: Open, closed and mixed network of queues with different classes of customers, JACM 22, 2, 248–260, 1975.
J.C.Browne, K.M.Chandy, R.M.Brown, T.W.Keller, D.Towsley: Hierarchical techniques for development of realistic models of complex computer systems, in “Computer Architectures and Networks”, E.Gelenbe, R.Mahl (Eds.), North-Holland, Amsterdam, N.Y., 483–500, 1974.
W.M.Chow, L.Woo: Buffer performance analysis of communication processors during slowdown at network control, IBM J. Res. & Devel. 21, 3, 264–272, 1977.
R.W.Conway, W.L.Maxwell, L.W.Miller: Theory of Scheduling, Addison-Wesley, Reading, Massachusetts, 1967.
D.R.Cox: Renewal Theory, London, 1962.
D.P.Gaver Jr., P.A.Lewis: Probability models for buffer storage allocation problems, JACM 18, 2, 186–198, 1971.
N.K.Jaiswal: Priority Queues, Academic Press, N.Y., 1968.
J.Lacny: An analysis of buffering techniques in nodes of teleprocessing nets, (in Polish), Archiwum Automatyki i Telemechaniki, T. XXI, 1, 89–104, 1976.
J.Martyna: On the diffusion approximation of hierarchic queueing network systems, Podstawy Sterowania, 8, 3, 351370, 1978.
J.Martyna: The study of job routing behavior in operating system, (in Polish), Podstawy Sterowania, 8, 4, 445–453, 1978.
D.L.Mills: Communication software, Proc. IEEE, 60, 11, 1333–1344, 1972.
K.Omahen, V.Marathe: Analysis and applications of the delay cycle for the M/M/c queueing system, JACM 22, 2, 283303, 1978.
T.G.Price: Probability models of multiprogrammed computer systems, Ph. D. Thesis, Stanford Univ., Stanford, Ca., 1975.
G.D.Schultz: A stochastic model for message assembly buffering with a comparison of block assignment strategies, JACM 18, 3, 483–495, 1972.
J.Martyna: Balance problems of processing capacity in the hierarchical queueing network, (in Polish), Podstawy Sterowania, 2,2, 105–124, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Martyna, J. (1981). An Analysis of Message Buffering in Multiprocessor Computer System. In: Mertens, B. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67979-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-67979-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10619-7
Online ISBN: 978-3-642-67979-7
eBook Packages: Springer Book Archive