This Article 
 Bibliographic References 
 Add to: 
The Method of Layers
August 1995 (vol. 21 no. 8)
pp. 689-700
Distributed applications are being developed that contain one or more layers of software servers. Software processes within such systems suffer contention delays both for shared hardware and at the software servers. The responsiveness of these systems is affected by the software design, the threading level and number of instances of software processes, and the allocation of processes to processors. The Method of Layers (MOL) is proposed to provide performance estimates for such systems. The MOL uses the mean value analysis (MVA) Linearizer algorithm as a subprogram to assist in predicting model performance measures.

[1] S. C. Agrawal and J. P. Buzen,“The aggregate server method for analyzing serialization delays in computer systems,”ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 116–143, May 1983.
[2] A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms.Reading, Mass: Addison-Wesley, 1983.
[3] G.R. Andrews and F. Schneider, “Concepts and Notations for Concurrent Programming, ACM Computing Surveys, vol. 15, no. 1, pp. 3-43, Mar. 1983.
[4] F. Baskett, K.M. Chandy, R.R. Muntz, and R. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[5] B. Beizer,Micro-Analysis of Computer System Performance.New York: Van Nostrand Reinhold, 1978.
[6] B. Beizer,“Software performance,” C.R. Vicks and C.V. Ramamoorthy, eds., Handbook of Software Engineering.New York: Van Nostrand Reinhold, pp. 413-436, 1984.
[7] Best/1 User’s Guide.Waltham, Mass.: BGS Systems, Inc., 1982.
[8] R. M. Bryant, A. E. Krzesinski, M. S. Lakshmi and K. M. Chandy,“The MVA priority approximation,”ACM Trans. Comput. Syst., vol. 2, no. 4, pp. 335–359, Nov. 1984.
[9] R.J. Buhr,G.M. Karam,C.J. Hayes,, and C.M. Woodside,“Software CAD: A revolutionary approach,” IEEE Transactions on Software Engineering, vol. 15, no. 3, pp. 235-249, Mar. 89.
[10] K.M. Chandy and D. Neuse, “Linearizer: A Heuristic Algorithm for Queueing Network Models of Computing Systems,” Comm. ACM, vol. 25, no. 2, pp. 126-134, 1982.
[11] G. Franks,A. Hubbard,S. Majumdar,D. Petriu,J. Rolia,C.M. Woodside,“A toolset for performance engineering and software design of client-serversystems,” Performance Evaluation J., June 1995.
[12] Open Software Foundation, Introduction to OSF DCE. Prentice Hall, 1992.
[13] IEEE Portable Operating System Interface (POSIX), Lightweight Threads, IEEE std. P1003.4a.
[14] P.A. Jacobson and E.D. Lazowska,“Analyzing queueing networks with simultaneous resource possession,” Comm. ACM, vol. 25, no. 2, pp. 142-151, Feb. 1982.
[15] L. Kleinrock,Queueing Systems, vol. 1: Theory.New York: John Wiley&Sons, 1975.
[16] S.S. Lavenberg,“A perspective on queueing models of computer performance,” Performance Evaluation, vol. 10, no. 1, pp. 53-76, 1989.
[17] E.D. Lazowska, J. Zahorjan, G.S. Graham, and K.C. Sevcik, Quantitative System Performance, Prentice Hall, pp 64-66, 1984.
[18] MAP User’s Guide.Seattle, Wash.: Quantitative System Performance, Inc., 1982.
[19] J.W. Miernik,C.M. Woodside,J.E. Neilson,, and D.C. Petriu,“Throughput of stochastic rendezvous networks with caller-specificservice and processor contention,” Proc. of IEEE InfoCom, pp. 1,040-1,049, 1988.
[20] J.W. Miernik,C.M. Woodside,J.E. Neilson,, and D.C. Petriu,“Performance of stochastic rendezvous networks with priority tasks,” Technical Report. Carleton University, SCE-89-02. Presented at the Int’lSeminar on Performance of Distributed and Parallel Systems, Dec. 1988,Kyoto, Japan.
[21] Object Management Group and Xopen, The Common Object Request Broker: Architecture and Specification.Framingham, Mass., and Reading Berkshire, UK: Object Management Group and Xopen, 1992.
[22] Bin Qin,“A model to predict the average response time of user programs,” Performance Evaluation, vol. 10, pp. 93-101, 1989.
[23] M. Reiser and S.S. Lavenberg,“Mean value analysis of closed multichain queueing networks,” IBM Research Report RC 70 23, Yorktown Heights, N.Y., 1978.
[24] M. Reiser,“A queueing network analysis of computer communication networks with windowflow control,” IEEE Transactions on Communications, pp. 1,201-1,209, Aug. 1979.
[25] J.A. Rolia,“Performance estimates for multi-tasking software systems,” Master’s Thesis, Univ. of Toronto, Canada, Jan. 1987.
[26] J.A. Rolia,Software Performance Modelling, CSRI Technical Report 260, PhD Dissertation, Univ. of Toronto, Canada, Jan. 1992.
[27] E. de Souza e Silva and R.R. Muntz, “A Note on the Computational Cost of the Linearizer Algorithm,” IEEE Trans. Computers, vol. 39, no. 6, pp. 840-842, June 1990.
[28] C.U. Smith,“The prediction and evaluation of the performance of software fromextended design specifications,” PhD Dissertation, Univ. of Texas at Austin,University Microfilms Pub. No. KRA81-00963, Aug. 1980.
[29] C. Smith, Performance Engineering of Software Systems. Reading, Mass.: Addison Wesley, 1990.
[30] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[31] V. Vetland,“Measurement-based composite computational work modelling of software,” PhD thesis, Norwegian Inst. of Technology, Univ. of Trondheim, Sept. 1993.
[32] C.M. Woodside,Throughput Calculation For Basic Stochastic Rendezvous Networks, Technical Report, Carleton Univ., Ottawa, Canada, Apr. 1986.
[33] C.M. Woodside, “Throughput Calculation for Basic Stochastic Rendezvous Networks,” Performance Evaluation, vol. 9, pp. 143-160, 1989.
[34] C.M. Woodside,E.M. Hagos,E. Neron,, and R.J.A. Buhr,., “CAEDE performance analysis tool,” Proc. First Int’l Symp. Environments and Tools for Ada (SETA1),Los Angeles, Calif., Apr. 1990.

Index Terms:
Management of distributed applications, performance of systems, queueing network models, software performance engineering, software performance models.
J.a. Rolia, K.c. Sevcik, "The Method of Layers," IEEE Transactions on Software Engineering, vol. 21, no. 8, pp. 689-700, Aug. 1995, doi:10.1109/32.403785
Usage of this product signifies your acceptance of the Terms of Use.