A study of the cyclic scheduling problem on parallel processors

Hanen, Claire; Munier, Alix

doi:10.1016/0166-218x(94)00102-j

Cited by 47 publications

(60 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This system defines the classical periodic scheduling problem with only precedence constraints: it is feasible if and only if p ≥ M EP (Hanen and Munier, 1995). Assuming that σ ∈ Z simplifies the writing of the dual problem of P since we can now have a dual problem with equalities instead of inequalities.…”

Section: Network Flow Formulation Of Siralinamentioning

confidence: 99%

“…Our tasks model is similar to (Hanen and Munier, 1995). We consider a set of l generic tasks (instructions inside a program loop) T 0 , .…”

Section: Tasks Modelmentioning

confidence: 99%

“…Computing M EP of a cyclic graph is a well known polynomial problem (Hanen and Munier, 1995;Lawler, 1972): since a DDG is computed by a dataflow analysis method, ı.e. by the compiler, and since a DDG represents data dependences between the instructions of a program, the value of M EP always exists and is of positive value.…”

Section: Tasks Modelmentioning

confidence: 99%

See 2 more Smart Citations

SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling

2010

View full text Add to dashboard Cite

Abstract. In this paper, we study the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in (Touati and Eisenbeis, 2004) a theoretical framework that allows an optimal optimisation of periodic storage requirement in a cyclic schedule. Since our optimization problem is NP-hard (Touati, 2002), solving an exact integer linear programming formulation is too expensive in practice. In this article, we propose an efficient two-steps heuristic using model's properties that allows fast computation times while providing highly satisfactory results. This method includes the solution of an integer linear program with a totally unimodular constraints matrix in first step, then the solution of a linear assignment problem. Our heuristic is implemented for an industrial compiler for embedded VLIW processors.

show abstract

Section: Network Flow Formulation Of Siralinamentioning

confidence: 99%

“…Our tasks model is similar to (Hanen and Munier, 1995). We consider a set of l generic tasks (instructions inside a program loop) T 0 , .…”

Section: Tasks Modelmentioning

confidence: 99%

See 1 more Smart Citation

SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling

2010

View full text Add to dashboard Cite

show abstract

“…This table presents the results for the minimal period of each benchmark. Note that every benchmark has its own minimal period, defined as the critical circuit of the DDG, which is inherent to the data dependences [2]. The first column represents the name of the benchmarks.…”

Section: Heuristicsmentioning

confidence: 99%

“…Our task model is similar to [2]. We consider a set of l generic tasks (instructions inside a program loop) T 0 , .…”

Section: Tasks Modelmentioning

confidence: 99%

Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

Deschinkel

Touati

Combinatorial Optimization and Applications

View full text Add to dashboard Cite

Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [8] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optimise processor register usage in embedded systems. Our storage optimisation problem being NP-complete [7], solving an exact integer linear programming formulation as proposed in [8] is too expensive in practice. In this article, we give an efficient approximate model that allows fast resolution times while providing nearly optimal results. Our solution has been implemented and included inside a compiler for embedded processors.

show abstract

On scheduling cycle shops: classification, complexity and approximation

Middendorf

Timkovsky

2002

J. Sched.

View full text Add to dashboard Cite

SUMMARYThis paper considers problems of ÿnding non-periodic and periodic schedules in a cycle shop which is a special case of a job shop but an extension of a ow shop. The cycle shop means the machine environment where all jobs have to pass the machines over the same route like in a ow shop but some of the machines in the route can be met more than once. We propose a classiÿcation of cycle shops and show that recently studied reentrant ow shops, robotic ow shops, loop reentrant ow shops and V shops are special cases of cycle shops. Problems solvable in polynomial time, pseudopolynomial time, NP-hard problems and performance guarantee approximations are presented. Related earlier results are surveyed.

show abstract

A study of the cyclic scheduling problem on parallel processors

Cited by 47 publications

References 7 publications

SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling

SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling

Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

On scheduling cycle shops: classification, complexity and approximation

Contact Info

Product

Resources

About