A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

Kordon, Alix Munier

doi:10.1007/s10951-009-0159-z

Cited by 15 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These questions were initially considered for non-negative uniform case [14], i.e, for any arc a, (a) > 0 and h(a) ≥ 0. These results were extended in [35] for any integer values. For the sake of simplicity, we mention here the main results for the case where G is strongly connected.…”

Section: Basic Resultsmentioning

confidence: 82%

“…For the sake of simplicity, we mention here the main results for the case where G is strongly connected. General case can be found in [35,15].…”

Section: Basic Resultsmentioning

confidence: 99%

“…First point of Theorem 1.5 deals with the schedulability. Second point concerns the the evaluation of the maximum throughput while the third point is about the performance of a periodic schedule: Theorem 1.5 ( [39,35]). Let G be a uniform strongly connected task system.…”

Section: Basic Resultsmentioning

confidence: 99%

“…Observe that in this case, p i > 0 and M 0 (a) ≥ 0. However, uniform precedence graphs can be defined more generally as in [35]. Indeed, in the more general case, the two integer values associated to any arc a = (J i , J j ) may be negative.…”

Section: Uniform Precedence Graphsmentioning

confidence: 99%

See 3 more Smart Citations

Cyclic Data Flows in Computers and Embedded Systems

Hanen

Munier-Kordon

2019

Modelling and Performance Analysis of Cyclic Systems

View full text Add to dashboard Cite

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

Section: Basic Resultsmentioning

confidence: 82%

“…For the sake of simplicity, we mention here the main results for the case where G is strongly connected. General case can be found in [35,15].…”

Section: Basic Resultsmentioning

confidence: 99%

Section: Basic Resultsmentioning

confidence: 99%

Section: Uniform Precedence Graphsmentioning

confidence: 99%

See 2 more Smart Citations

Cyclic Data Flows in Computers and Embedded Systems

Hanen

Munier-Kordon

2019

Modelling and Performance Analysis of Cyclic Systems

View full text Add to dashboard Cite

show abstract

“…Hence, two tasks T i and T j within one period may have a differentq i and q j , since the pieces of data related to these tasks correspond to the different waves (this notion used in cyclic scheduling [27], [28] is identical to the modulo scheduling or SW pipelining in the parallel compiler community [29]). The cyclic schedule has to follow several constraints:…”

Section: ) Cyclic Extensionmentioning

confidence: 99%

Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee

Hanzálek

Jurcik

2010

IEEE Trans. Ind. Inf.

108

View full text Add to dashboard Cite

Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of RCPS/TC (Resource Constrained Project Scheduling with Temporal Constraints) problem for a cluster-tree WSN, assuming bounded communication errors. The objective is to meet all end-to-end deadlines of a predefined set of time-bounded data flows while minimizing the energy consumption of the nodes by setting the TDCS period as long as possible. Sinceeach cluster is active only once during the period, the end-to-end delay of a given flow may span over several periods when there are the flows with opposite direction. The scheduling tool enables system designers to efficiently configure all required parameters of the IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs in the network design time. The performance evaluation of thescheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers. Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of RCPS/TC (Resource Constrained Project Scheduling with Temporal Constraints) problem for a cluster-tree WSN, assuming bounded communication errors. The objective is to meet all end-to-end deadlines of a predefined set of time-bounded data flows while minimizing the energy consumption of the nodes by setting the TDCS period as long as possible. Since each cluster is active only once during the period, the end-to-end delay of a given flow may span over several periods when there are the flows with opposite direction. The scheduling tool enables system designers to efficiently configure all required parameters of the IEEE 802.15.4/ZigBee beacon-enabled cluster-tree WSNs in the network design time. The performance evaluation of the scheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers.

show abstract

Bibliography

2014

Advanced Backend Code Optimization

View full text Add to dashboard Cite

A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

Cited by 15 publications

References 14 publications

Cyclic Data Flows in Computers and Embedded Systems

Cyclic Data Flows in Computers and Embedded Systems

Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee

Bibliography

Contact Info

Product

Resources

About