The Experts below are selected from a list of 69279 Experts worldwide ranked by ideXlab platform
Sanjoy Baruah - One of the best experts on this subject based on the ideXlab platform.
-
applying Real Time Scheduling theory to the synchronous data flow model of computation
Euromicro Conference on Real-Time Systems, 2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
-
ECRTS - Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation
2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
-
Open problems in Real-Time Scheduling
Journal of Scheduling, 2009Co-Authors: Sanjoy Baruah, Kirk PruhsAbstract:We state some of the most important open algorithmic problems in Real-Time Scheduling, and survey progress made on these problems since the 2009 Dagstuhl Scheduling seminar.
-
RTSS - Fairness in periodic Real-Time Scheduling
Proceedings 16th IEEE Real-Time Systems Symposium, 1Co-Authors: Sanjoy BaruahAbstract:The issue of temporal fairness in periodic Real-Time Scheduling is considered. It is argued that such fairness is often a desirable characteristic in Real-Time schedules. A concrete criterion for temporal fairness-pfairness-is described. The weight-monotonic Scheduling algorithm, a static priority Scheduling algorithm for generating pfair schedules, is presented and proven correct. A feasibility test is presented which, if satisfied by a system of periodic tasks, ensures that the weight-monotonic Scheduling algorithm will schedule the system in a pfair manner.
F Roubellat - One of the best experts on this subject based on the ideXlab platform.
-
a new method for workshop Real Time Scheduling
International Journal of Production Research, 1996Co-Authors: J C Billaut, F RoubellatAbstract:Workshop Real Time Scheduling is one of the key factors in improving manufacturing system efficiency. This is especially true for workshops in which various products are processed simultaneously, and use multipurpose machines. Real Time Scheduling is appropriate to handle perturbations in the environment of the manufacturing process, a major issue at the shop floor level. The products to be processed have release Times and due dates and the resources are multipurpose machines. A decision support system for Real Time Scheduling is described. It is based on an original approach, aiming at searching for characteristics of a set of schedules compatible with the main manufacturing constraints to be satisfied. This set of schedules is obtained by defining sequences of groups of permutable operations for every resource. A method to find such a set is described. We emphasize the use of this group sequence as a decision support system. Significant states and events requiring Real Time decisions are identified and ...
Abhishek Singh - One of the best experts on this subject based on the ideXlab platform.
-
applying Real Time Scheduling theory to the synchronous data flow model of computation
Euromicro Conference on Real-Time Systems, 2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
-
ECRTS - Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation
2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
J C Billaut - One of the best experts on this subject based on the ideXlab platform.
-
a new method for workshop Real Time Scheduling
International Journal of Production Research, 1996Co-Authors: J C Billaut, F RoubellatAbstract:Workshop Real Time Scheduling is one of the key factors in improving manufacturing system efficiency. This is especially true for workshops in which various products are processed simultaneously, and use multipurpose machines. Real Time Scheduling is appropriate to handle perturbations in the environment of the manufacturing process, a major issue at the shop floor level. The products to be processed have release Times and due dates and the resources are multipurpose machines. A decision support system for Real Time Scheduling is described. It is based on an original approach, aiming at searching for characteristics of a set of schedules compatible with the main manufacturing constraints to be satisfied. This set of schedules is obtained by defining sequences of groups of permutable operations for every resource. A method to find such a set is described. We emphasize the use of this group sequence as a decision support system. Significant states and events requiring Real Time decisions are identified and ...
Pontus Ekberg - One of the best experts on this subject based on the ideXlab platform.
-
applying Real Time Scheduling theory to the synchronous data flow model of computation
Euromicro Conference on Real-Time Systems, 2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
-
ECRTS - Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation
2017Co-Authors: Abhishek Singh, Pontus Ekberg, Sanjoy BaruahAbstract:Schedulability analysis techniques that are well understood within the Real-Time Scheduling community are applied to the analysis of recurrent Real-Time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a Real-Time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the Real-Time Scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from Real-Time Scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model.
-
Models and Complexity Results in Real-Time Scheduling Theory
2015Co-Authors: Pontus EkbergAbstract:When designing Real-Time systems, we want to prove that they will satisfy given timing constraints at run Time. The main objective of Real-Time Scheduling theory is to analyze properties of mathema ...
