Decomposed software pipelining for cyclic unitary RCPSP with precedence delays

Abstract : In this paper we adress a new cyclic problem: finding periodic schedules for unitary resource constrained cyclic scheduling problem. Such resource constraints are characterized by k, the number of types of functional units employed and mx the maximal number of processors of the same type. The main problem is to cope with both precedence delays and resources which make the problem N P-complete in general. A guaranteed approach, called decomposed software pipelining, has been proposed by Gasperoni and Schwiegelshohn, followed by the retiming method by Calland, Darte and Robert to solve the problem for parallel processors and ordinary precedences. We present, in this paper, an extension of this approach to resource-constrained cyclic scheduling problems with precedence delays and we provide an approximation algo- rithm. Let $\lambda$ and $\lambda_{opt}$ be respectively the period given by the algorithm and the optimal period. We establish the bound: $\lambda \leq (k+1-\frac{1}{m_x(\rho+1)})\lambda^{opt} + (1 - \frac{1}{m_x(\rho+1)})(\delta -1)$.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01286994
Contributor : Lip6 Publications <>
Submitted on : Monday, December 12, 2016 - 7:44:39 PM
Last modification on : Tuesday, November 19, 2019 - 9:30:30 AM
Long-term archiving on: Tuesday, March 28, 2017 - 12:03:42 AM

File

Benabid_Hanen.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01286994, version 1

Citation

Abir Benabid, Claire Hanen. Decomposed software pipelining for cyclic unitary RCPSP with precedence delays. Multidisciplinary International Conference on Scheduling: Theory and Applications, Aug 2009, Dublin, Ireland. ⟨hal-01286994⟩

Share

Metrics

Record views

186

Files downloads

98