Chaotic map initializations with Tiki-Taka algorithm for software remodularization problem
Software system is often a dynamic entity. During its lifecycle, software system often evolves to reflect the bug fixes and upgrades as well as the addition/removal of features from its users. As the evolution process takes place, the modularization becomes complex and gradually loose its quality. A...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Springer
2021
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/32782/1/19.%20Chaotic%20map%20initializations%20with%20tiki-taka%20algorithm%20for%20software%20remodularization%20problem.pdf http://umpir.ump.edu.my/id/eprint/32782/2/19.1%20Chaotic%20map%20initializations%20with%20tiki-taka%20algorithm%20for%20software%20remodularization%20problem.pdf http://umpir.ump.edu.my/id/eprint/32782/ https://doi.org/10.1007/978-981-16-4115-2_7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Software system is often a dynamic entity. During its lifecycle, software system often evolves to reflect the bug fixes and upgrades as well as the addition/removal of features from its users. As the evolution process takes place, the modularization becomes complex and gradually loose its quality. Addressing this issue, this paper evaluates the performance of automated software remodularization using the newly developed Tiki-Taka Algorithm (TTA) and its variants with four chaotic map initializations based on Chebyshev map, Circle map, Logistic Map and Piecewise Map. Remodularization results of 3 selected case studies (i.e., Printer Manager, IOT controller, and Layer Monitor) demonstrate that TTA with Chebyshev map gives the best overall performance over other initializations including the pseudo-random initialization within the original TTA. |
|---|