{"id":"https://openalex.org/W2523605802","doi":"https://doi.org/10.1145/2983553","title":"Efficient parallelization using rank convergence in dynamic programming algorithms","display_name":"Efficient parallelization using rank convergence in dynamic programming algorithms","publication_year":2016,"publication_date":"2016-09-22","ids":{"openalex":"https://openalex.org/W2523605802","doi":"https://doi.org/10.1145/2983553","mag":"2523605802"},"language":"en","primary_location":{"id":"doi:10.1145/2983553","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2983553","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2983553&type=pdf","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2983553&type=pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077514991","display_name":"Saeed Maleki","orcid":"https://orcid.org/0000-0003-1107-1827"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saeed Maleki","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040009052","display_name":"Madanlal Musuvathi","orcid":"https://orcid.org/0000-0002-2482-7892"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madanlal Musuvathi","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013212213","display_name":"Todd Mytkowicz","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Todd Mytkowicz","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077514991"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":1.9199,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85554342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"59","issue":"10","first_page":"85","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9785000085830688,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7549283504486084},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6412438154220581},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5344200730323792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5084385275840759},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4665154218673706},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4498908519744873},{"id":"https://openalex.org/keywords/semiring","display_name":"Semiring","score":0.4278850555419922},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4232289493083954},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.4207790195941925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18091827630996704},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1395692527294159}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7549283504486084},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6412438154220581},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5344200730323792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5084385275840759},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4665154218673706},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4498908519744873},{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.4278850555419922},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4232289493083954},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.4207790195941925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18091827630996704},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1395692527294159},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2983553","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2983553","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2983553&type=pdf","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2983553","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2983553","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2983553&type=pdf","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1789663435","display_name":"CSR: Large: Collaborative Research: Kali:  A System for Sequential Programming of Multicore Processors","funder_award_id":"1111407","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6148989208","display_name":null,"funder_award_id":"CNS 1111407","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2523605802.pdf","grobid_xml":"https://content.openalex.org/works/W2523605802.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1530971713","https://openalex.org/W1566604942","https://openalex.org/W1967810725","https://openalex.org/W1971053555","https://openalex.org/W1991133427","https://openalex.org/W2059310886","https://openalex.org/W2063389953","https://openalex.org/W2074231493","https://openalex.org/W2081256023","https://openalex.org/W2083432626","https://openalex.org/W2087064593","https://openalex.org/W2094377471","https://openalex.org/W2096827683","https://openalex.org/W2120680665","https://openalex.org/W2136952590","https://openalex.org/W2140917900","https://openalex.org/W2143462372","https://openalex.org/W2146379626","https://openalex.org/W2165654401","https://openalex.org/W2240922184","https://openalex.org/W2341171179","https://openalex.org/W2727511844","https://openalex.org/W6690296631"],"related_works":["https://openalex.org/W185248416","https://openalex.org/W4312619976","https://openalex.org/W202649520","https://openalex.org/W2381312783","https://openalex.org/W2186303141","https://openalex.org/W2371578151","https://openalex.org/W2057864982","https://openalex.org/W2150249857","https://openalex.org/W2908857346","https://openalex.org/W3041766674"],"abstract_inverted_index":{"This":[0,101],"paper":[1,52,102],"proposes":[2],"an":[3,8],"efficient":[4],"parallel":[5,63,108,125],"algorithm":[6,48,75,109],"for":[7],"important":[9,118],"class":[10],"of":[11,73,81,106,117],"dynamic":[12,25,119],"programming":[13,120],"problems":[14],"that":[15,29],"includes":[16],"Viterbi,":[17],"Needleman--Wunsch,":[18],"Smith--Waterman,":[19],"and":[20,36,70,95],"Longest":[21],"Common":[22],"Subsequence.":[23],"In":[24,122],"programming,":[26],"the":[27,71,74,85,92,98,104,107,124],"subproblems":[28],"do":[30],"not":[31],"depend":[32],"on":[33,77,114],"each":[34],"other,":[35],"thus":[37],"can":[38],"be":[39,60],"computed":[40,61],"in":[41,50,62,84],"parallel,":[42],"form":[43],"stages,":[44],"or":[45],"wavefronts.":[46],"The":[47,68],"presented":[49],"this":[51],"provides":[53],"additional":[54],"parallelism":[55],"allowing":[56],"multiple":[57],"stages":[58],"to":[59,130],"despite":[64],"dependences":[65],"among":[66],"them.":[67],"correctness":[69],"performance":[72],"relies":[76],"rank":[78],"convergence":[79],"properties":[80],"matrix":[82],"multiplication":[83],"tropical":[86],"semiring,":[87],"formed":[88],"with":[89],"plus":[90],"as":[91,97],"multiplicative":[93],"operation":[94],"max":[96],"additive":[99],"operation.":[100],"demonstrates":[103],"efficiency":[105],"by":[110],"showing":[111],"significant":[112],"speedups":[113],"a":[115,137],"variety":[116],"problems.":[121],"particular,":[123],"Viterbi":[126],"decoder":[127],"is":[128],"up":[129],"24\u00d7":[131],"faster":[132],"(with":[133],"64":[134],"processors)":[135],"than":[136],"highly":[138],"optimized":[139],"commercial":[140],"baseline.<!--":[141],"END_PAGE_1":[142],"-->":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}