{"id":"https://openalex.org/W4232675554","doi":"https://doi.org/10.1109/isca.2014.6853226","title":"Race Logic: A hardware acceleration for dynamic programming algorithms","display_name":"Race Logic: A hardware acceleration for dynamic programming algorithms","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W4232675554","doi":"https://doi.org/10.1109/isca.2014.6853226"},"language":"en","primary_location":{"id":"doi:10.1109/isca.2014.6853226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isca.2014.6853226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA)","raw_type":"proceedings-article"},"type":"article","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/A5038802680","display_name":"Advait Madhavan","orcid":"https://orcid.org/0000-0002-4121-1336"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Advait Madhavan","raw_affiliation_strings":["University of California, Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036932071","display_name":"Timothy Sherwood","orcid":"https://orcid.org/0000-0002-6550-6075"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timothy Sherwood","raw_affiliation_strings":["University of California, Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035468831","display_name":"Dmitri B. Strukov","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dmitri Strukov","raw_affiliation_strings":["University of California, Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6388,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.76114947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"517","last_page":"528"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9993000030517578,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7109253406524658},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.5598787665367126},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.5598238110542297},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.5431761145591736},{"id":"https://openalex.org/keywords/logic-optimization","display_name":"Logic optimization","score":0.5257309675216675},{"id":"https://openalex.org/keywords/register-transfer-level","display_name":"Register-transfer level","score":0.5222902297973633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5082123279571533},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5051160454750061},{"id":"https://openalex.org/keywords/logic-family","display_name":"Logic family","score":0.4559295177459717},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.45420026779174805},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41476690769195557},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3497936427593231},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.18484970927238464}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7109253406524658},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.5598787665367126},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.5598238110542297},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.5431761145591736},{"id":"https://openalex.org/C28449271","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Logic optimization","level":4,"score":0.5257309675216675},{"id":"https://openalex.org/C34854456","wikidata":"https://www.wikidata.org/wiki/Q1484552","display_name":"Register-transfer level","level":4,"score":0.5222902297973633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5082123279571533},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5051160454750061},{"id":"https://openalex.org/C162454741","wikidata":"https://www.wikidata.org/wiki/Q173359","display_name":"Logic family","level":4,"score":0.4559295177459717},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.45420026779174805},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41476690769195557},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3497936427593231},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.18484970927238464}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isca.2014.6853226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isca.2014.6853226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.433.8591","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.8591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.engineering.ucsb.edu/~sherwood/pubs/ISCA-14-racelogic.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.9100000262260437}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320311968","display_name":"Hellman Foundation","ror":"https://ror.org/02g98ya79"},{"id":"https://openalex.org/F4320319504","display_name":"Hellman Family Foundation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W639550976","https://openalex.org/W1490243132","https://openalex.org/W1501488688","https://openalex.org/W1543636183","https://openalex.org/W1562898241","https://openalex.org/W1570617259","https://openalex.org/W1573897044","https://openalex.org/W1594783879","https://openalex.org/W1966118102","https://openalex.org/W1966266398","https://openalex.org/W1998747003","https://openalex.org/W2006312753","https://openalex.org/W2006899413","https://openalex.org/W2009816583","https://openalex.org/W2018774711","https://openalex.org/W2024860775","https://openalex.org/W2036779190","https://openalex.org/W2037616057","https://openalex.org/W2074231493","https://openalex.org/W2087064593","https://openalex.org/W2114094169","https://openalex.org/W2120742511","https://openalex.org/W2139291494","https://openalex.org/W2140598222","https://openalex.org/W2143210482","https://openalex.org/W2543907405","https://openalex.org/W3144153434","https://openalex.org/W4236236547","https://openalex.org/W6651700774","https://openalex.org/W6677342510","https://openalex.org/W6681053179"],"related_works":["https://openalex.org/W2386022279","https://openalex.org/W3129977055","https://openalex.org/W659242671","https://openalex.org/W2370649629","https://openalex.org/W1488117239","https://openalex.org/W4236027727","https://openalex.org/W4387767018","https://openalex.org/W4243936066","https://openalex.org/W2356140560","https://openalex.org/W2356714888"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,28,132,167],"novel":[3,84],"computing":[4],"approach,":[5],"dubbed":[6],"\u201cRace":[7],"Logic\u201d,":[8],"in":[9,22,75,114],"which":[10,111],"information,":[11],"instead":[12],"of":[13,46,55,69,82,102,131],"being":[14],"represented":[15,26],"as":[16,19,27],"logic":[17],"levels,":[18],"is":[20,25,59,86,156,185],"done":[21],"conventional":[23,144],"logic,":[24],"timing":[29],"delay.":[30],"Under":[31],"this":[32,83,123],"new":[33],"information":[34,88],"representation,":[35],"computations":[36],"can":[37,94],"be":[38,95],"performed":[39],"by":[40],"observing":[41],"the":[42,50,53,67,100,103,142,174,177],"relative":[43],"propagation":[44],"times":[45],"signals":[47],"injected":[48],"into":[49],"circuit":[51,183],"(i.e.":[52],"outcome":[54],"races).":[56],"Race":[57,128,154],"Logic":[58,129,155],"especially":[60],"suited":[61],"for":[62,179,194],"solving":[63],"problems":[64],"related":[65],"to":[66,108,141,158,166],"traversal":[68],"directed":[70],"acyclic":[71],"graphs":[72],"commonly":[73],"used":[74],"dynamic":[76],"programming":[77],"algorithms.":[78],"The":[79],"main":[80],"advantage":[81],"approach":[85],"that":[87,152],"processing":[89],"(min-max":[90],"and":[91,118,138],"addition":[92],"operations)":[93],"very":[96],"efficiently":[97],"expressed":[98],"through":[99],"manipulation":[101],"natural":[104],"delay":[105],"chaining":[106],"inherent":[107],"digital":[109],"designs,":[110],"then":[112],"results":[113],"superior":[115],"latency,":[116],"throughput,":[117],"energy":[119],"efficiency.":[120],"To":[121],"verify":[122],"hypothesis,":[124],"we":[125],"designed":[126],"several":[127],"implementations":[130],"DNA":[133,196],"global":[134],"sequence":[135,180],"alignment":[136],"engine":[137],"compared":[139],"it":[140],"state-of-the-art":[143],"systolic":[145],"array":[146],"implementation.":[147],"Our":[148],"synthesized":[149],"design":[150],"shows":[151],"synchronous":[153],"up":[157],"4\u00d7":[159],"faster":[160],"when":[161],"both":[162],"approaches":[163],"are":[164],"mapped":[165],"0.5\u03bcm":[168],"CMOS":[169],"standard":[170],"cell":[171],"technology.":[172],"At":[173],"same":[175],"time":[176],"throughput":[178],"matching":[181],"per":[182],"area":[184],"about":[186],"3\u00d7":[187],"higher":[188],"at":[189],"5\u00d7":[190],"lower":[191],"power":[192],"density":[193],"20-long-symbol":[195],"sequences.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}