Semantics-Based Scheduling Approach of Ontology-Based Real-Time DBMS

2021 ◽  
Author(s):  
Fehima Achour ◽  
Wassim Jaziri ◽  
Emna Bouazizi

Real-time DBMSs (DataBase Management Systems) are designed to manage transactions with time constraints and maintain the database consistency. The Quality of Service (QoS) in these systems is often evaluated based on the number of transactions satisfying their deadlines using a Feedback Control Scheduling Architecture (FCS). In this context, we are interested in the recently proposed FCS for Real-Time Ontology (FCSRTO) allowing to manage real-time ontological data, to which a specific execution of transactions is proposed. Being essential for the execution process of transactions, scheduling has been the subject of a recent work proposing the Advanced Earliest Deadline First based on Transactions Aggregation Links and Data Semantic Links (AEDF-TAL-DSL) as a scheduling protocol. It is mainly based on considering the aggregation links existing between transactions as well as the semantic links appearing between the users queries as scheduling parameters. Our work is to propose a new QoS approach called Semantics-Based FCSRTO. Our approach consists in combining the FCSRTO and the AEDF-TAL-DSL in a same architecture. Hence, we are improving the FCSRTO by using a sophisticated scheduling protocol on one hand, and on the other, it improves the AEDF-TAL-DSL scheduling protocol by managing transactions accessing to real-time ontological data. We also show the contributions provided by our QoS approach through a set of simulations.

2008 ◽  
pp. 1781-1788
Author(s):  
Christos Bouras ◽  
Apostolos Gkamas ◽  
Dimitris Primpas ◽  
Kostas Stamos

The heterogeneous network environment that Internet provides to real time applications as well as the lack of sufficient QoS (Quality of Service) guarantees, many times forces applications to embody adaptation schemes in order to work efficiently. In addition, any application that transmits data over the Internet should have a friendly behaviour towards the other flows that coexist in today’s Internet and especially towards the TCP flows that comprise the majority of flows. We define as TCP friendly flow, a flow that consumes no more bandwidth than a TCP connection, which is traversing the same path with that flow (Pandhye 1999).


Author(s):  
Christos Bouras ◽  
Apostolos Gkamas ◽  
Dimitris Primpas ◽  
Kostas Stamos

The heterogeneous network environment that Internet provides to real time applications as well as the lack of sufficient QoS (Quality of Service) guarantees, many times forces applications to embody adaptation schemes in order to work efficiently. In addition, any application that transmits data over the Internet should have a friendly behaviour towards the other flows that coexist in today’s Internet and especially towards the TCP flows that comprise the majority of flows. We define as TCP friendly flow, a flow that consumes no more bandwidth than a TCP connection, which is traversing the same path with that flow (Pandhye 1999).


2011 ◽  
pp. 290-332 ◽  
Author(s):  
Fabien Costantini ◽  
Christian Toinard

The case study is derived into a set of general requirements for a VEP tool. Thus, the major functional services are identified. Afterwards, the chapter presents a new solution to satisfy the VEP requirements. It proposes new collaboration services that can be used to distribute a virtual scene between the designers. Our solution, called the Distributed Building Site Metaphor, enables project management, meeting management, parallel working, disconnected work and meeting work, real-time validation, real-time modification, real-time conciliation, real-time awareness, easy motion between these styles of work, consistency, security and persistency. In contrast with the other solutions, our services enable parallel work while preserving consistency. These services do not require or implement a reliable multicasting. They are fully distributed and do not require any specific quality of service from the under laying network. DBSM can add collaboration to any stand-alone application.


Author(s):  
Audrey Marchand ◽  
Maryline Chetto

In this paper, we deal with dynamic scheduling components integrating new Quality of Service (QoS) functionalities into a Linux-based real-time operating system. In our approach, periodic tasks allow occasional deadline violations within given bounds specified according to the Skip-Over task model. Hence, every task has a minimal QoS guarantee which is expressed by the ratio of periodic task instances which must complete before their deadline. The work stated here provides two on-line scheduling algorithms, namely RLP and RLP/T, which enhance the existing Skip-Over algorithms. More specifically, the proposed algorithms aim at improving the actual QoS observed for periodic tasks (which is always greater or equal to the QoS guarantee). These novel scheduling techniques rely on the EDL (Earliest Deadline as Late as possible) scheduling strategy. Simulation results show the performance of RLP and RLP/T with respect to basic Skip-Over algorithms. Finally, we present the integration of these QoS scheduling services into CLEOPATRE open-source component library, a patch to Linux/RTAI.


2014 ◽  
Author(s):  
Abhilash Thekkilakattil ◽  
Sanjoy Baruah ◽  
Radu Dobrin ◽  
Sasikumar Punnekkat

Sign in / Sign up

Export Citation Format

Share Document