Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays

Benabid, Abir; Hanen, Claire

doi:10.1007/s10951-010-0220-y

Cited by 7 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second approach, known as decomposed software pipelining (DSP) is based on the decomposition of the cyclic scheduling problem into two phases, retiming and compaction, the first one is related to the uniform task system, and the second to non cyclic resource constrained scheduling. In particular, several approximation algorithms have been proposed, based on this ideas [21,10,13,6]. Finally, in [3], a hybrid approach combining shifting and ILP has been investigated.…”

Section: Decomposed Software Pipelining and Resource Constrained Probmentioning

confidence: 99%

See 1 more Smart Citation

Cyclic Data Flows in Computers and Embedded Systems

Hanen

Munier-Kordon

2019

Modelling and Performance Analysis of Cyclic Systems

Self Cite

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: Decomposed Software Pipelining and Resource Constrained Probmentioning

confidence: 99%

“…Using such algorithms at the compaction step leads to a worst case ratio on the periodic schedule. This has been considered for parallel processors [21,17] and extended to RCPSP in [6].…”

Section: Decomposed Software Pipelining and Resource Constrained Probmentioning

confidence: 99%

Cyclic Data Flows in Computers and Embedded Systems

Hanen

Munier-Kordon

2019

Modelling and Performance Analysis of Cyclic Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Second, a standard acyclic problem, taking this retiming as input, is solved through list scheduling techniques. An extension of decomposed software pipelining has been proposed by [BH09a] for the resource-constrained cyclic scheduling problem with precedence delays. This approach has a very good performance in time and distance to optimum.…”

Section: Introductionmentioning

confidence: 99%

The resource-constrained modulo scheduling problem: an experimental study

et al. 2012

Self Cite

View full text Add to dashboard Cite

In this paper, we focus on the resource-constrained modulo scheduling problem, a general periodic scheduling problem, abstracted from the problem solved by compilers when optimizing inner loops at instruction level for VLIW parallel processors. Heuristic solving scheme have been proposed since many years to solve this problem, among which the decomposed software pipeling method. In this method, a cyclic scheduling problem ignoring resource constraints is first considered and a so-called legal retiming of the operations is issued. Second, a standard acyclic problem, taking this retiming as input, is solved through list scheduling techniques. In this paper, we propose an hybrid approach, which uses the decomposed software pipeling method to obtain a good retiming. Then the obtained retiming is used to build an Integer Linear Programming formulation of reduced size, which allows to solve it exactly. Experimental results show that a lot more problems are solved with this new approach. The gap to the optimal solution is really small (0 or 1%) on all the tested problem instances.

show abstract