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.
Publisher
Association for Computing Machinery (ACM)
Reference20 articles.
1. P. Albrich "Vertikale Verlagerung - Verfahren Voraussetzungen Anwendung" Seminar "Firmware Engineering" Informatik Fachberichte 31 Springer (1980).]] P. Albrich "Vertikale Verlagerung - Verfahren Voraussetzungen Anwendung" Seminar "Firmware Engineering" Informatik Fachberichte 31 Springer (1980).]]
2. P. Meinke "Verlagerung von Softwarefunktionen in Mikroprogramme" Diplomarbeit am Institut fuer Informatik IV Universitaet Karlsruhe (1979).]] P. Meinke "Verlagerung von Softwarefunktionen in Mikroprogramme" Diplomarbeit am Institut fuer Informatik IV Universitaet Karlsruhe (1979).]]
3. 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).]] 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).]]
4. Vertical Migration for Performance Enhancement in Layered Hardware/Firmware/Software Systems