Memory management optimization problems for integrated circuit simulators

Bossart, Timothée; Kordon, Alix Munier; Sourd, Francis

doi:10.1016/j.dam.2007.03.019

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2022

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scope of this paper is the criterion directed sumcut (DSC), which is a generalization to directed graphs of the criterion sumcut [7]. It was proven in [1] that DSC models the sum of variable lifespans for a program. It is defined in the following way: for any order ϕ, the cost of a vertex u ∈ V is C(ϕ, u) = max…”

Section: Introductionmentioning

confidence: 99%

A polynomial algorithm for minDSC on a subclass of series Parallel graphs

2009

Self Cite

View full text Add to dashboard Cite

The aim of this paper is to show a polynomial algorithm for the problem minimum directed sumcut for a class of series parallel digraphs. The method uses the recursive structure of parallel compositions in order to define a dominating set of orders. Then, the optimal order is easily reached by minimizing the directed sumcut. It is also shown that this approach cannot be applied in two more general classes of series parallel digraphs.

show abstract

Section: Introductionmentioning

confidence: 99%