skip to main content
article
Free Access

Proposal on efficient address allocation algorithm for horizontal microprograms

Published:19 November 1978Publication History
Skip Abstract Section

Abstract

A new algorithm to allocate horizontal microprograms having many addressing restrictions is presented in this note. This algorithm, using simultaneous partitioning, sufficiently maximizes the microprogram performance and minimizes the necessary memory amount in practical use.

References

  1. 1 J.F. Wakerly et al. "Placement of Microinstruction in a Two-Dimensional Address Space", MICRO-8 (1975) pp46-51 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 T.G. Szymanski "Assembling Code for Machines with Span-Dependent Instructions", Comm. ACM 21, 4 (1978) pp300-308 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Proposal on efficient address allocation algorithm for horizontal microprograms

            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 9, Issue 4
              Dec. 1978
              160 pages
              ISSN:1050-916X
              DOI:10.1145/1014198
              Issue’s Table of Contents

              Copyright © 1978 Authors

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 19 November 1978

              Check for updates

              Qualifiers

              • article

            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!