The impact of distributions and disciplines on multiple processor systems

ABSTRACT

Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.

REFERENCES

• 1: A Description of the Advanced Scientific Computer System. Texas Instruments, Inc., 1972.
• 2: Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
• 3: Forest Baskett , Alan Jay Smith, Interference in multiprocessor computer systems with interleaved memory, Communications of the ACM, v.19 n.6, p.327-334, June 1976 [doi>10.1145/360238.360243]
• 4: C. Gordon Bell , A. C. Newell, Computer structures: Readings and examples (McGraw-Hill computer science series), McGraw-Hill Pub. Co., 1971
• 5: Bhandarkar, D.P., and Fuller, S.H. A survey of techniques for analyzing memory interference in multiprocessor systems. Tech. Rep., Carnegie Mellon U., Pittsburgh, Pa., April 1973.
• 6: Browne, J.C., Chandy, K.M., Hogarth, J., and Lee, C.C. The effect on throughput of multiprocessing in a multiprogramming environment. 1EEE Trans. Comptrs. C-22, 8 (August 1973), 728-735.
• 7: G. J. Burnett , E. G. Coffman, Jr., Anaysis of interleaved memory systems using blockage buffers, Communications of the ACM, v.18 n.2, p.91-95, Feb. 1975 [doi>10.1145/360666.360668]
• 8: Buzen, J. Queueing network models of multiprogramming. Ph.D. Diss., Div. Eng. and Appl. Physics, Harvard U., Cambridge, Mass., 1971.
• 9: Chandy, K.M. The analysis and solutions for general queueing networks. Proc. Sixth Annual Princeton Conf. Inform. Sci. and Syst., Princeton U., Princeton, N.J., March 1972, 224-228.
• 10: Chandy, K.M., Herzog, U., and Woo, L.S. Approximate analysis of general queueing networks. IBM J. Res. and Develop. 19, 1 (Jan. 1975), 43-19.
• 11: Chandy, K.M., Sauer, C.H., and Browne, J.C. An overview of modeling techniques for parallel processing systems. Digest of Papers, CompCon 75, San Francisco, February 1975, pp. 213-218.
• 12: Cox, D.R. A use of complex probabilities in the theory of stochastic processes. Proc. Cambridge Philosophical Soc. 51 (1955), 313-319.
• 13: Farber, D.J., and Larson, K.C. The system architecture of the distributed computer system--the communications system. Proc. Symp. Comptr. Communications Networks and Tele-traffic, Polytechnic Press, Brooklyn, N.Y., April 1972, pp. 21-27.
• 14: Samuel H. Fuller, Price/performance comparison of C.mmp and the PDP-10, Proceedings of the 3rd annual symposium on Computer architecture, p.195-202, January 19-21, 1976
• 15: Herzog, U., Woo, L., and Chandy, K.M. Solution of queueing problems by a recursive technique. IBM J. Res. and Develop. 19, 3 (May 1975), 295-300.
• 16: Johnson, D.S. A process-oriented model of resource demands in large, multiprocessing computer utilities. TSN-29, Comput. Ctr., U. of Texas at Austin, 1972.
• 17: Lavenberg, S.S., and Slutz, D.R. Introduction to regenerative simulation. IBM J. Res. and Develop. 19, 5 (Sept. 1975), 458-463.
• 18: Martin, R.R., and Frankel, H.D. Electronic disks in the 1980's. Comptr. 8, 2 (Feb. 1975), 24-30.
• 19: Robert M. Metcalfe , David R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, v.19 n.7, p.395-404, July 1976 [doi>10.1145/360248.360253]
• 20: Price, T.G. Models of multiprogrammed computer systems with I/O buffering. Proc. of the Fourth Texas Conf. on Comptg. Syst., Nov. 1975, pp. 3.1-3.8.
• 21: Ramamoorthy, C.V., and Gonzalez, M.J. A survey of techniques for recognizing parallel processable streams in computer programs. Proc. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N.J., pp. 1-17.
• 22: Reiser, M., and Kobayashi, H. Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. and Develop. 19, 3 (May 1975), 283-294.
• 23: Roberts, L., and Wessler, B. Computer network development to achieve resource sharing. Proc. AFIPS 1970 SJCC, Vol. 36, AFIPS Press, Montvale, N.J., pp. 543-549.
• 24: Charles Herbert Sauer, Configuration of computing systems: an approach using queueing network models., 1975
• 25: Sauer, C.H. Simulation analysis of generalized queueing networks. Proc. 1975 Summer Comptr. Sim. Conf., pp. 75-81.
• 26: Sauer, C.H., and Chandy, K.M. Approximate analysis of central server models. IBM J. Res. and Develop. 19, 3 (May 1975), 301-313.
• 27: Sauer, C.H., and Chandy, K.M. Parametric modeling of multiminiprocessor systems. Res. Rep. RC 5978, IBM Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y., May 1976.
• 28: Stephen Sherman , Forest Baskett, III , J. C. Browne, Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system, Communications of the ACM, v.15 n.12, p.1063-1069, Dec. 1972 [doi>10.1145/361598.361626]
• 29: Donald Fred Towsley, Local balance models of computer systems., 1975
• 30: Lawrence C. Widdoes, Jr., The minerva multi-microprocessor, Proceedings of the 3rd annual symposium on Computer architecture, p.34-39, January 19-21, 1976
• 31: Wulf, W., and Bell, C.G.C. mmp, a multi-miniprocessor. Proc. AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N.J., pp. 765-777.

INDEX TERMS

Keywords:
multiprocessing, multiprogramming, performance evaluation, queueing models, scheduling disciplines