A model of execution time estimating for RPC-oriented programs

  • Wanlei Zhou
  • Brian Molinari
Computer Architecture, Concurrency, Parallelism, Communication And Networking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


This paper describes an execution time estimating model for programs which use Remote Procedure Calls (RPCs) as the tool for distributed computing. At first a general model with no closed-form solution is developed and a nondeterministic algorithm for its solution is given. Then the closed-form solution for a special case of the general model is derived. After using some approximate methods, the lower and upper bounds of the general form solution are described. The last section of this paper presents two examples of the application of the model.

Key Words

Concurrency Distributed computing Remote procedure call Performance evaluation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Network Computing System (NCS) Reference, Apollo Computer Inc., June 1987.Google Scholar
  2. 2.
    Almeida, V. A. and Dowdy, L. W., “Performance Analysis of a Scheme for Concurrency / Synchronisation Using Queueing Network Models,” International Journal of Parallel Processing, vol. 15, no. 6, 1986.Google Scholar
  3. 3.
    Bogart, P. K., Introductory Combinatorics, Pitman Publishing Inc., 1983.Google Scholar
  4. 4.
    Chandy, K. and Martin, A., “A Characterisation of Product-form Queueing Networks,” Journal of ACM, vol. 30, no. 2, April 1983.Google Scholar
  5. 5.
    Gifford, G. K., “Communication Models for Distributed Computation,” in Distributed Operating Systems, Theory and Practice, ed. Y. Paker, vol. 28, Springer-Verlag, 1986.Google Scholar
  6. 6.
    Heidelberg, P. and Trivedi, K., “Analytic Queueing Model for Programs with internal concurrency,” IEEE Trans. on Computers, vol. C-32, no. 1, January 1983.Google Scholar
  7. 7.
    Ke, Z. and Wei, W. D., Combinatorial Theory (I), Science Press, Beijing, China, 1981.Google Scholar
  8. 8.
    Lavenberg, S. S. and Sauer, C. H., “Analytical Results for Queueing Models,” in Computer Performance Modeling Handbook, ed. S. S. Lavenberg, Academic Press, Inc., New York, 1983.Google Scholar
  9. 9.
    Marcotty, M. and Ledgard, H. E., Programming Language Landscape: Syntax / Semantics / Implementation (2nd Edition), Science Research Association, Inc., 1986.Google Scholar
  10. 10.
    Nelson, B. J., “Remote Procedure Call,” Report CSL-81-9, Xerox Palo Alto Research Centre, May 1981.Google Scholar
  11. 11.
    Qin, B. and Ammar, R. A., “A Model to Estimate Average Response Time of Parallel Programs,” Proceedings of the IEEE 13th Annual International Computer Software & Applications Conference, pp. 67–74, Orlando, Florida, September 1989.Google Scholar
  12. 12.
    Thomasian, A. and Bay, P., “Queueing Network Models for Parallel Processing,” in Proceedings of the International Conference on Parallel Processing, IEEE, 1983.Google Scholar
  13. 13.
    Zhou, W. and Molinari, B., “A Performance Evaluation Model for Programs Using Remote Procedure Calls,” Australian Computer Science Communications, vol. 11, no. 1, pp. 98–109, February 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Wanlei Zhou
    • 1
  • Brian Molinari
    • 1
  1. 1.Department of Computer ScienceThe Australian National UniversityCanberraAustralia

Personalised recommendations