{"id":"https://openalex.org/W1599220052","doi":"https://doi.org/10.1109/iscas.2003.1206207","title":"Optimal use of 2-phase transparent latches in buffered maze routing","display_name":"Optimal use of 2-phase transparent latches in buffered maze routing","publication_year":2003,"publication_date":"2003-11-04","ids":{"openalex":"https://openalex.org/W1599220052","doi":"https://doi.org/10.1109/iscas.2003.1206207","mag":"1599220052"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2003.1206207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048817284","display_name":"Soha Hassoun","orcid":"https://orcid.org/0000-0001-9477-2199"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Hassoun","raw_affiliation_strings":["Tufts University, Medford, MA, USA","Tufts University, Medford, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Tufts University, Medford, MA, USA#TAB#","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048817284"],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":0.1749,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4411316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"IV","last_page":"688"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7073975801467896},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6780041456222534},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6271772980690002},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5700160264968872},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5638982057571411},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5077346563339233},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4604933559894562},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46018654108047485},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.45845454931259155},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4346421957015991},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38037431240081787},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2957737147808075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26031213998794556},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10486248135566711}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7073975801467896},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6780041456222534},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6271772980690002},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5700160264968872},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5638982057571411},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5077346563339233},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4604933559894562},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46018654108047485},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.45845454931259155},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4346421957015991},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38037431240081787},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2957737147808075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26031213998794556},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10486248135566711}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2003.1206207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1952815481","https://openalex.org/W2010617132","https://openalex.org/W2101987243","https://openalex.org/W2129943737","https://openalex.org/W2131766808","https://openalex.org/W2180470884","https://openalex.org/W4236709666","https://openalex.org/W4242083815","https://openalex.org/W6679389458"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W1997091564","https://openalex.org/W2068473861","https://openalex.org/W3127002380","https://openalex.org/W2369989480","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"Clocking":[0],"frequencies":[1],"continue":[2],"to":[3,6,24],"increase":[4],"due":[5],"the":[7,14,41,61,79],"demand":[8],"for":[9],"higher":[10],"performance.":[11],"Together":[12],"with":[13],"larger":[15],"die":[16],"sizes,":[17],"multiple":[18,52],"clock":[19,53],"cycles":[20,54],"are":[21],"now":[22],"required":[23],"cross":[25],"a":[26,72],"chip.":[27],"A":[28],"routing":[29,64,74],"tool":[30],"must":[31],"thus":[32],"insert":[33],"registers":[34],"as":[35,37],"well":[36],"buffers":[38],"while":[39],"minimizing":[40],"path":[42,49],"latency.":[43],"This":[44],"paper":[45],"addresses":[46],"optimal":[47],"buffered":[48],"construction":[50],"across":[51],"using":[55,65],"2-phase":[56],"transparent":[57],"latches.":[58],"We":[59],"demonstrate":[60],"benefits":[62],"of":[63,81],"latches":[66],"over":[67],"registers,":[68],"and":[69],"we":[70],"present":[71],"polynomial":[73],"algorithm.":[75,83],"Our":[76],"results":[77],"confirm":[78],"correctness":[80],"our":[82]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}