{"id":"https://openalex.org/W2108937578","doi":"https://doi.org/10.1109/asap.2010.5540797","title":"An optimized NoC architecture for accelerating TSP kernels in breakpoint median problem","display_name":"An optimized NoC architecture for accelerating TSP kernels in breakpoint median problem","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2108937578","doi":"https://doi.org/10.1109/asap.2010.5540797","mag":"2108937578"},"language":"en","primary_location":{"id":"doi:10.1109/asap.2010.5540797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2010.5540797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","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/A5090245094","display_name":"Turbo Majumder","orcid":null},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Turbo Majumder","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Washington State University, USA","School of Electrical Engineering and Computer Science, Washington State University. USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University. USA","institution_ids":["https://openalex.org/I72951846"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108695167","display_name":"Souradip Sarkar","orcid":null},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Souradip Sarkar","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Washington State University, USA","School of Electrical Engineering and Computer Science, Washington State University. USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University. USA","institution_ids":["https://openalex.org/I72951846"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078441163","display_name":"Partha Pratim Pande","orcid":"https://orcid.org/0000-0002-5930-8531"},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Partha Pande","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Washington State University, USA","School of Electrical Engineering and Computer Science, Washington State University. USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University. USA","institution_ids":["https://openalex.org/I72951846"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103010775","display_name":"Ananth Kalyanaraman","orcid":"https://orcid.org/0000-0003-3495-2264"},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananth Kalyanaraman","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Washington State University, USA","School of Electrical Engineering and Computer Science, Washington State University. USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Washington State University. USA","institution_ids":["https://openalex.org/I72951846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090245094"],"corresponding_institution_ids":["https://openalex.org/I72951846"],"apc_list":null,"apc_paid":null,"fwci":0.3794,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69618909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"840","issue":null,"first_page":"89","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9876999855041504,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9348000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6562431454658508},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5680204033851624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5641371607780457},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5365410447120667},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5360245108604431},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5252693891525269},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44557806849479675},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4141797423362732},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3956200182437897},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3809521496295929},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37367361783981323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3566558361053467},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3534022569656372},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3093677759170532}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6562431454658508},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5680204033851624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5641371607780457},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5365410447120667},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5360245108604431},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5252693891525269},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44557806849479675},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4141797423362732},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3956200182437897},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3809521496295929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37367361783981323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3566558361053467},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3534022569656372},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3093677759170532}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/asap.2010.5540797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2010.5540797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.667.1259","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.667.1259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.wsu.edu/%7Epande/Conference_Papers/ASAP_2010_2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W58064406","https://openalex.org/W152315924","https://openalex.org/W249091067","https://openalex.org/W307896644","https://openalex.org/W1518752166","https://openalex.org/W1717440967","https://openalex.org/W1972385709","https://openalex.org/W1972654269","https://openalex.org/W2006054213","https://openalex.org/W2037455079","https://openalex.org/W2042986967","https://openalex.org/W2101988600","https://openalex.org/W2102076751","https://openalex.org/W2106776401","https://openalex.org/W2137587811","https://openalex.org/W2158847865","https://openalex.org/W2462270720","https://openalex.org/W3118260104","https://openalex.org/W4302445777","https://openalex.org/W6845193463"],"related_works":["https://openalex.org/W1481078225","https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2078477160","https://openalex.org/W2392203420","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2604585036"],"abstract_inverted_index":{"Traveling":[0],"Salesman":[1],"Problem":[2],"(TSP)":[3],"is":[4,33,47,99,156],"a":[5,16,43,103,129],"classical":[6],"NP-complete":[7],"problem":[8],"in":[9,34,70],"graph":[10],"theory.":[11],"It":[12],"aims":[13],"at":[14],"finding":[15],"least-cost":[17],"Hamiltonian":[18],"cycle":[19],"that":[20,51,109,153],"traverses":[21],"all":[22],"vertices":[23],"of":[24,31,82,93,124],"an":[25,71],"input":[26],"edge-weighted":[27],"graph.":[28],"One":[29],"application":[30,161],"TSP":[32,76,98],"breakpoint":[35],"median-based":[36],"Maximum":[37],"Parsimony":[38],"phylogenetic":[39],"tree":[40],"reconstruction,":[41],"wherein":[42],"bounded":[44],"edge-weight":[45],"model":[46],"used.":[48,65],"Exponential":[49],"algorithms":[50],"apply":[52],"efficient":[53,87],"heuristics,":[54],"such":[55],"as":[56],"branch-and-bound,":[57],"to":[58],"dynamically":[59],"prune":[60],"the":[61,83,94,111,120,125,154],"search":[62],"space":[63],"are":[64],"We":[66],"adopted":[67],"this":[68,116,160],"approach":[69],"NoC-based":[72],"implementation":[73,123],"for":[74,97,101,159],"solving":[75],"targeted":[77],"towards":[78],"phylogenetics":[79],"taking":[80],"advantage":[81],"fine-grained":[84],"parallelism":[85],"and":[86,122,136,148,151],"communication":[88],"network.":[89],"The":[90],"largest":[91],"fraction":[92],"solution":[95],"time":[96],"accounted":[100],"by":[102],"particular":[104],"lower":[105,132],"bound":[106,133],"calculation":[107],"operation":[108],"uses":[110],"graph's":[112],"adjacency":[113],"matrix.":[114],"In":[115],"paper,":[117],"we":[118,141],"present":[119],"design":[121],"processing":[126],"elements":[127],"with":[128],"highly":[130],"optimized":[131],"computation":[134],"kernel":[135],"evaluate":[137],"its":[138],"performance.":[139],"Additionally,":[140],"explore":[142],"two":[143],"major":[144],"NoC":[145],"architectures":[146],"-mesh":[147],"quad-tree":[149],"-":[150],"show":[152],"latter":[155],"more":[157],"suitable":[158],"domain.":[162]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}