[{“box”:0,”content”:”
n
n
n
- n t
- [foreach 286]
n
n
n
Manas Kumar Yogi, Dwarampudi Aiswarya
n
n
- n t
n
n[/foreach]
n
n
- [foreach 286] [if 1175 not_equal=””]n t
- Assistant Professor, Assistant Professor,Pragati Engineering College (Autonomous), Pragati Engineering College (Autonomous),Andhra Pradesh, Andhra Pradesh,India, India
n[/if 1175][/foreach]
n
n
n
Abstract
nSoftware systems dealing with distributed applications in changing environments normally require human supervision to proceed with activity in all conditions. These rearranging, investigating, and all in all upkeep errands prompt exorbitant and tedious strategies amid the working stage. These issues are principally because of the open-circle structure regularly followed in programming advancement. Hence, there is popularity for administration many-sided quality decrease, administration mechanization, vigor, and accomplishing the majority of the coveted quality prerequisites inside a sensible cost and time go amid tasks. Self-versatile programming is a reaction to these requests; it is a shut circle framework with an input circle expecting to modify itself to changes amid its activity. These progressions may originate from the product framework’s self (interior causes, e.g., come up failure) or setting (outside occasions, e.g., expanding demands from clients). Such a framework is required to screen itself and its specific situation, distinguish huge changes, choose how to respond, and act to execute such choices. These procedures rely upon adjustment properties (called self-properties), space qualities (setting data or models), and inclinations of partners. Taking note of these requirements, it is widely believed that new models and frameworks are needed to design self-versatile programming. This paper displays a scientific classification, in view of worries of adjustment, that is, how, what, when and where, towards giving a brought together perspective of this developing territory. Also, as versatile frameworks are experienced in numerous orders, it is basic to gain from the speculations what’s more, models created in these different zones. This review article shows a scene of research in self-versatile programming by featuring significant orders and some unmistakable research ventures. This scene distinguishes the basic research holes and expounds on the relating challenges.
n
Keywords: Adaptation processes, Self-properties, Self-adaptive, Redeployment, Sensing
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Computer Science Languages(ijcsl)]
n
n
n
n
nManas Kumar Yogi, Dwarampudi Aiswarya A Critical Study of Research Challenges for Self-Adaptive Software ijcsl July 6, 2023; 01:1-6
n
n
nn
Full Text
n[if 992 equals=”Open Access”]https://storage.googleapis.com/journals-stmjournals-com-wp-media-to-gcp-offload/2023/07/fa3950e3-1-6-a-critical-study-of-research-challenges-for-self-adaptive-software.pdf [else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {ndocument.write(‘‘);ndocument.write(‘https://storage.googleapis.com/journals-stmjournals-com-wp-media-to-gcp-offload/2023/07/fa3950e3-1-6-a-critical-study-of-research-challenges-for-self-adaptive-software.pdf’);n} else if (fieldValue === ‘administrator’) {ndocument.write(‘‘);ndocument.write(”);n}else if (fieldValue === ‘ijcsl’) {n document.write(‘‘);n} else {n document.write(‘ ‘);n}n [/if 992]nn
nn[if 379 not_equal=””]n
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
1. Amoui M, Salehie M, Mirarab S, Tahvildari L. Adaptive action selection in autonomic software using reinforcement learning. In Fourth International Conference on Autonomic and Autonomous Systems (ICAS’08) 2008 Mar 16 (pp. 175–181). IEEE.
2. Arshad N, Heimbigner D, Wolf AL. Deployment and dynamic reconfiguration planning for distributed software systems. In Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence 2003 Nov 5 (pp. 39–46). IEEE.
3. Babaoglu O, Jelasity M, Montresor A, Fetzer C, Leonardi S, Van Moorsel A, Van Steen M, editors. Self-star properties in complex information systems: conceptual and practical foundations. Springer; 2005 May 10.
4. Bradbury JS, Cordy JR, Dingel J, Wermelinger M. A survey of self-management in dynamic software architecture specifications. In Proceedings of the 1st ACM SIGSOFT workshop on Self-managed systems 2004 Oct 31 (pp. 28–33).
5. Zhang J. A formal approach to providing assurance to dynamically adaptive software. Michigan State University; 2007 Jan 1.
6. Smith D, Morris E, Carney D. Interoperability issues affecting autonomic computing. ACM SIGSOFT Software Engineering Notes. 2005 May 21;30(4):1–3.
7. Salehie M, Tahvildari L. Self-adaptive software: Landscape and research challenges. ACM transactions on autonomous and adaptive systems (TAAS). 2009 May 21;4(2):1–42.
8. Habib SM, Ries S, Muhlhauser M. Cloud computing landscape and research challenges regarding trust and reputation. In 2010 7th International conference on ubiquitous intelligence & computing and 7th international conference on autonomic & trusted computing 2010 Oct 26 (pp. 410–415). IEEE.
9. Deming ME, Swaffield S. Landscape architectural research: Inquiry, strategy, design. John Wiley & Sons; 2011 Mar 11.
10. Chyad MA, Alsattar HA, Zaidan BB, Zaidan AA, Al Shafeey GA. The landscape of research on skin detectors: Coherent taxonomy, open challenges, motivations, recommendations and statistical analysis, future directions. IEEE Access. 2019 Jun 26;7:106536–75.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
n
n
n
n
| Volume | 01 |
| Issue | 01 |
| Received | April 18, 2023 |
| Accepted | June 14, 2023 |
| Published | July 6, 2023 |
n
n
n
n
n[/foreach]
n[/if 1190] [if 1177 not_equal=””]n
n
n[/foreach]
n[/if 1177]
n
Edit n function myfun() {n x=document.getElementById(“editor”);n y=document.getElementById(“down”);n z=document.getElementById(“up”);n if(x.style.display==”none”){n x.style.display=”block”;n }n else {n x.style.display=”none”;n }n if(y.style.display==”none”){n y.style.display=”block”;n }n else {n y.style.display=”none”;n }n if(z.style.display==”none”){n z.style.display=”block”;n }n else {n z.style.display=”none”;n }n }n function myfun2() {n x=document.getElementById(“reviewer”);n y=document.getElementById(“down2”);n z=document.getElementById(“up2″);n if(x.style.display==”none”){n x.style.display=”block”;n }n else {n x.style.display=”none”;n }n if(y.style.display==”none”){n y.style.display=”block”;n }n else {n y.style.display=”none”;n }n if(z.style.display==”none”){n z.style.display=”block”;n }n else {n z.style.display=”none”;n }n }n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;}n else {x.style.display = “Block”;}}n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);});n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);});n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));}n function currentSlide(n) {n showSlides((slideIndex = n));}n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) {slideIndex = 1;}n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n
“}]