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.
- 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 Scholar
Digital Library
- 2 P. Albrich, "Vertikale Verlagerung - Verfahren, Voraussetzungen, Anwendung", Seminar "Firmware Engineering", Informatik Fachberichte 31, Springer (1980).]] Google Scholar
Digital Library
- 3 P. Meinke, "Verlagerung von Softwarefunktionen in Mikroprogramme", Diplomarbeit am Institut fuer Informatik IV, Universitaet Karlsruhe (1979).]]Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 8 G.E. Brown, J.R. Eckhouse, and Goldberg, "Operating System Enhancement through Microprogramming", SIGMICRO7 pp. 29-33 (March 1976).]] Google Scholar
Digital Library
- 9 E. Luque, A. Ripoll, and J.J. Ruz, "Dynamic Microprogramming in Computer Architecture Redefinition", Euromicro Journal, (6 )pp. 98-103 (1980).]]Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
- 12 J. Stankovic, "Good System Structure Features: Their Complexity and Execution Time Cost", IEEE Transactions on Software EngineeringSE-8(4)(July 1982).]]Google Scholar
Digital Library
- 13 J.E. Savage, The Complexity of Computing, J. Wiley & Sons (1976).]] Google Scholar
Digital Library
- 14 S. Sahni, "Approximate Algorithms for the 0/1 Knapsack Problem", Journal ACM22(1) pp. 115-124 (Jan. 1975).]] Google Scholar
Digital Library
- 15 E. Horowitz and S. Sahni, "Computing Partitions with Applications to the Knapsack Problem", Journal ACM21(2) pp. 277-292 (April 1974).]] Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 18 P. Wagner, "Vertikale Verlagerung im UNIX-Betriebssystem", Diplomarbeit, Universitaet Dortmund, Abteilung Informatik (1984).]]Google Scholar
- 19 Digital, "PDP- 11/60 Processor Handbook", Digital Equipment Corporation (1977).]]Google Scholar
- 20 Bell, "UNIX Programmer's Manual", Bell Laboratories (January 1979).]]Google Scholar
Index Terms
An algorithm for selection of migration candidates
Recommendations
An algorithm for selection of migration candidates
MICRO 17: Proceedings of the 17th annual workshop on MicroprogrammingThe 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 ...
A Virtual Machine Migration Algorithm Based on Group Selection in Cloud Data Center
Network and Parallel ComputingAbstractLive migration of virtual machine (VM) is a promising technology that helps physical machines (PMs) adapt to load changes and guarantees Quality of Service (QoS) in cloud data center. Many individual-based VM migration studies ignore the ...
Improving Total Migration Time in Live Virtual Machine Migration
ICCCT '15: Proceedings of the Sixth International Conference on Computer and Communication Technology 2015Virtualization is the key underlying technology enabling cloud providers to host services for a large number of customers. Live migration is an essential feature of virtualization that allows transfer of virtual machines from one physical server to ...






Comments