Real-Time Computing

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 455484 Experts worldwide ranked by ideXlab platform

Andrea Fusiello - One of the best experts on this subject based on the ideXlab platform.

  • Rate-monotonic scheduling for hard-Real-Time systems
    European Journal of Operational Research, 1997
    Co-Authors: Alan A. Bertossi, Andrea Fusiello
    Abstract:

    Abstract Hard-Real-Time Computing systems are widely used in our society, for example, in nuclear and industrial plants, telecommunications, avionics and robotics. In such systems, almost all tasks occur infinitely often and have time deadlines, namely, their correctness relies not only on their logical results, but also on the time at which the results are available. A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met. This paper provides a review on deterministic scheduling algorithms for hard-Real-Time systems, focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor and, in particular, on the Rate-Monotonic algorithm. After presenting some basic results, several generalisations, aimed at relaxing some constraints and facing more realistic cases, are described. Issues covered include uniprocessor and multiprocessor systems, periodic and non-periodic tasks, restricted and arbitrary deadlines, fixed and dynamic priorities, independent and synchronised tasks, as well as fault-free and fault-tolerant systems.

  • invited review rate monotonic scheduling for hard real time systems 1
    1997
    Co-Authors: Alan A. Bertossi, Andrea Fusiello
    Abstract:

    Hard-Real-Time Computing systems are widely used in our society, for example, in nuclear and industrial plants, telecommunications, avionics and robotics. In such systems, almost all tasks occur infinitely often and have time deadlines, namely, their correcmess relies not only on their logical results, but also on the time at which the results are available. A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met. This paper provides a review on deterministic scheduling algorithms for hard-Real-Time systems, focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor and, in particular, on the Rate-Monotonic algorithm. After presenting some basic results, several generalisations, aimed at relaxing some constraints and facing more realistic cases, are described. Issues covered include uniprocessor and multiprocessor systems, periodic and non-periodic tasks, restricted and arbitrary deadlines, fixed and dynamic priorities, independent and synchronised tasks, as well as fault-free and fault-tolerant systems.

Abdellatif Miraoui - One of the best experts on this subject based on the ideXlab platform.

  • Tridiagonal Matrix Algorithm for Real-Time Simulation of a Two-Dimensional PEM Fuel Cell Model
    IEEE Transactions on Industrial Electronics, 2018
    Co-Authors: Daming Zhou, Elena Breaz, Alexandre Ravey, Fei Gao, Abdellatif Miraoui
    Abstract:

    This paper presents a novel two-dimensional Real-Time modeling approach for a proton exchange membrane fuel cell (PEMFC) based on a tridiagonal matrix algorithm (Thomas algorithm). The Thomas algorithm consists of a forward elimination and a backward substitution, its arithmetic complexity of computations being much lower than the Gaussian elimination. In order to use this advanced numerical solver, the differential equations of reactant gas convection and diffusion phenomena in serpentine channels are transformed into a tridiagonal equations system. In addition, a three-level bisection algorithm has been developed to solve spatial physical quantities distribution for electrochemical domain. The Real-Time Computing methods developed in this paper are then implemented in C language for a fast execution time in a Real-Time processor. The proposed Real-Time model is experimentally validated using a 1.2 kW Ballard NEXA fuel cell system, and its practical feasibilities in advanced Real-Time control for PEMFC systems have been experimentally demonstrated in an RT-LAB Real-Time simulator.

S S Sathaye - One of the best experts on this subject based on the ideXlab platform.

  • generalized rate monotonic scheduling theory a framework for developing real time systems
    Proceedings of the IEEE, 1994
    Co-Authors: Ragunathan Rajkumar, S S Sathaye
    Abstract:

    Real-Time Computing systems are used to control telecommunication systems, defense systems, avionics, and modern factories. Generalized rate-monotonic scheduling theory, is a recent development that has had large impact on the development of Real-Time systems and open standards. In this paper we provide an up-to-date and self-contained review of generalized rate-monotonic scheduling theory. We show how this theory can be applied in practical system development, where special attention must be given to facilitate concurrent development by geographically distributed programming teams and the reuse of existing hardware and software components. >

Alan A. Bertossi - One of the best experts on this subject based on the ideXlab platform.

  • Rate-monotonic scheduling for hard-Real-Time systems
    European Journal of Operational Research, 1997
    Co-Authors: Alan A. Bertossi, Andrea Fusiello
    Abstract:

    Abstract Hard-Real-Time Computing systems are widely used in our society, for example, in nuclear and industrial plants, telecommunications, avionics and robotics. In such systems, almost all tasks occur infinitely often and have time deadlines, namely, their correctness relies not only on their logical results, but also on the time at which the results are available. A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met. This paper provides a review on deterministic scheduling algorithms for hard-Real-Time systems, focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor and, in particular, on the Rate-Monotonic algorithm. After presenting some basic results, several generalisations, aimed at relaxing some constraints and facing more realistic cases, are described. Issues covered include uniprocessor and multiprocessor systems, periodic and non-periodic tasks, restricted and arbitrary deadlines, fixed and dynamic priorities, independent and synchronised tasks, as well as fault-free and fault-tolerant systems.

  • invited review rate monotonic scheduling for hard real time systems 1
    1997
    Co-Authors: Alan A. Bertossi, Andrea Fusiello
    Abstract:

    Hard-Real-Time Computing systems are widely used in our society, for example, in nuclear and industrial plants, telecommunications, avionics and robotics. In such systems, almost all tasks occur infinitely often and have time deadlines, namely, their correcmess relies not only on their logical results, but also on the time at which the results are available. A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met. This paper provides a review on deterministic scheduling algorithms for hard-Real-Time systems, focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor and, in particular, on the Rate-Monotonic algorithm. After presenting some basic results, several generalisations, aimed at relaxing some constraints and facing more realistic cases, are described. Issues covered include uniprocessor and multiprocessor systems, periodic and non-periodic tasks, restricted and arbitrary deadlines, fixed and dynamic priorities, independent and synchronised tasks, as well as fault-free and fault-tolerant systems.

Daming Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Tridiagonal Matrix Algorithm for Real-Time Simulation of a Two-Dimensional PEM Fuel Cell Model
    IEEE Transactions on Industrial Electronics, 2018
    Co-Authors: Daming Zhou, Elena Breaz, Alexandre Ravey, Fei Gao, Abdellatif Miraoui
    Abstract:

    This paper presents a novel two-dimensional Real-Time modeling approach for a proton exchange membrane fuel cell (PEMFC) based on a tridiagonal matrix algorithm (Thomas algorithm). The Thomas algorithm consists of a forward elimination and a backward substitution, its arithmetic complexity of computations being much lower than the Gaussian elimination. In order to use this advanced numerical solver, the differential equations of reactant gas convection and diffusion phenomena in serpentine channels are transformed into a tridiagonal equations system. In addition, a three-level bisection algorithm has been developed to solve spatial physical quantities distribution for electrochemical domain. The Real-Time Computing methods developed in this paper are then implemented in C language for a fast execution time in a Real-Time processor. The proposed Real-Time model is experimentally validated using a 1.2 kW Ballard NEXA fuel cell system, and its practical feasibilities in advanced Real-Time control for PEMFC systems have been experimentally demonstrated in an RT-LAB Real-Time simulator.