This Article 
 Bibliographic References 
 Add to: 
Task Response Time for Real-Time Distributed Systems with Resource Contentions
October 1991 (vol. 17 no. 10)
pp. 1076-1092

An analytic model is proposed for estimating task response times in distributed systems with resource contentions. The model consists of two submodels. The first submodel is an extended queuing network model used for approximating module response times. This submodel is solved by a decomposition technique which reduces the computational complexity by two to three orders of magnitude when compared with a direct approach. The second submodel is a weighted control-flow graph model from which task response time can be obtained by aggregating module response time in accordance with the precedence relationships. Task response times estimated by the analytic model compare closely with simulation results. It is shown that resource contention delays depend on the availability of resources as well as on the invocation rates and response times of the modules that use the resources. The model can be used to study the tradeoffs among module assignments, scheduling policies, interprocessor communications, and resource contentions in distributed processing systems.

[1] F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork/join queueing networks,"J. ACM, vol. 36, pp. 615-642, 1989.
[2] R. Burden and J. D. Faires,Numerical Analysis, 3rd ed. Boston: PWS, 1985.
[3] G. F. Carpenter and A. M. Tyrrell, "The use of GMB in the design of robust software for distributed systems,"Software Eng. J., pp. 268-282, Sept. 1989.
[4] W. W. Chu and K. K. Leung, "Task response time model and its applications for real time distributed processing systems," inProc. Real Time Systems Symp., Dec. 1984, pp. 225-236.
[5] W. W. Chu and K. K. Leung, "Module replication and assignment for real-time distributed processing systems, inProc. IEEE, pp. 547-562, May 1987.
[6] W. W. Chu and C. M. Sit, "A batch service scheduling algorithm with time-out for real-time distributed processing systems," inProc. 7th Int. Conf. Distributed Comput. Syst., Sept. 1987, pp. 250-257.
[7] E. Gelenbe,Multiprocessor Performance. New York: Wiley, 1989, chap. 7.
[8] P. Heidelberger and K. S. Trivedi, "Analytical queueing models for programs with internal concurrency,"IEEE Trans. Computers, vol. C- 32, pp. 73-82, Jan. 1983.
[9] PAWS 3.0 Performance Analyst's Workbench System, Information Res. Assoc., Austin, TX, Feb. 1987.
[10] P. A. Jacobson and E. D. Lazowska, "A reduction technique for evaluating queueing networks with serialization delays," inProc. Performance '83, 1983, pp. 45-59
[11] A. Kapelnikov, R. R. Muntz, and M. D. Ercegovac, "A modeling methodology for the analysis of concurrent systems and computations,"J. Parallel Distributed Comput., vol. 6, pp. 568-597, 1989.
[12] L. Kleinrock,Queueing Systems, Vol. I: Theory. New York: Wiley, 1975.
[13] L. Kleinrock and R. Gail,Solutions Manual for Queueing Systems, Vol. I: Theory. Technol. Transfer Instit., 1982.
[14] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[15] E. D. Lazawskaet al., Quantitative System Performance--Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
[16] J. D. C. Little, "A proof of the queueing formulaL =λW," Operations Res., vol. 9, pp. 383-387, 1961.
[17] T. J. Ott, "The sojourn-time distribution in the M/G/1 queue with processor sharing,"J. Applied Prob., vol. 21, no. 2, pp. 360-378, 1984.
[18] R. A. Sahner and K. S. Trivedi, "Performance and reliability analysis using directed acyclic graphs,"IEEE Trans. Software Eng., vol. SE-13, pp. 1105-1114, Oct. 1987.
[19] C. H. Sauer and K. M. Chandy,Computer Systems Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[20] R. Schassberger and H. Daduna, "A discrete time round-robin queue with Bernoulli input and general arithmetic service time distribuiion,"Acta Inform., vol. 15, pp. 251-263, 1981.
[21] E. A. de Souza e Silva, S. S. Lavenberg, and R. R. Muntz, "Clustering approximation technique for queueing network models with a large number of chains,"IEEE Trans. Computers, vol. C-35, pp. 419-430, May 1986.
[22] R. W. Wolff, "Poisson arrivals see time average,"Operation Res., vol. 30, no. 2, pp. 223-231, 1982.

Index Terms:
real-time distributed systems; analytic model; task response times; resource contentions; submodels; extended queuing network model; module response times; decomposition technique; computational complexity; weighted control-flow graph model; task response time; simulation results; invocation rates; module assignments; scheduling policies; interprocessor communications; distributed processing systems; computational complexity; distributed processing; graph theory; queueing theory; real-time systems; resource allocation
W.W. Chu, C.-M. Sit, K.K. Leung, "Task Response Time for Real-Time Distributed Systems with Resource Contentions," IEEE Transactions on Software Engineering, vol. 17, no. 10, pp. 1076-1092, Oct. 1991, doi:10.1109/32.99195
Usage of this product signifies your acceptance of the Terms of Use.