6533b828fe1ef96bd12884a4
RESEARCH PRODUCT
Fully Dynamic Evaluation of Sequence Pair
A. Koziksubject
SequenceTheoretical computer scienceSequential logicDynamic problemComputer scienceElectrical and Electronic EngineeringRepresentation (mathematics)Data structureComputer Graphics and Computer-Aided DesignAlgorithmSoftwareField (computer science)Floorplandescription
In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracted a lot of research. In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights. Our result is based on a new data structure for the predecessor problem, which maintains the whole history of its dynamic modifications, and the path-compression technique from the union-find problem, which efficiently support predecessor queries. Numerical experiments showed that our algorithm exhibits linear-time behavior and considerably reduces the time of SP evaluation, compared to other approaches.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2013-06-01 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |