Many scientific disciplines provide composition primitives whereby overall properties of systems are composed from those of their components. Examples include rules for block diagram reduction in control theory and laws for computing equivalent circuit impedance in circuit theory. No general composition rules exist for real-time systems whereby a distributed system is transformed to an equivalent single stage analyzable using traditional uniprocessor schedulability analysis techniques. Towards such a theory, in this paper, we extend our previous result on pipeline delay composition to the general case of distributed acyclic systems as well as to non-preemptive scheduling. The new extended analysis provides a worst-case bound on the end-to-e...
This paper improves lower bounds on the minimum number of processors and minimum time to execute a g...
For any real-time system, being predictable with respect to time is a basic necessity. The combinati...
International audienceThe scheduling of real-time parallel tasks on multiprocessor systems is more c...
Many scientific disciplines provide composition primitives whereby overall properties of systems are...
In this paper, we present a delay composition rule that bounds the worst-case end-to-end delay of a ...
This thesis develops a new reduction-based analysis methodology for studying the worst-case end-to-e...
Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive s...
Abstract A significant problem with no simple solutions in current real-time liter-ature is analyzin...
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing t...
Abstract Uniprocessor schedulability theory made great strides, in part, due to the simplicity of co...
The delay composition theorem, by taking into account the fact that pipeline systems allow concurren...
International audienceThis paper addresses the problem of scheduling parallel real- time tasks of Di...
This paper focuses on the analysis of real-time non preemptive mul-tiprocessor scheduling with prece...
In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Direc...
This paper improves lower bounds on the minimum number of processors and minimum time to execute a g...
This paper improves lower bounds on the minimum number of processors and minimum time to execute a g...
For any real-time system, being predictable with respect to time is a basic necessity. The combinati...
International audienceThe scheduling of real-time parallel tasks on multiprocessor systems is more c...
Many scientific disciplines provide composition primitives whereby overall properties of systems are...
In this paper, we present a delay composition rule that bounds the worst-case end-to-end delay of a ...
This thesis develops a new reduction-based analysis methodology for studying the worst-case end-to-e...
Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive s...
Abstract A significant problem with no simple solutions in current real-time liter-ature is analyzin...
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing t...
Abstract Uniprocessor schedulability theory made great strides, in part, due to the simplicity of co...
The delay composition theorem, by taking into account the fact that pipeline systems allow concurren...
International audienceThis paper addresses the problem of scheduling parallel real- time tasks of Di...
This paper focuses on the analysis of real-time non preemptive mul-tiprocessor scheduling with prece...
In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Direc...
This paper improves lower bounds on the minimum number of processors and minimum time to execute a g...
This paper improves lower bounds on the minimum number of processors and minimum time to execute a g...
For any real-time system, being predictable with respect to time is a basic necessity. The combinati...
International audienceThe scheduling of real-time parallel tasks on multiprocessor systems is more c...