article

Free access

The impact of distributions and disciplines on multiple processor systems

Authors:

Charles H. Sauer,

K. Mani ChandyAuthors Info & Claims

Communications of the ACM, Volume 22, Issue 1

Pages 25 - 34

https://doi.org/10.1145/359046.359053

Published: 01 January 1979 Publication History

PDF eReader

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.

Google Scholar

[2]

Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G. Open, closed, and mixed networks of queues with different classes of customers. JACM 22, 2 (April 1975), 248-260.

Digital Library

Google Scholar

[3]

Baskett, F., and Smith, A.J. Interference in multi-processor systems with interleaved memory. Comm.,4CM 19, 6 (June 1976), 327-334.

Digital Library

Google Scholar

[4]

Bell, C.G., and Newell, A. Computer Structures: Readings and Examples. McGraw-Hill; New York, 1971.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[7]

Burnett, G.J., and Coffman, E.G., Jr. Analysis of interleaved memory systems using blockage buffers. Comm.,4CM 18, 2 (February 1975), 91-95.

Digital Library

Google Scholar

[8]

Buzen, J. Queueing network models of multiprogramming. Ph.D. Diss., Div. Eng. and Appl. Physics, Harvard U., Cambridge, Mass., 1971.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[12]

Cox, D.R. A use of complex probabilities in the theory of stochastic processes. Proc. Cambridge Philosophical Soc. 51 (1955), 313-319.

Crossref

Google Scholar

[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.

Google Scholar

[14]

Fuller, S.H. Price/performance comparison of C.mmp and the PDP-10. Proc. 3rd Annual Symp. Comptl:. Architecture, Comptr. Architecture News (ACM) 4, 4 (Jan. 1976), 195-202.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Google Scholar

[17]

Lavenberg, S.S., and Slutz, D.R. Introduction to regenerative simulation. IBM J. Res. and Develop. 19, 5 (Sept. 1975), 458-463.

Digital Library

Google Scholar

[18]

Martin, R.R., and Frankel, H.D. Electronic disks in the 1980's. Comptr. 8, 2 (Feb. 1975), 24-30.

Google Scholar

[19]

Metcalfe, R.M., and Boggs, D.R. Distributed packet switching for local computer networks Comm. ACM 19, 7 (July 1976), 395-403.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Google Scholar

[24]

Sauer, C.H., Configuration of computing systems: An approach using queueing network models. Ph.D. Th., U. of Texas at Austin, May 1975.

Digital Library

Google Scholar

[25]

Sauer, C.H. Simulation analysis of generalized queueing networks. Proc. 1975 Summer Comptr. Sim. Conf., pp. 75-81.

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Google Scholar

[28]

Sherman, S., Baskett, F., and Browne, J.C. Trace driven modeling and analysis of CPU scheduling in a multiprocessing system. Comm. ACM 15, 12 (Dec. 1972), 1063-1069.

Digital Library

Google Scholar

[29]

Towsley, D.F. Local balance models of computer systems. Ph.D. Th., U. of Texas a.t Austin, December 1975.

Digital Library

Google Scholar

[30]

Widdoes, L.C. The Minerva Multi-Microprocessor. Proc. 3rd Annual Symp. Comptr. Architecture, Comptr. Architecture News (ACM) 4, 4 (Jan. 1976), 34-39.

Digital Library

Google Scholar

[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.

Google Scholar

Cited By

View all

Karatza H(2016)Simulation Models For Parallel Processing Within ProgramsInternational Journal of Modelling and Simulation10.1080/02286203.1988.117600438:3(78-82)Online publication date: Sep-2016
https://doi.org/10.1080/02286203.1988.11760043
Karatza H(2016)A Simulation Model Of Multitasking In Parallel ProcessingInternational Journal of Modelling and Simulation10.1080/02286203.1987.117599917:1(37-42)Online publication date: Sep-2016
https://doi.org/10.1080/02286203.1987.11759991
Yoo S(2013)An Algebraic Approach to a Nonproduct Form NetworkAT&T Technical Journal10.1002/j.1538-7305.1985.tb00015.x64:10(2505-2523)Online publication date: 29-Jul-2013
https://doi.org/10.1002/j.1538-7305.1985.tb00015.x
Show More Cited By

Recommendations

Insensitivity to service-time distributions for fluid queueing models
ValueTools '13: Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools

We study fluid limits based on ordinary differential equations (ODEs) for Markovian queueing models where nonexponential service times are fit by appropriate Coxian distributions to match their first and second moments. We focus on a heavy-load regime, ...
The analysis of batch sojourn-times in polling systems

We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For ...
Sojourn times in polling systems with various service disciplines

We consider a polling system of N queues Q"1,...,Q"N, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Q"i, i=1,...,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 22, Issue 1

Jan. 1979

57 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/359046

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1979

Published in CACM Volume 22, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
423
Total Downloads

Downloads (Last 12 months)104
Downloads (Last 6 weeks)10

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Karatza H(2016)Simulation Models For Parallel Processing Within ProgramsInternational Journal of Modelling and Simulation10.1080/02286203.1988.117600438:3(78-82)Online publication date: Sep-2016
https://doi.org/10.1080/02286203.1988.11760043
Karatza H(2016)A Simulation Model Of Multitasking In Parallel ProcessingInternational Journal of Modelling and Simulation10.1080/02286203.1987.117599917:1(37-42)Online publication date: Sep-2016
https://doi.org/10.1080/02286203.1987.11759991
Yoo S(2013)An Algebraic Approach to a Nonproduct Form NetworkAT&T Technical Journal10.1002/j.1538-7305.1985.tb00015.x64:10(2505-2523)Online publication date: 29-Jul-2013
https://doi.org/10.1002/j.1538-7305.1985.tb00015.x
MIsir RSauer W(2009)Nitrogen and amino acid metabolism in the hindgut of pigs fed barley or wheat diets as affected by the infusion of maize starch at the terminal ileumZeitschrift für Tierphysiologie Tierernährung und Futtermittelkunde10.1111/j.1439-0396.1981.tb01357.x46:1-5(221-233)Online publication date: 9-Oct-2009
https://doi.org/10.1111/j.1439-0396.1981.tb01357.x
Girkar MKejariwal ATian XSaito HNicolau AVeidenbaum APolychronopoulos C(2006)Probablistic self-schedulingProceedings of the 12th international conference on Parallel Processing10.1007/11823285_26(253-264)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.1007/11823285_26
Zahorjan JMcCann C(1990)Processor scheduling in shared memory multiprocessorsACM SIGMETRICS Performance Evaluation Review10.1145/98460.9876018:1(214-225)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1145/98460.98760
Zahorjan JMcCann CNutt G(1990)Processor scheduling in shared memory multiprocessorsProceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems10.1145/98457.98760(214-225)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1145/98457.98760
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Bodnar BLiu A(1989)Modeling and Performance Analysis of Single-Bus Tightly-Coupled MultiprocessorsIEEE Transactions on Computers10.1109/12.2113438:3(464-470)Online publication date: 1-Mar-1989
https://dl.acm.org/doi/10.1109/12.21134
Malone TSmith S(1988)Modeling the Performance of Organizational StructuresOperations Research10.5555/2804709.280471336:3(421-436)Online publication date: 1-Jun-1988
https://dl.acm.org/doi/10.5555/2804709.2804713
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Insensitivity to service-time distributions for fluid queueing models

The analysis of batch sojourn-times in polling systems

Sojourn times in polling systems with various service disciplines

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations