https://scholars.lib.ntu.edu.tw/handle/123456789/117990
標題: | An LC branch-and-bound algorithm for the module assignment problem | 作者: | Chern, Maw-Sheng Chen, Gen-Huey Liu, Pangfeng |
關鍵字: | Branch-and-bound algorithms; distributed processing system; module assignment problem | 公開日期: | 1989 | 卷: | 32 | 期: | 2 | 起(迄)頁: | 61-71 | 來源出版物: | Information Processing Letters | 摘要: | Distributed processing has been a subject of recent interest due to the availability of computer networks. Over the past few years it has lead to the identification of several challenging problems. One of these is the problem of optimally distributing program modules over a distributed processing system. In this paper we present an LC (Leas Cost) branch-and-bound algorithm to find an optimal assignment that minimizes the sum of execution costs and communication costs. Experimental results show that, for over half of the randomly generated instances, the saving rates exceed 99%. Moreover, it appears that the saving rates rise as the size of the instances increases. Finally, we also introduce two reduction rules to improve the efficiency of the algorithm for some special cases. © 1989. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/154653 https://www.scopus.com/inward/record.uri?eid=2-s2.0-0024701461&doi=10.1016%2f0020-0190%2889%2990032-X&partnerID=40&md5=c803b5aa628327761b55ba29507674d8 |
ISSN: | 00200190 | SDG/關鍵字: | Computer Systems, Digital--Distributed; Optimization; Branch-and-Bound Algorithms; Module Assignment Problem; Optimal Assignment; Computer Programming |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。