{"id":"https://openalex.org/W3163967383","doi":"https://doi.org/10.1109/jsait.2021.3105365","title":"Bivariate Polynomial Coding for Efficient Distributed Matrix Multiplication","display_name":"Bivariate Polynomial Coding for Efficient Distributed Matrix Multiplication","publication_year":2021,"publication_date":"2021-08-20","ids":{"openalex":"https://openalex.org/W3163967383","doi":"https://doi.org/10.1109/jsait.2021.3105365","mag":"3163967383"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2021.3105365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3105365","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.07227","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Burak Hasircioglu","orcid":"https://orcid.org/0000-0001-5005-2894"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Burak Hasircioglu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Jesus Gomez-Vilardebo","orcid":"https://orcid.org/0000-0002-3162-8058"},"institutions":[{"id":"https://openalex.org/I4210087295","display_name":"Centre Tecnologic de Telecomunicacions de Catalunya","ror":"https://ror.org/001cwea56","country_code":"ES","type":"nonprofit","lineage":["https://openalex.org/I4210087295","https://openalex.org/I4387153040"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jesus Gomez-Vilardebo","raw_affiliation_strings":["Centre Tecnol\u00f3gic de Telecomunicacions de Catalunya (CTTC/CERCA), Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Centre Tecnol\u00f3gic de Telecomunicacions de Catalunya (CTTC/CERCA), Barcelona, Spain","institution_ids":["https://openalex.org/I4210087295"]}]},{"author_position":"last","author":{"id":null,"display_name":"Deniz Gunduz","orcid":"https://orcid.org/0000-0002-7725-395X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Deniz Gunduz","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, Imperial College London, London, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, Imperial College London, London, U.K","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9594,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88505249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":"3","first_page":"814","last_page":"829"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9383999705314636,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9383999705314636,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.00839999970048666,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00800000037997961,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computation","display_name":"Computation","score":0.6513000130653381},{"id":"https://openalex.org/keywords/bivariate-analysis","display_name":"Bivariate analysis","score":0.6399000287055969},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5927000045776367},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5200999975204468},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5182999968528748},{"id":"https://openalex.org/keywords/univariate","display_name":"Univariate","score":0.46399998664855957},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45260000228881836},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41290000081062317},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4081000089645386}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6513000130653381},{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.6399000287055969},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5927000045776367},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5200999975204468},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5182999968528748},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4887000024318695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48669999837875366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4675000011920929},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.46399998664855957},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41290000081062317},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3970000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3822000026702881},{"id":"https://openalex.org/C88080468","wikidata":"https://www.wikidata.org/wiki/Q637347","display_name":"Polynomial interpolation","level":4,"score":0.3474999964237213},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.3447999954223633},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C71901391","wikidata":"https://www.wikidata.org/wiki/Q7126699","display_name":"Upload","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.337799996137619},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C64208722","wikidata":"https://www.wikidata.org/wiki/Q861606","display_name":"Lagrange polynomial","level":3,"score":0.3262999951839447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3215000033378601},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.31060001254081726},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.274399995803833},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.2718000113964081},{"id":"https://openalex.org/C55294529","wikidata":"https://www.wikidata.org/wiki/Q579544","display_name":"Vandermonde matrix","level":3,"score":0.2596000134944916}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/jsait.2021.3105365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3105365","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2001.07227","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.07227","pdf_url":"https://arxiv.org/pdf/2001.07227","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:spiral.imperial.ac.uk:10044/1/101297","is_oa":false,"landing_page_url":"http://hdl.handle.net/10044/1/101297","pdf_url":null,"source":{"id":"https://openalex.org/S4306401396","display_name":"Spiral (Imperial College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I47508984","host_organization_name":"Imperial College London","host_organization_lineage":["https://openalex.org/I47508984"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"829","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.07227","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.07227","pdf_url":"https://arxiv.org/pdf/2001.07227","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7846425480","display_name":null,"funder_award_id":"677854","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G8105621258","display_name":"Communication-Aware Dynamic Edge Computing (CONNECT)","funder_award_id":"EP/T023600/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G98698327","display_name":null,"funder_award_id":"EP/T023600/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2038773382","https://openalex.org/W2057202540","https://openalex.org/W2268702383","https://openalex.org/W2784935051","https://openalex.org/W2963062115","https://openalex.org/W2963117124","https://openalex.org/W2963922724","https://openalex.org/W2964229375","https://openalex.org/W2993649261","https://openalex.org/W2995947286","https://openalex.org/W3015418122","https://openalex.org/W3080363640","https://openalex.org/W3119375995","https://openalex.org/W3125070457","https://openalex.org/W4249253882","https://openalex.org/W4252830288","https://openalex.org/W6738835244"],"related_works":[],"abstract_inverted_index":{"Coded":[0],"computing":[1],"is":[2,170],"an":[3],"effective":[4,25],"technique":[5],"to":[6,23,84,89,112],"mitigate":[7],"\u201cstragglers\u201d":[8],"in":[9,26,53,131,141],"large-scale":[10],"and":[11,80,95,137,201],"distributed":[12,241,261],"matrix":[13,74,242],"multiplication.":[14,243],"In":[15,98],"particular,":[16],"univariate":[17],"polynomial":[18,110,126,158,232],"codes":[19,127],"have":[20],"been":[21],"shown":[22],"be":[24,150],"straggler":[27],"mitigation":[28],"by":[29,48,119],"making":[30],"the":[31,37,45,49,61,73,115,144,165,185,193,198,209,236],"computation":[32,96,238],"time":[33,239],"depend":[34],"only":[35],"on":[36,173],"fastest":[38],"workers.":[39,121,225],"However,":[40],"these":[41],"schemes":[42,257],"completely":[43],"ignore":[44],"work":[46,64,116,247],"done":[47],"straggling":[50,120],"workers":[51],"resulting":[52],"a":[54,103,174,250],"waste":[55],"of":[56,63,106,133,143,146,177,187,208,224,240,253],"computational":[57],"resources.":[58],"To":[59],"reduce":[60],"amount":[62],"left":[65],"unfinished":[66],"at":[67,184],"workers,":[68],"one":[69,163],"can":[70,149],"further":[71],"decompose":[72],"multiplication":[75],"task":[76],"into":[77],"smaller":[78],"sub-tasks,":[79],"assign":[81],"multiple":[82],"sub-tasks":[83,147],"each":[85],"worker,":[86],"possibly":[87],"heterogeneously,":[88],"better":[90],"fit":[91],"their":[92],"particular":[93],"storage":[94,138,222],"capacities.":[97],"this":[99,246],"work,":[100],"we":[101,196],"propose":[102,155],"novel":[104],"family":[105],"<italic":[107],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">bivariate":[109],"codes</i>":[111],"efficiently":[113],"exploit":[114],"carried":[117],"out":[118],"We":[122,154,180,212,244],"show":[123,229],"that":[124,148,167,230],"bivariate":[125,157,168,231],"bring":[128],"significant":[129],"advantages":[130],"terms":[132,142],"upload":[134],"communication":[135],"costs":[136],"efficiency,":[139],"measured":[140],"number":[145],"computed":[151],"per":[152],"worker.":[153],"two":[156],"coding":[159,233,256],"schemes.":[160],"The":[161],"first":[162],"exploits":[164],"fact":[166],"interpolation":[169,214],"always":[171],"possible":[172],"rectangular":[175],"grid":[176],"evaluation":[178,210],"points.":[179,211],"obtain":[181],"such":[182,217],"points":[183],"cost":[186],"adding":[188],"some":[189],"redundant":[190],"computations.":[191],"For":[192],"second":[194],"scheme,":[195],"relax":[197],"decoding":[199],"constraints":[200],"require":[202],"decodability":[203,218],"for":[204,220,258],"almost":[205],"all":[206],"choices":[207],"present":[213],"sets":[215],"satisfying":[216],"conditions":[219],"certain":[221],"configurations":[223],"Our":[226],"numerical":[227],"results":[228],"considerably":[234],"reduces":[235],"average":[237],"believe":[245],"opens":[248],"up":[249],"new":[251],"class":[252],"previously":[254],"unexplored":[255],"efficient":[259],"coded":[260],"computation.":[262]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2021-06-07T00:00:00"}