Combining loop unrolling strategies and code predication to reduce the worst-case execution time of real-time software

Carminati, Andreu; Starke, Renan Augusto

doi:10.1016/j.aci.2017.03.002

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [17], a loop unrolling approach for loops with arbitrary (variable) execution counts was proposed for worst-case execution time (WCET) reduction in realtime applications. In traditional unrolling approaches, loops with unknown execution courses are unrolled with fixed unrolling factors.…”

Section: Related Workmentioning

confidence: 99%

“…In traditional unrolling approaches, loops with unknown execution courses are unrolled with fixed unrolling factors. However, the approach proposed in [17] is based on the code predication method used in software pipelining of loops. The proposed approach in [17] performs code predication in conjunction with the unrolling steps.…”

Section: Related Workmentioning

confidence: 99%

“…However, the approach proposed in [17] is based on the code predication method used in software pipelining of loops. The proposed approach in [17] performs code predication in conjunction with the unrolling steps. The technique starts from a simple data dependent loop (iteration dependent on the value of a variable) and directly generates an unrolled and predicated version.…”

Section: Related Workmentioning

confidence: 99%

“…The technique starts from a simple data dependent loop (iteration dependent on the value of a variable) and directly generates an unrolled and predicated version. The approach proposed in [17] is also combined with other unrolling techniques for data dependent loops and loops with fixed execution counts.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Unraveling Iterative Control Structures from Business Processes

Si¹,

Yung²

2021

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Iterative control structures allow the repeated execution of tasks, activities or sub-processes according to the given conditions in a process model. Iterative control structures can significantly increase the risk of triggering temporal exceptions since activities within the scope of these control structures could be repeatedly executed until a predefined condition is met. In this paper, we propose two approaches to unravel iterative control structures from process models. The first approach unravels loops based on zero-one principle. The second approach unravels loops based on branching probabilities assigned at split gateways. The proposed methods can be used to unfold structured loops, nested loops and crossing loops. Since the unfolded model does not contain any iterative control structures, it can be used for further analysis by process designers during the modeling phase. The proposed methods are implemented based on workflow graphs, and therefore they are compatible with modeling languages such as Business Process Modelling Notation (BPMN). In the experiments, the execution behavior of unfolded process models is compared against the original models based on the concept of runs. Experimental results reveal that runs generated from the original models can be correctly executed in the unfolded BPMN models that do not contain any loops.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%