skip to main content
article
Free Access

An algorithm for selection of migration candidates

Published:01 December 1984Publication History
Skip Abstract Section

Abstract

The NP-Completeness of the selection problem of vertical migration candidates is shown by reducing it to the NP-complete knapsack problem. Based on approximation algorithms for the latter problem a new algorithm is presented, which takes into account the call relations between functions in a complex system. Then the developed algorithm is applied to the UNIX operating system as a representative for complex systems.

References

  1. 1 G.E. Brown, J.R. Eckhouse, and J. Estabrook, "Operating System Enhancement Through Firmware", Proc. 10th Annual Workshop on Microprogramming, pp. 119-127 (1977).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 P. Albrich, "Vertikale Verlagerung - Verfahren, Voraussetzungen, Anwendung", Seminar "Firmware Engineering", Informatik Fachberichte 31, Springer (1980).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 P. Meinke, "Verlagerung von Softwarefunktionen in Mikroprogramme", Diplomarbeit am Institut fuer Informatik IV, Universitaet Karlsruhe (1979).]]Google ScholarGoogle Scholar
  4. 4 J. Floethe and R.T. Koelsch, "Mikroprogramme als externe PASCAL - Prozeduren", Berichte des German Chapter of the ACM Band 1, B. G. Teubner Verlag, Stuttgart (1979).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 J. Stockenberg and A. van Dam, "Vertical Migration for Performance Enhancement in Layered Hardware/Firmware/Software Systems", Computer Mag. 11(5) pp. 35-50 (May 1978).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 J.A. Stankovic, "Improving System Structure and its Affect on Vertical Migration", Microprocessing and Microprogramming8(3-5) pp. 203-218 (Oct.-Dec. 1981).]]Google ScholarGoogle Scholar
  7. 7 J.A. Stankovic, "The Types and Interactions of Vertical Migration of Functions in a Multi-Level Interpretive System", IEEE Trans. on ComputersC-30(7)(July 1981).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 G.E. Brown, J.R. Eckhouse, and Goldberg, "Operating System Enhancement through Microprogramming", SIGMICRO7 pp. 29-33 (March 1976).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 E. Luque, A. Ripoll, and J.J. Ruz, "Dynamic Microprogramming in Computer Architecture Redefinition", Euromicro Journal, (6 )pp. 98-103 (1980).]]Google ScholarGoogle ScholarCross RefCross Ref
  10. 10 T.G. Rauscher and A.K. Agrawala, "Dynamic Problem Oriented Redefinition of Computer Architecture Via Microprogramming", IEEE Trans. On ComputersC-27 pp. 1006-1014 (1978).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 P.S. Liu and F.J. Mowle, "Techniques of Program Execution with a Writable Control Memory", IEEE Transactions On ComputersC-27(9)(Sept 1976).]]Google ScholarGoogle Scholar
  12. 12 J. Stankovic, "Good System Structure Features: Their Complexity and Execution Time Cost", IEEE Transactions on Software EngineeringSE-8(4)(July 1982).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 J.E. Savage, The Complexity of Computing, J. Wiley & Sons (1976).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 S. Sahni, "Approximate Algorithms for the 0/1 Knapsack Problem", Journal ACM22(1) pp. 115-124 (Jan. 1975).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 E. Horowitz and S. Sahni, "Computing Partitions with Applications to the Knapsack Problem", Journal ACM21(2) pp. 277-292 (April 1974).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 O.H. Ibarra and C.E. Kim, "Fast Approximation Algorithms for the Knappsack and Sum of Subset Problems", JACM22(4) pp. 463-468 (Oct 1975).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 B. Holtkamp and H. Kaestner, "A Firmware Monitor to Support Vertical Migration Decisions in the UNIX Operating System", Proc. 15th Annual Workshop on Microprogramming, SIGMICRO Newsletter13(4) pp. 153-162 (December 1982).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 P. Wagner, "Vertikale Verlagerung im UNIX-Betriebssystem", Diplomarbeit, Universitaet Dortmund, Abteilung Informatik (1984).]]Google ScholarGoogle Scholar
  19. 19 Digital, "PDP- 11/60 Processor Handbook", Digital Equipment Corporation (1977).]]Google ScholarGoogle Scholar
  20. 20 Bell, "UNIX Programmer's Manual", Bell Laboratories (January 1979).]]Google ScholarGoogle Scholar

Index Terms

  1. An algorithm for selection of migration candidates

      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 15, Issue 4
        MICRO 17: Proceedings of the Seventeenth Annual Microprogramming Workshop
        Dec. 1984
        302 pages
        ISSN:1050-916X
        DOI:10.1145/384281
        Issue’s Table of Contents
        • cover image ACM Conferences
          MICRO 17: Proceedings of the 17th annual workshop on Microprogramming
          December 1984
          325 pages

        Copyright © 1984 Authors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 December 1984

        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!