一种选择迁移候选者的算法

MICRO 17 Pub Date : 1984-12-01 DOI:10.1145/800016.808224

B. Holtkamp, P. Wagner

{"title":"一种选择迁移候选者的算法","authors":"B. Holtkamp, P. Wagner","doi":"10.1145/800016.808224","DOIUrl":null,"url":null,"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.","PeriodicalId":447708,"journal":{"name":"MICRO 17","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An algorithm for selection of migration candidates\",\"authors\":\"B. Holtkamp, P. Wagner\",\"doi\":\"10.1145/800016.808224\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":447708,\"journal\":{\"name\":\"MICRO 17\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MICRO 17\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800016.808224\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MICRO 17","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800016.808224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

通过将垂直迁移候选者选择问题简化为np完全背包问题，证明了该问题的np完备性。基于后一问题的近似算法，提出了一种考虑复杂系统中函数间调用关系的新算法。然后将该算法应用于UNIX操作系统，作为复杂系统的代表。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An algorithm for selection of migration candidates

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

MICRO 17

自引率

0.00%

发文量