ParaLarPD: Parallel FPGA Router Using Primal-Dual Sub-Gradient Method

In the field programmable gate array (FPGA) design flow, one of the most time-consuming steps is the routing of nets. Therefore, there is a need to accelerate it. In a recent work by Hoo et al., the authors have developed a linear programming (LP)-based framework that parallelizes this routing proce...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Electronics (Basel) Ročník 8; číslo 12; s. 1439
Hlavní autoři:	Agrawal, Rohit, Ahuja, Kapil, Hau Hoo, Chin, Duy Anh Nguyen, Tuan, Kumar, Akash
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Basel MDPI AG 01.12.2019
Témata:	Algorithms Critical path Experiments Field programmable gate arrays Iterative algorithms Linear programming Optimization Parallel processing Transistors Wire drawing
ISSN:	2079-9292, 2079-9292
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In the field programmable gate array (FPGA) design flow, one of the most time-consuming steps is the routing of nets. Therefore, there is a need to accelerate it. In a recent work by Hoo et al., the authors have developed a linear programming (LP)-based framework that parallelizes this routing process to achieve significant speed-ups (the resulting algorithm is termed as ParaLaR). However, this approach has certain weaknesses. Namely, the constraints violation by the solution and a standard routing metric could be improved. We address these two issues here. In this paper, we use the LP framework of ParaLaR and solve it using the primal–dual sub-gradient method that better exploits the problem properties. We also propose a better way to update the size of the step taken by this iterative algorithm. We call our algorithm as ParaLarPD. We perform experiments on a set of standard benchmarks, where we show that our algorithm outperforms not just ParaLaR but the standard existing algorithm VPR as well. We perform experiments with two different configurations. We achieve 20 % average improvement in the constraints violation and the standard metric of the minimum channel width (both of which are related) when compared with ParaLaR. When compared to VPR, we get average improvements of 28 % in the minimum channel width (there is no constraints violation in VPR). We obtain the same value for the total wire length as by ParaLaR, which is 49 % better on an average than that obtained by VPR. This is the original metric to be minimized, for which ParaLaR was proposed. Next, we look at the third and easily measurable metric of critical path delay. On an average, ParaLarPD gives 2 % larger critical path delay than ParaLaR and 3 % better than VPR. We achieve maximum relative speed-ups of up to seven times when running a parallel version of our algorithm using eight threads as compared to the sequential implementation. These speed-ups are similar to those as obtained by ParaLaR.
AbstractList	In the field programmable gate array (FPGA) design flow, one of the most time-consuming steps is the routing of nets. Therefore, there is a need to accelerate it. In a recent work by Hoo et al., the authors have developed a linear programming (LP)-based framework that parallelizes this routing process to achieve significant speed-ups (the resulting algorithm is termed as ParaLaR). However, this approach has certain weaknesses. Namely, the constraints violation by the solution and a standard routing metric could be improved. We address these two issues here. In this paper, we use the LP framework of ParaLaR and solve it using the primal–dual sub-gradient method that better exploits the problem properties. We also propose a better way to update the size of the step taken by this iterative algorithm. We call our algorithm as ParaLarPD. We perform experiments on a set of standard benchmarks, where we show that our algorithm outperforms not just ParaLaR but the standard existing algorithm VPR as well. We perform experiments with two different configurations. We achieve 20 % average improvement in the constraints violation and the standard metric of the minimum channel width (both of which are related) when compared with ParaLaR. When compared to VPR, we get average improvements of 28 % in the minimum channel width (there is no constraints violation in VPR). We obtain the same value for the total wire length as by ParaLaR, which is 49 % better on an average than that obtained by VPR. This is the original metric to be minimized, for which ParaLaR was proposed. Next, we look at the third and easily measurable metric of critical path delay. On an average, ParaLarPD gives 2 % larger critical path delay than ParaLaR and 3 % better than VPR. We achieve maximum relative speed-ups of up to seven times when running a parallel version of our algorithm using eight threads as compared to the sequential implementation. These speed-ups are similar to those as obtained by ParaLaR.
Author	Hau Hoo, Chin Kumar, Akash Ahuja, Kapil Agrawal, Rohit Duy Anh Nguyen, Tuan
Author_xml	– sequence: 1 givenname: Rohit orcidid: 0000-0001-7731-2078 surname: Agrawal fullname: Agrawal, Rohit – sequence: 2 givenname: Kapil orcidid: 0000-0001-9640-4437 surname: Ahuja fullname: Ahuja, Kapil – sequence: 3 givenname: Chin surname: Hau Hoo fullname: Hau Hoo, Chin – sequence: 4 givenname: Tuan orcidid: 0000-0002-5108-4684 surname: Duy Anh Nguyen fullname: Duy Anh Nguyen, Tuan – sequence: 5 givenname: Akash orcidid: 0000-0001-7125-1737 surname: Kumar fullname: Kumar, Akash
BookMark	eNp9kEtPwzAQhC1UJErpH-AUiXPAr7Q2t6ovkIqIgJ4jx96AKxMX2znw70lVDggk9rJzmG93NOdo0PoWELok-JoxiW_AgU7Bt1ZHQSjhTJ6gIcVTmUsq6eCHPkPjGHe4H0mYYHiIlqUKaqNCubjNDtI5cNmqXM-yJ98lCNk22vY1K4N9Vy5fdMplz12dr4MyFtqUPUB68-YCnTbKRRh_7xHarpYv87t887i-n882uWZEphzopJF1gUHRWgpJ6cRMGAGii2nDpSZME6MaDEZpYTjn2gjDCiiUmaqiqBs2QlfHu_vgPzqIqdr5LrT9y4oWXHAuOWe9ix5dOvgYAzTV_hA_fFYEV4fGqr-N9ZD4BWmbVLK-TUFZ9x_6BcJHdhY
CitedBy_id	crossref_primary_10_3390_app10155115 crossref_primary_10_1002_cnm_3642 crossref_primary_10_1109_TPDS_2020_3035787 crossref_primary_10_3233_JIFS_201296 crossref_primary_10_1049_ipr2_12161 crossref_primary_10_1109_ACCESS_2023_3328769
Cites_doi	10.1016/j.ejor.2007.04.029 10.3390/electronics7010003 10.1051/ro/2013050 10.1145/362946.362974 10.1287/ijoc.6.1.1 10.1007/BFb0120695 10.1109/FPL.2018.00011 10.3390/electronics7100246 10.1109/FPGA.1995.242049 10.3390/electronics8080866 10.1109/TCAD.2011.2165715 10.3390/electronics8090950 10.3233/IFS-130804 10.1007/3-540-63465-7_226 10.1007/3-540-46117-5_28 10.1287/mnsc.27.1.1
ContentType	Journal Article
Copyright	2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION 7SP 8FD 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L7M P5Z P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS
DOI	10.3390/electronics8121439
DatabaseName	CrossRef Electronics & Communications Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China
DatabaseTitle	CrossRef Publicly Available Content Database Advanced Technologies & Aerospace Collection Technology Collection Technology Research Database ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition Electronics & Communications Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic Advanced Technologies Database with Aerospace ProQuest One Academic (New)
DatabaseTitleList	CrossRef Publicly Available Content Database
Database_xml	– sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2079-9292
ExternalDocumentID	10_3390_electronics8121439
GroupedDBID	5VS 8FE 8FG AAYXX ADMLS AFFHD AFKRA ALMA_UNASSIGNED_HOLDINGS ARAPS BENPR BGLVJ CCPQU CITATION HCIFZ IAO KQ8 MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PQGLB PROAC 7SP 8FD ABUWG AZQEC DWQXO L7M PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c319t-e26f9b50ea2b989226d631e1c57f49c13c1daf0edac8d444cd8d35e5ad7a55bf3
IEDL.DBID	P5Z
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000506678200066&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2079-9292
IngestDate	Sun Nov 30 04:00:10 EST 2025 Sat Nov 29 07:11:44 EST 2025 Tue Nov 18 21:50:06 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	12
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-e26f9b50ea2b989226d631e1c57f49c13c1daf0edac8d444cd8d35e5ad7a55bf3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-7731-2078 0000-0001-7125-1737 0000-0001-9640-4437 0000-0002-5108-4684
OpenAccessLink	https://www.proquest.com/docview/2548449443?pq-origsite=%requestingapplication%
PQID	2548449443
PQPubID	2032404
ParticipantIDs	proquest_journals_2548449443 crossref_primary_10_3390_electronics8121439 crossref_citationtrail_10_3390_electronics8121439
PublicationCentury	2000
PublicationDate	2019-12-01
PublicationDateYYYYMMDD	2019-12-01
PublicationDate_xml	– month: 12 year: 2019 text: 2019-12-01 day: 01
PublicationDecade	2010
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Electronics (Basel)
PublicationYear	2019
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Ali (ref_10) 2014; 26 Gort (ref_5) 2012; 31 ref_14 Bartels (ref_8) 1969; 12 ref_13 ref_24 ref_12 ref_23 Fisher (ref_11) 1981; 27 ref_22 Lustig (ref_18) 1994; 6 ref_21 ref_20 Holmberg (ref_15) 2008; 188 ref_1 Hashemi (ref_9) 2006; 17 Deleplanque (ref_16) 2013; 47 ref_3 ref_19 ref_17 Jiang (ref_2) 2019; 8 ref_4 ref_7 ref_6
References_xml	– volume: 188 start-page: 101 year: 2008 ident: ref_15 article-title: Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.04.029 – ident: ref_17 doi: 10.3390/electronics7010003 – ident: ref_6 – volume: 47 start-page: 429 year: 2013 ident: ref_16 article-title: Lagrangean heuristic for a multi-plant lot-sizing problem with transfer and storage capacities publication-title: RAIRO-Oper. Res. doi: 10.1051/ro/2013050 – ident: ref_24 – volume: 12 start-page: 266 year: 1969 ident: ref_8 article-title: The Simplex method of linear programming using LU decomposition publication-title: Commun. ACM doi: 10.1145/362946.362974 – volume: 6 start-page: 1 year: 1994 ident: ref_18 article-title: Interior point methods for linear programming: Computational state of the art publication-title: ORSA J. Comput. doi: 10.1287/ijoc.6.1.1 – ident: ref_20 doi: 10.1007/BFb0120695 – ident: ref_23 doi: 10.1109/FPL.2018.00011 – ident: ref_1 doi: 10.3390/electronics7100246 – ident: ref_13 – ident: ref_3 doi: 10.1109/FPGA.1995.242049 – ident: ref_7 doi: 10.3390/electronics8080866 – ident: ref_14 – volume: 31 start-page: 61 year: 2012 ident: ref_5 article-title: Accelerating FPGA routing through parallelization and engineering enhancements special section on PAR-CAD 2010 publication-title: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. doi: 10.1109/TCAD.2011.2165715 – ident: ref_19 – ident: ref_22 – volume: 8 start-page: 950 year: 2019 ident: ref_2 article-title: Design and Implementation of CPU & FPGA Co-Design Tester for SDN Switches publication-title: Electronics doi: 10.3390/electronics8090950 – volume: 17 start-page: 253 year: 2006 ident: ref_9 article-title: Fully fuzzified linear programming, solution and duality publication-title: J. Intell. Fuzzy Syst. – ident: ref_21 – volume: 26 start-page: 1179 year: 2014 ident: ref_10 article-title: Linear programming with rough interval coefficients publication-title: J. Intell. Fuzzy Syst. doi: 10.3233/IFS-130804 – ident: ref_12 doi: 10.1007/3-540-63465-7_226 – ident: ref_4 doi: 10.1007/3-540-46117-5_28 – volume: 27 start-page: 1 year: 1981 ident: ref_11 article-title: The Lagrangian relaxation method for solving integer programming problems publication-title: Manag. Sci. doi: 10.1287/mnsc.27.1.1
SSID	ssj0000913830
Score	2.194048
Snippet	In the field programmable gate array (FPGA) design flow, one of the most time-consuming steps is the routing of nets. Therefore, there is a need to accelerate...
SourceID	proquest crossref
SourceType	Aggregation Database Enrichment Source Index Database
StartPage	1439
SubjectTerms	Algorithms Critical path Experiments Field programmable gate arrays Iterative algorithms Linear programming Optimization Parallel processing Transistors Wire drawing
Title	ParaLarPD: Parallel FPGA Router Using Primal-Dual Sub-Gradient Method
URI	https://www.proquest.com/docview/2548449443
Volume	8
WOSCitedRecordID	wos000506678200066&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center) customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: M~E dateStart: 20120101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: P5Z dateStart: 20120301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central Database Suite (ProQuest) customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: BENPR dateStart: 20120301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: PIMPY dateStart: 20120301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LS8MwGP9Q50EPvsX5GD14k7C2SdbEi6h7KLgRRGF6KWmSglC22U2P_u0mbecUwYu30iah9Mv3zNffD-CUJ4zyJEiRUb5CRBtsdS6lyE-TQKchTwkvySaiwYANh1xUBbdp1VY5t4mFodZj5WrkTZvIMEI4Ifhi8ooca5Q7Xa0oNJah5lASHHWDoM9fNRaHecmwX_4rg21231xwy0ytZ7OxAv_pj36a48LHdDf_-3ZbsFFFl95luR22YcmMdmD9G-bgLnSEzOWdzEX73HOXWWYyryt6l55rDjK5VzQReMKhUGSo_WaXs8YF9fKiN2zm9QvK6T147HYerm9QxaWAlFWyGTJhK-UJ9Y0ME864Dbp0CwcmUDSy4lABVoGWqW-0VEwTQpRmGlNDpY4kpUmK92FlNB6ZA_C4oX5i1-NYaqKIlDQkzFeRUbIV6ZDVIZh_0VhVQOOO7yKLbcLhpBD_lkIdzr7mTEqYjT9HH8-lEFcqN40XIjj8-_ERrNmoh5c9KcewMsvfzAmsqvfZyzRvQO2qMxD3DVjuf3QaxX6y98RtXzx9AqBR11Y
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4tu5WAA9CWimfxoT0hiyS2NzYSqlbdXVjtQzmARE-pYztSpWgXsguIP8VvxM6DLarEjUNvkZKMknxfZsb2eD6AbyLhTCR-io3yFKbaEPvPpQx7aeLrNBApFaXYRDiZ8OtrETXgqd4L48oqa59YOGo9U26O_MQOZDilglLy4-YWO9Uot7paS2iUtBiaxwc7ZJufDboW3-9B0O9d_rzAlaoAVpZuC2yCdioS5hkZJIILm37oNvGNr1hoH0z5RPlapp7RUnFNKVWaa8IMkzqUjCUpsXZXoEUd2ZvQigbj6NfLrI7rssmJV-7OIUR4J0s1m7mNpTY7Ea8j4OsAUES1_ub_9j22YKPKn1GnJPxHaJjpJ1j_q6viZ-hFMpcjmUfdU-QOs8xkqB-dd5ArfzI5KsokUOT6bGS4e2fNWfeJz_Oi-m2BxoWo9jZcvct7fIHmdDY1O4CEYV5i7QkiNVVUShZQ7qnQKNkOdcB3wa8RjFXVSt0pemSxHVI51ON_Ud-F45d7bspGIm9efVCjHldOZR4vId97-_QRrF5cjkfxaDAZ7sOazfFEWYFzAM1FfmcO4YO6X_yZ518r_iL4_d4UeQZvlzPI
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bS9xAFD6stkh9sLa1eKudh_ZJhk0yM5sZQWRxXSvqkocK0pd0MhcohNVm15b-tf46z-SilYJvPvgWSHJIMt-cy-Sb8wF8UoUUqog9dSYylFvHcM55QSNfxNYnynPViE2kk4m8vFRZD_52e2ECrbLzibWjtlcmrJH3sZCRnCvOWd-3tIhsND64_kmDglT409rJaTQQOXV_fmP5Nts_GeFYf06S8dHXwy-0VRigBqE3py4ZeFWIyOmkUFJhKmIHLHaxESk-pImZia32kbPaSMs5N1ZaJpzQNtVCFJ6h3QV4kWKNGeiEmfh2t74T-m1KFjX7dBhTUf9e12aGURXzFPUwFj4MBXV8G79-zl9mFVbarJoMm2nwBnpu-haW_-m1-A6OMl3pM11loz0SDsvSlWScHQ9JIEW5itTkCZKF7hslHd2gOXSq9LiqOXFzcl5Lba_BxZO8x3tYnF5N3ToQ5URUoD3FtOWGay0SLiOTOqMHqU3kBsTdaOambbAedD7KHAutgID8fwRswO7dPddNe5FHr97uEJC3rmaW3w__5uOnP8IS4iI_O5mcbsErTPxUQ8vZhsV5deM-wEvza_5jVu3UQCbw_anxcQucLDsr
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%3Ajournal&rft.genre=article&rft.atitle=ParaLarPD%3A+Parallel+FPGA+Router+Using+Primal-Dual+Sub-Gradient+Method&rft.jtitle=Electronics+%28Basel%29&rft.au=Agrawal%2C+Rohit&rft.au=Ahuja%2C+Kapil&rft.au=Hau+Hoo%2C+Chin&rft.au=Duy+Anh+Nguyen%2C+Tuan&rft.date=2019-12-01&rft.issn=2079-9292&rft.eissn=2079-9292&rft.volume=8&rft.issue=12&rft.spage=1439&rft_id=info:doi/10.3390%2Felectronics8121439&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_electronics8121439
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2079-9292&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2079-9292&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2079-9292&client=summon