skip to main content
10.1145/130069.130087acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article
Free Access

Performance modeling of a partitionable circular bus network for distributed systems

Authors Info & Claims
Published:01 March 1992Publication History
First page image

References

  1. 1.B. W. Arden and R. Ginosar. MP/C: A Multiprocessor/Computer Architecture. IEEE Transactions on Computers, Vol. C-31, No. 5, May 1982, pp. 455-473.Google ScholarGoogle Scholar
  2. 2.C. K. Barn and S. Y. W. Su. The Architecture of SM3' A Dynamically Partitionable Multicomputer System. IEEE Transactions on Computers, Vol. C-35, No. 9, Sept. 1986, pp. 790-801. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Company, San Francisco, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.R. M. Karp. Reducibility among Combinatorial Problems. In R. E. Miller and J. W. Thatcher(eds), Complexity of Computer Computations, Plenum Press, New York, 1972.Google ScholarGoogle Scholar
  5. 5.S. Kartashev and S. Kartashev. Dynamic Architecture: Problems and Solutions. Computer, Vol. 11, No. 7, July, 1978, pp. 7-15.Google ScholarGoogle Scholar
  6. 6.D. Matula. On the complete subgraphs of a random graph. Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Application, University of North Carolina, Chapel Hill, 1970, pp. 356-369.Google ScholarGoogle Scholar
  7. 7.J. L. Mott, A. Kandel, and T. P. Baker. Discrete Mathematics for Computer Scientists. Reston Publishing Company, A Prentice-Hall Company, Reston, Virginia, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.C. C. Wang. An algorithm for the chromatic number of a graph. Journal of the Association for Computing Machinery, Vol. 21, 3, July 1974, pp. 385-391. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.T. K. Woo, S. Y. W. Su, and R. Newman- Wolfe. Resource Allocation in A Partitionable Bus Network Using A Graph Coloring Algorithm. IEEE Transactions on Communications, Vol. 39, No. 12, Dec. 1991.Google ScholarGoogle Scholar

Index Terms

  1. Performance modeling of a partitionable circular bus network for distributed systems

          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
          • Published in

            cover image ACM Conferences
            SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
            March 1992
            1296 pages
            ISBN:089791502X
            DOI:10.1145/130069

            Copyright © 1992 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 March 1992

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,650of6,669submissions,25%
          • Article Metrics

            • Downloads (Last 12 months)11
            • Downloads (Last 6 weeks)2

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader