An incremental constraint satisfaction algorithm for dynamic reconfiguration

Date

2017-05-08

Author

Entekhabi, Sina
Karataş, Ahmet Serkan
Oğuztüzün, Mehmet Halit S.

Metadata

Show full item record

Item Usage Stats

95
views

0
downloads

Dynamically reconfigurable systems are able to respond to changes in their operational environment by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit model of variability, which plays a key role in the reconfiguration process. In our work we use feature models for modeling variability. Features are mapped to the system’s components that realize them. The feature model corresponds to a constraint logic program, and determines the valid configurations of the system. An emerging situation in the environment leads to relevant changes to the current configuration: some features must be activated, and some must be deactivated. Due to constraint propagation, the status of other features must be changed as well. However, we would like to avoid such changes to the extent possible so as to minimize disruption to the system’s operation. We devised an incremental constraint satisfaction algorithm, based on Sannella’s SkyBlue solver, that computes changes to be made to the current configuration so that the new configuration will be valid and satisfy the requirements of the new situation.

URI

http://dcs.iyte.edu.tr/ws/program.html
https://hdl.handle.net/11511/77998

Conference Name

Workshop on Dependability (8 Mayıs 2017)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Dynamic constraint satisfaction algorithm for reconfiguration of feature models Entekhabi, Sina; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018) Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. Features are assumed to be mapped to system's components that realize them. A feature model corresponds to a constraint satisfaction problem (CSP), and determines the ...
Dynamic constraint satisfaction algorithm for online feature model reconfiguration Oğuztüzün, Mehmet Halit S.; Entekhabi, Sina (2019-07-01) Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. An emerging situation in the environment can lead to some relevant changes to the current configuration: some features must be activated, and some must be deactivated....
A longest path problem for evaluating the worst case packet delay of switched ethernet Schmidt, Klaus Verner; Schmidt, Şenan Ece (2010-07-09) In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-to-end packet delay by solving a conventional longest-path problem.
A Novel Method for the Synthetic Generation of Non-I.I.D Workloads for Cloud Data Centers Koltuk, Furkan; Schmidt, Şenan Ece (2020-07-01) © 2020 IEEE.Cloud data center workloads have time- dependencies and are hence non-i.i.d (independent and identically distributed). In this paper, we propose a new model-based method for creating synthetic workload traces for cloud data centers that have similar time characteristics and cumulative distributions to those of the actual traces. We evaluate our method using the actual resource request traces of Azure collected in 2019 and the well-known Google cloud trace. Our method enables generating synthetic...
An Efficient fuzzy fusion-based framework for surveillance applications in wireless multimedia sensor networks Sert, Seyyit Alper; Yazıcı, Adnan; Coşar, Ahmet; Department of Computer Engineering (2014) Previous advances in Information Technologies and especially in Micro Electro-Mechanical Systems, have made the Production and deployment of tiny, battery-powered nodes communicating over wireless links possible. Networks comprised of such nodes with sensing capability are called Wireless Sensor Networks. The early deployment aim was to use these nodes only in a passive way for indoor applications. These kinds of early nodes had the ability to sense scalar data such as temperature, humidity, pressure and lo...

Citation Formats

S. Entekhabi, A. S. Karataş, and M. H. S. Oğuztüzün, “An incremental constraint satisfaction algorithm for dynamic reconfiguration,” presented at the Workshop on Dependability (8 Mayıs 2017), İzmir, Türkiye, 2017, Accessed: 00, 2021. [Online]. Available: http://dcs.iyte.edu.tr/ws/program.html.