Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
The Complexity of Computing
Vertikale Verlagerung - Verfahren, Voraussetzungen, Anwendung
Firmware Engineering, Seminar veranstaltet von der gemeinsamen Fachgruppe "Mikroprogrammierung" des GI Fachausschusses 3/4 und des NTG-Fachausschusses 6 vom
Mikro-Programme als externe PASCAL-Prozeduren
PASCAL, 2. Tagung in Kaiserslautern, Tagung I/1979 des German Chapter of the ACM
A firmware monitor to support vertical migration decisions in the UNIX operating system
MICRO 15 Proceedings of the 15th annual workshop on Microprogramming
Operating system enhancement through firmware
MICRO 10 Proceedings of the 10th annual workshop on Microprogramming
Tuning architecture at run-time
ACM SIGMICRO Newsletter
Microprogramming heritage of RISC design
MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
Naming and Binding in a Vertical Migration Environment
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
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.