A strongly polynomial-time algorithm for over-constraint resolution efficient debugging of timing constraint violations

A system of binary linear constraints or difference constraints (SDC) contains a set of variables that are constrained by a set of unary or binary linear inequalities. In such diverse applications as scheduling, interface timing verification, real-time systems, multimedia systems, layout compaction,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:10th International Symposium on Hardware/Software Codesign s. 127 - 132
Hlavný autor: Dasdan, Ali
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 06.05.2002
IEEE
Edícia:ACM Conferences
Predmet:
Compaction
Computing methodologies > Artificial intelligence > Knowledge representation and reasoning > Temporal reasoning
Debugging
High level synthesis
Lakes
Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms
Mathematics of computing > Mathematical analysis > Nonlinear equations
Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on polynomials
Multimedia systems
Performance gain
Permission
Polynomials
Real time systems
Theory of computation > Logic > Modal and temporal logics
Timing
behavioral synthesis
scheduling
high-level synthesis
constraint satisfaction
timing constraints
rate analysis
ISBN:1581135424, 9781581135428
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A system of binary linear constraints or difference constraints (SDC) contains a set of variables that are constrained by a set of unary or binary linear inequalities. In such diverse applications as scheduling, interface timing verification, real-time systems, multimedia systems, layout compaction, and constraint satisfaction, SDCs have successfully been used to model systems of both temporal and spatial constraints. Formally, SDCs are modeled by weighted, directed (constraint) graphs. The consistency of an SDC means that there is at least one instantiation of its variables that satisfies all its constraints. It is well known that the absence of positive cycles in a graph implies the consistency of the corresponding SDC, so the consistency can be decided in strongly polynomial time. If a SDC is found to be inconsistent, it has to be repaired to make it consistent. This task is equivalent to removing positive cycles from the corresponding graph. All the previous algorithms for this task take time proportional to the number of positive cycles in the graph, which can grow exponentially. In this paper, we propose a strongly polynomial-time algorithm, i.e., an algorithm whose time complexity is polynomial in the size of the graph. Our algorithm takes in a graph and returns a list of edges and the changes in their weights to remove all the positive cycles from the graph. We experimentally quantify the length of the edge list and the running time of the algorithm on large benchmark graphs. We show that both are very small, so our algorithm is practical.
Bibliografia:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1581135424
9781581135428
DOI:10.1145/774789.774816