Commissariat &#xc0; L'&#xc9;nergie Atomique Et Aux &#xc9;nergies Alternatives

Institut Mines-telecom

Mathieu Jan

Vincent David

Paul Dubrulle

Olivier Debicki

Nikolay Kosmatov

Christophe Aussagues

Matthieu Lemerre

Christophe Gaston

Arnault Lapitre

Florian Brandner

Laurent Pautet

Farouk Hebbache

Mihail Asavoae

A computer-implemented method for monitoring an executable code having a sequence of software instructions. The method includes acquiring the sequence and generating a first modeling structure of an execution path of the sequence, the first structure having first data groups, each associated with a respective instruction and including identifiers of preceding and following instructions. A second modeling structure of an operation of the sequence is constructed by going through the first groups, the second structure having second data groups, each associated with a respective instruction and including an indicator of possibly belonging to a critical chain. A critical chain corresponds to instructions of a same software function and is computed by solving a subgraph problem with degree restraints, each critical chain corresponding to a subgraph. The method also includes searching for runtime anomaly/anomalies from critical chain(s) determined via the second structure.

Method and electronic device for monitoring executable code adapted to be executed on a computer platform, and computer program implementing such a method

The invention relates to a method implemented by computer for arbitration between computer programs seeking to access a shared resource concurrently and each transmitting an access request. The method performs time-division multiple access according to which the time is divided into time slots, each of which is allocated to a critical program for access to the shared resource, each time slot comprising a plurality of time units. The method exploits a processing slack associated with each critical program in order to delay a processing deadline for an access request transmitted by the critical program. The method comprises, for each unit time, a step of selecting a waiting access request and a step of determining authorization for immediate processing of the selected access request. This determining operation comprises, for a unit time which does not correspond to the beginning of a time slot, when the critical program to which the next time slot is allocated has not issued the selected request, authorization for the immediate processing of the selected request if the processing slack of the critical program to which the next time slot is allocated is greater than a threshold.

Time-division multiplexing method and circuit for arbitrating concurrent access to a computer resource based on a processing slack associated with a critical program

The invention relates to a method for transmitting a target data frame (fA) on a path comprising at least one router (R) that has input ports (P, P, P), at least one output port (PS) and an arbitration unit (UA) configured so as to select a data frame from a plurality of data frames each coming from a different input port and competing for transmission by one and the same output port. The method comprises specifying, for each of the access ports of the router, data frames (fB, fC) competing with the target data frame for transmission by a target output port of the router. An end-to-end transmission time of the target data frame on the path is then measured while the arbitration unit selects the competing data frame (fB) before the target data frame (fA) for transmission by the target output port (PS).

Method for measuring a transmission delay with control of degrees of contention applied to a data frame

The present invention concerns a method and a tool for designing and validating a data flow system comprising a set of software and/or hardware actors (a, a) interconnected with each other by unidirectional communication channels (c, c), the tool comprising: &#x2014;a modelling interface () configured to generate an instance of the system by specifying, in a formal manner, a real-time and reconfigurable data flow, the reconfiguration of the data flow being carried out dynamically by propagating reconfiguration data from one actor to another through the communication channels, &#x2014;an analysis module () configured to prove a predetermined set of behavioral properties of the system by means of a static analysis of the instance, &#x2014;a refinement interface () designed to allocate resources to the instance, thus establishing a configured instance, the allocation of resources being carried out in such a way that an implementation of the system complies with the configured instance, and &#x2014;a conformity test module () configured to verify the conformity of the behaviour of an implementation of the system with respect to the configured instance.

Tool and method for designing and validating a data flow system by a formal model

The invention is directed a method for transferring at least one datum between a real-time task producing a datum and a real-time task consuming said datum. The method may include, in response to initiation of a transfer of a datum by a current instance of an initiating task: creating at least one DMA descriptor describing the DMA transfer expected for said datum; inserting DMA descriptors into a list of descriptors awaiting processing by a DMA controller, said DMA descriptors being inserted in a manner sorted based on a sorting criterion relating to a visibility date of the data and/or a temporal behavior of the tasks; processing the descriptors on the list of DMA descriptors by executing DMA requests; and executing the following instance of the initiating task based on termination of the processing a predefined set of DMA descriptors on the list of descriptors.

Method for data transfer between real-time tasks using a DMA memory controller

A device and a method for transmitting data within a network switch is provided. The method implemented by computer makes it possible to transmit to a receiver network domain only the applicational data necessary for this domain. The method identifies in a frame received solely the data corresponding to each addressee network domain, and then the frame is disassembled so as to write each suite of data into an assigned memory area of the network switch. The method moreover makes it possible to dispatch a frame with only the data of an addressee network domain by constructing a new frame with solely the data necessary for the addressee network which have been stored in a memory area of the switch.

Device and method for retransmitting data in a network switch

A method for executing an application in a multitasking system is provided. The application is composed of at least one task for which the temporal triggering is specified in a first temporal reference frame that is asynchronous relative to the physical time, called first external clock domain, defined by a synchronous basic clock with changes of state of a peripheral device of the system. The method comprises a set of steps executed by the system upon reception of an occurrence of an interrupt in order to render the execution of the task deterministic or quasi-deterministic.

Method for executing, within a multitasking onboard system, an application timed according to a plurality of different time domains including interruption management

Growing community of inventors

Savigny-sur-Orge, France

Mathieu Jan