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,...
Uložené v:
| Vydané v: | 10th International Symposium on Hardware/Software Codesign s. 127 - 132 |
|---|---|
| Hlavný autor: | |
| 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: | |
| ISBN: | 1581135424, 9781581135428 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Dasdan, Ali |
| Author_xml | – sequence: 1 givenname: Ali surname: Dasdan fullname: Dasdan, Ali organization: Synopsys, Inc., Mountain View, CA |
| BookMark | eNqFkDtPwzAUhS0BErR0ZGLJxEQg16_EY1XxkiqxwGw56XUxOHaxU6T-e4KCxMhdzvB9Olc6M3IcYkBCLqC6AeDitq553aibMRqQR2QGogFgglN-ShY5v1fjccEVsDOyWhZ5SDFs_aHYRX8IsXfGl4PrsTB-G5Mb3vrCxlTEL0xlF8OoGxeGImGOfj-4GM7JiTU-4-I35-T1_u5l9Viunx-eVst1aQCUKFUFG94Kqizn1jamrS1XG2uV4JxXjDZSWbmxG4lGGeiMRE7rmirJJMVGUTYnV1PvLsXPPeZB9y536L0JGPdZMxCKNkyM4uUkOkTUu-R6kw4aqopJYCO9nqjpet3G-JFHpH-W09NyelpOt8mh_fv6j86-AXYzb14 |
| ContentType | Conference Proceeding |
| Copyright | 2002 ACM |
| Copyright_xml | – notice: 2002 ACM |
| DBID | 6IE 6IL CBEJK RIE RIL 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/774789.774816 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EndPage | 132 |
| ExternalDocumentID | 1003613 |
| Genre | orig-research Conference Paper |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE OCL RIB RIC RIE RIL AAWTH LHSKQ 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-a1195-901d4b529f44ff8ab7f49dff95444032869f6dfd6ea9a1ca6e4277296362e8923 |
| IEDL.DBID | RIE |
| ISBN | 1581135424 9781581135428 |
| IngestDate | Thu Jul 10 17:28:09 EDT 2025 Wed Aug 27 02:15:50 EDT 2025 Wed Jan 31 06:43:48 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | behavioral synthesis scheduling high-level synthesis constraint satisfaction timing constraints rate analysis |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | CODES02: 10th International Symposium on Hardware/Software Codesign |
| MergedId | FETCHMERGED-LOGICAL-a1195-901d4b529f44ff8ab7f49dff95444032869f6dfd6ea9a1ca6e4277296362e8923 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31592835 |
| PQPubID | 23500 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_774789_774816_brief acm_books_10_1145_774789_774816 proquest_miscellaneous_31592835 ieee_primary_1003613 |
| PublicationCentury | 2000 |
| PublicationDate | 20020506 20020000 20020501 |
| PublicationDateYYYYMMDD | 2002-05-06 2002-01-01 2002-05-01 |
| PublicationDate_xml | – month: 05 year: 2002 text: 20020506 day: 06 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | 10th International Symposium on Hardware/Software Codesign |
| PublicationTitleAbbrev | CODES |
| PublicationYear | 2002 |
| Publisher | ACM IEEE |
| Publisher_xml | – name: ACM – name: IEEE |
| SSID | ssj0000454913 |
| Score | 1.3045602 |
| Snippet | 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... |
| SourceID | proquest ieee acm |
| SourceType | Aggregation Database Publisher |
| StartPage | 127 |
| SubjectTerms | 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 |
| Subtitle | efficient debugging of timing constraint violations |
| Title | A strongly polynomial-time algorithm for over-constraint resolution |
| URI | https://ieeexplore.ieee.org/document/1003613 https://www.proquest.com/docview/31592835 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9uePCkMsX5mYPe7Fxr0jReRfEgQ_CD3ULavszBXMfWCv73vpd2U1AQT20hIeXl6_de8n4_xk7BKpAKdJA5GQdCahdY9ISCGHBEJzlktTbgy70aDJLhUD-ssfNVLgwA-Mtn0KNXf5afF1lFoTKc4bjekkRtSylV52qt4ilEJae9jGAokzC8lCISDaXT8jtZcmwKeaGIN1738JGQ1HnLZm-NvsqPRdnvNLeb__vHLbbzlbLHH1ab0TZbg2mHvT9SoHs0-eCzYvJBCch2EpCaPLeTUTEfl69vHEErp2ucQUZIkQQjSo4ueDMirzh4jglsk-eQVhSfHvHC8ZLUwEb8WyU64q_Dfzvs-fbm6fouaIQWAht6rcZ-mItURtoJ4VxiU-WEzp3TUghBhHuxdnHu8histmFmYxARofIYdz9IECLusva0mMIe46lSzoo-hBaxIEIrDX1wEXrgGURJKtIuO0FTG_IgFqZOipam7gxTd0aXnf1RwqTzMbgu65D1zaxm5TCN4bGBZfcZnCl0_GGnUFQLc4nIjdjl9n-veMA2vNKLD68csnY5r-CIrWfv5XgxP_aD7ROwINA8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA7zAvqk4sR5Wx70zepak7bxVZSJcwy8sLeQtidzMFfZOsF_7zlpNwUF8aktJKSc3L5zkvN9jB2DiUBGoLzUytATUlnPoCfkhYAjOs4gLbUBnztRtxv3-6pXY6eLXBgAcJfP4Ixe3Vl-lqczCpXhDMf1liRqV6QQgV9may0iKkQmp5yQoC9j37-QIhAVqdP8O56zbAp5HhFzvDrDR0xi50smfa0UVn4sy26vudn4319usvpX0h7vLbajLVaD8TZ7f6BQ92D0wd_y0QelIJuRR3ry3IwG-WRYvLxyhK2cLnJ6KWFFkowoODrh1Zi85OBYJrBNnkEyowj1gOeWF6QHNuDfKtEhfxkArLOnm-vHq7ZXSS14xndqjS0_E4kMlBXC2tgkkRUqs1ahoQVR7oXKhpnNQjDK-KkJQQSEy0Pc_yBGkLjDlsf5GHYZT6LIGtEC3yAaRHCloAU2QB88hSBORNJgTTS1Jh9iqsu0aKnLztBlZzTYyR8ldDIZgm2wbbK-fit5OXRleGxg3n0a5wodgJgx5LOpvkDsRvxye79XbLK19uN9R3duu3f7bN3pvrhgywFbLiYzOGSr6XsxnE6O3MD7BK_w04M |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=10th+International+Symposium+on+Hardware%2FSoftware+Codesign&rft.atitle=Strongly+polynomial-time+algorithm+for+over-constraint+resolution%3A+efficient+debugging+of+timing+constraint+violations&rft.au=Dasdan%2C+A.&rft.date=2002-01-01&rft.pub=IEEE&rft.isbn=9781581135428&rft.spage=127&rft.epage=132&rft_id=info:doi/10.1145%2F774789.774816&rft.externalDocID=1003613 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581135428/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581135428/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581135428/sc.gif&client=summon&freeimage=true |