IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v12y2020i6p2177-d331361.html
   My bibliography  Save this article

Hierarchical System Decomposition Using Genetic Algorithm for Future Sustainable Computing

Author

Listed:
  • Jun-Ho Huh

    (Department of Data Informatics, Korea Maritime and Ocean University, Busan 49112, Korea)

  • Jimin Hwa

    (Moderian AI, Incheon 21985, Korea)

  • Yeong-Seok Seo

    (Department of Computer Engineering, Yeungnam University, Gyeongsan 38541, Korea)

Abstract

A Hierarchical Subsystem Decomposition (HSD) is of great help in understanding large-scale software systems from the software architecture level. However, due to the lack of software architecture management, HSD documentations are often outdated, or they disappear in the course of repeated changes of a software system. Thus, in this paper, we propose a new approach for recovering HSD according to the intended design criteria based on a genetic algorithm to find an optimal solution. Experiments are performed to evaluate the proposed approach using two open source software systems with the 14 fitness functions of the genetic algorithm (GA). The HSDs recovered by our approach have different structural characteristics according to objectives. In the analysis on our GA operators, crossover contributes to a relatively large improvement in the early phase of a search. Mutation renders small-scale improvement in the whole search. Our GA is compared with a Hill-Climbing algorithm (HC) implemented by our GA operators. Although it is still in the primitive stage, our GA leads to higher-quality HSDs than HC. The experimental results indicate that the proposed approach delivers better performance than the existing approach.

Suggested Citation

  • Jun-Ho Huh & Jimin Hwa & Yeong-Seok Seo, 2020. "Hierarchical System Decomposition Using Genetic Algorithm for Future Sustainable Computing," Sustainability, MDPI, vol. 12(6), pages 1-32, March.
    • Handle: RePEc:gam:jsusta:v:12:y:2020:i:6:p:2177-:d:331361
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/12/6/2177/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/12/6/2177/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jun-Ho Huh, 2018. "Server Operation and Virtualization to Save Energy and Cost in Future Sustainable Computing," Sustainability, MDPI, vol. 10(6), pages 1-20, June.
    2. Zi-Jia Wang & Zhi-Hui Zhan & Jun Zhang, 2018. "Solving the Energy Efficient Coverage Problem in Wireless Sensor Networks: A Distributed Genetic Algorithm Approach with Hierarchical Fitness Evaluation," Energies, MDPI, vol. 11(12), pages 1-14, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rasul Kochkarov, 2021. "Research of NP-Complete Problems in the Class of Prefractal Graphs," Mathematics, MDPI, vol. 9(21), pages 1-20, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jun-Ho Huh & Seong-Kyu Kim, 2019. "The Blockchain Consensus Algorithm for Viable Management of New and Renewable Energies," Sustainability, MDPI, vol. 11(11), pages 1-26, June.
    2. Miltiadis D. Lytras & Kwok Tai Chui, 2019. "The Recent Development of Artificial Intelligence for Smart and Sustainable Energy Systems and Applications," Energies, MDPI, vol. 12(16), pages 1-7, August.
    3. Seong-Kyu Kim & Ung-Mo Kim & Jun-Ho Huh, 2019. "A Study on Improvement of Blockchain Application to Overcome Vulnerability of IoT Multiplatform Security," Energies, MDPI, vol. 12(3), pages 1-29, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:12:y:2020:i:6:p:2177-:d:331361. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.