skip to main content
article
Free Access

Parallel implementation of an efficient microcode compaction algorithm

Published:01 December 1986Publication History
Skip Abstract Section

Abstract

A derivation of parallel implementation of an efficient microcode compaction algorithm has been described. The serial algorithm is decomposed into four schedules of computations. Parallelism within a schedule and between the schedules is examined. The time complexity of the parallel implementation is of O(n2) when O(n3 processors are available. This initial attempt may motivate further investigations in designing efficient parallel algorithms for microcode compaction.

References

  1. H. T. Kung: The structure of parallel algoritams. Advances in Computers, Vol-19, Academic Press, PR. 65--112.Google ScholarGoogle Scholar
  2. M. J. Quinn and N. Deo: Parallel graph algorithms, Computing Surveys, Vol-16, r, Sep. 1984, pp. 319--348. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Upendra Rao and A. K. Mazumdar: an algorithm for local compaction of horizontal microprograms. Information processing letters, Vol. 22, 1, Jan. 1985, pp. 29--33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  5. F. Y. Chin, J. Lam and I-M. Chen: Efficient parallel algorithms for some graph problem, Comm. of ACM, Vol-25, 9, Sep. 1982, pp. 659--685. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  7. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  8. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  9. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  10. Gosh R. K. and Bhattacharjae G. P.: A parallel search algorithm for directed acyclic graphs, Vol-24, BIT, 1984, pp. 134--150.Google ScholarGoogle Scholar
  11. M. Deo: Graphs theory with applications to engineering and computer science, Prentice-hall Inc., 1974 pp. 300. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. {References contained text which could not be captured.}Google ScholarGoogle Scholar
  13. {References contained text which could not be captured.}Google ScholarGoogle Scholar

Index Terms

(auto-classified)
  1. Parallel implementation of an efficient microcode compaction algorithm

          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 ACM SIGMICRO Newsletter
            ACM SIGMICRO Newsletter  Volume 17, Issue 3
            Dec. 1986
            29 pages
            ISSN:1050-916X
            DOI:10.1145/378741
            Issue’s Table of Contents

            Copyright © 1986 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 December 1986

            Check for updates

            Qualifiers

            • article
          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!