skip to main content
article
Free Access

Analyzing queueing networks with simultaneous resource possession

Published:01 February 1982Publication History
First page image

References

  1. 1 Bard, Yonathan. A simple approach system modeling. IBM Cambridge Scientific Center, April 1980.Google ScholarGoogle Scholar
  2. 2 Bard, Yonathan. A model of shared DASD and multipathing. Comm. ACM 23, 10 (Oct. 1980) 564-572. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Chandy, K.M. and Neuse, D. Linearizer: A heuristic algorithm for queueing network models of computing systems Comm. A CM., 25, 2 (Feb. 1982), 126-134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Chandy, K.M. and Saner, C.H. Approximate methods for analyzing queueing network models of computer systems. In G.S. Graham (Ed), "Queueing Network Models of Computer System Performance"; Computing Surveys 10, 3, (Sept. 1978) 281-317. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Chandy, K.M., Herzog, U., and Woo, L. Parametric analysis of Queueing networks. IBM J. Res. Develop. 19, l, (Jan. 1975) 36-.--42.Google ScholarGoogle Scholar
  6. 6 Jacobson, Patricia A., and Lazowska, Edward D. The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems. Proc. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Las Vegas, September 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Saner, C.H. and MacNair, E.A. Simultaneous resource possession in queueing models of computers. Performance Evaluation Review 7, I & 2, (Spring-Summer 1978)41-52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Wilhelm, Neil C. A general model for the performance of disk systems. JACM 24, l, (Jan. 1977) 14-31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Zahorjan, J., Hume, J.N.P., and Sevcik, K.C. A queueing model of a rotational position sensing disk system, lnfor 16, 3, (Oct. 1978) 199-216.Google ScholarGoogle Scholar

Index Terms

  1. Analyzing queueing networks with simultaneous resource possession

          Recommendations

          Comments

          Login options

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

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 25, Issue 2
            Feb 1982
            61 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/358396
            Issue’s Table of Contents

            Copyright © 1982 ACM

            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: 1 February 1982

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader