Abstract
We consider a clocked message transfer scheme in which message transfer is implemented as a periodic task with fixed overhead. Messages are then processed according to a priority discipline with preemption. Simple closed-form lower and upper bounds, and an approximation based on these bounds are found for the total system mean response time. Both bounds are tight for high processor occupancies, and simulation shows that the approximation is excellent for medium to high occupancies. Application to two different processors is given; the bounds and the approximation are found to be sufficiently tight, demonstrating the usefulness of this bounding and approximation technique for performance modelling of systems early in the design cycle.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N.K. Jaiswal,Priority Queues (Academic Press, 1968).
L. Kleinrock,Queueing Systems, Vol. 2: Computer Applications (Wiley, 1976).
J.N. Daigle and C.E. Houstis, Analysis of a task oriented multipriority system, IEEE Trans. Comm. COM-29 (1981) 1669–1677.
J.N. Daigle, Task oriented queueing: An analysis tool for software design of communication processing systems, IEEE Trans. Comm. COM-34 (1986) 250–256.
C.E. Houstis and M.C. Wescott, Modelling and analysis of a communication switching processor, Perform. Evaluation 6 (1986) 11–19.
D. Manfield, P. Tran-Gia and H. Jans, Modelling and performance analysis of interprocessor messaging in distributed systems, Perform. Evaluation 7 (1987) 285–298.
T.J. Ott, Simple inequalities for theD/G/1 queue, Oper. Res. 35 (1987).
H. Jans, On queueing systems with clocked operations and priorities,ITC-10, Session 4.4A, Paper No. 4 (1983).
M. Fujiki and Y. Murao, Queueing models with regular service interruptions,ITC-8 (1976) pp. 232-1–232-6.
M.M. Jung and J. de Boer, Waiting time distribution for call processing tasks in an SPC telephone system, offered to the processor via a clock pulse operated gate, Philips Telecommun. Rev. 39 (1981) 990–101.
S. Satoh, S. Tanabe and N. Oguchi, Delay time analysis in multi-microprocessor systems,ITC-10, Session 1.3, Paper No. 5 (1983).
D. Stoyan,Comparison Methods for Queues and Other Stochastic Models (Wiley 1983).
M.H. Ackroyd, Numerical computation of delays in clocked schedules, AT&T Tech. J. 64 (1985) 617–631.
A.A. Fredericks, Approximate analysis of a generalized clocked schedule, AT&T Tech. J. 64 (1985) 597–615.
J. Keilson and L.D. Servi, A distributed Poisson approximation for preempt-resume clocked schedules, IEEE Trans. Commun. COM-32-2 (1990) 192–198.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Le Boudec, JY., Gianini, J. Bounds and approximation for clocked interprocessor communication. Ann Oper Res 36, 151–166 (1992). https://doi.org/10.1007/BF02094328
Issue Date:
DOI: https://doi.org/10.1007/BF02094328