• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Chen Honglong, Li Renfa, Li Rui, Edwin Sha. An Assignment Model and Algorithm for Self-Adaptive Software Based on Architecture[J]. Journal of Computer Research and Development, 2011, 48(12): 2300-2307.
Citation: Chen Honglong, Li Renfa, Li Rui, Edwin Sha. An Assignment Model and Algorithm for Self-Adaptive Software Based on Architecture[J]. Journal of Computer Research and Development, 2011, 48(12): 2300-2307.

An Assignment Model and Algorithm for Self-Adaptive Software Based on Architecture

More Information
  • Published Date: December 14, 2011
  • The research on self-adaptive evolution software is one of the new focuses in the field of software engineering, and the online evolution that makes software adapt to the changing environment according to the architecture meta information attracts most people's attention. But due to the insufficient consideration in non-function requirements of software evolution, we focus on the optimal component assignment problem in self-adaptive software which is continuously meeting system's constraints based on architecture information during runtime. In this paper, the component assignment based architecture model is firstly described in detail, and a component assignment model is set up for this problem and proved to be NP (non-deterministic polynomial). And then we propose a heuristic algorithm to find a solution for this problem. Finally, the experimental results show that compared with the algorithm of greedy and ILP, the proposed algorithm has many advantages such as multi-object balance and time performance, and compared with ILP alone, the algorithm has better time performance. So it testifies that the heuristic algorithm proposed in this paper is effective for online evolution decision.
  • Related Articles

    [1]Zhang Yiwen, Gao Zhenguo, Lin Mingwei. Fixed Priority Mixed-Criticality Sporadic Tasks Energy-Aware Algorithm[J]. Journal of Computer Research and Development, 2022, 59(6): 1202-1212. DOI: 10.7544/issn1000-1239.20210202
    [2]Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
    [3]Feng Xinyue, Yang Qiusong, Shi Lin, Wang Qing, Li Mingshu. Critical Memory Data Access Monitor Based on Dynamic Strategy Learning[J]. Journal of Computer Research and Development, 2019, 56(7): 1470-1487. DOI: 10.7544/issn1000-1239.2019.20180577
    [4]Huang Lida, Li Renfa. Scheduling of Mixed Criticality Real-Time Tasks Set with Deadline as the Critical Parameter[J]. Journal of Computer Research and Development, 2016, 53(7): 1641-1647. DOI: 10.7544/issn1000-1239.2016.20150331
    [5]Zhang Weiguo, Yin Xia, and Wu Jianping. A Computation Method of Path Diversity Based on AS Relationships[J]. Journal of Computer Research and Development, 2012, 49(1): 167-173.
    [6]Zhou Ling, Wang Jianxin. Path Nodes-Driven Least-Cost Shortest Path Tree Algorithm[J]. Journal of Computer Research and Development, 2011, 48(5): 721-728.
    [7]Yu Jiong, Tian Guozhong, Cao Yuanda, Sun Xianhe. A Resource Allocating Algorithm in Grid Workflow Based on Critical Regions Reliability[J]. Journal of Computer Research and Development, 2009, 46(11): 1821-1829.
    [8]Hou Jinkui, Wan Jiancheng, Yang Xiao, and Wang Haiyang. Formal Semantics of Component-Based Architecture Model Mapping[J]. Journal of Computer Research and Development, 2009, 46(2): 310-320.
    [9]Yu Kun, Wu Guoxin, Xu Libo, Wu Peng. Optimal Path Based Geographic Routing in Ad Hoc Networks[J]. Journal of Computer Research and Development, 2007, 44(12): 2004-2011.
    [10]Zhang Zhirou, Luo Siwei, Chen Xin, Zhong Jingjing. Research on Mobile Agent Path Optimization Algorithm in Grid[J]. Journal of Computer Research and Development, 2006, 43(5): 791-796.

Catalog

    Article views (562) PDF downloads (576) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return