{"id":"https://openalex.org/W1968664868","doi":"https://doi.org/10.1080/00207160008804954","title":"Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm","display_name":"Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1968664868","doi":"https://doi.org/10.1080/00207160008804954","mag":"1968664868"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804954","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804954","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5005558317","display_name":"Marjan Gu\u0161ev","orcid":"https://orcid.org/0000-0003-0351-9783"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. Gusev","raw_affiliation_strings":["Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, UK"],"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, UK","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082198541","display_name":"D. J. Evans","orcid":null},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. J. Evans","raw_affiliation_strings":["Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, UK"],"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, UK","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005558317"],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15244449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":"4","first_page":"449","last_page":"469"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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":0.9998999834060669,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9988999962806702,"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/algorithm","display_name":"Algorithm","score":0.7191917896270752},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6172075867652893},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6025915741920471},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5745742917060852},{"id":"https://openalex.org/keywords/qr-decomposition","display_name":"QR decomposition","score":0.5260142087936401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5025389194488525},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46530112624168396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43808338046073914},{"id":"https://openalex.org/keywords/systolic-array","display_name":"Systolic array","score":0.4105093479156494},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33068332076072693},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.24956101179122925},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1283557116985321}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7191917896270752},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6172075867652893},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6025915741920471},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5745742917060852},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.5260142087936401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5025389194488525},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46530112624168396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43808338046073914},{"id":"https://openalex.org/C150741067","wikidata":"https://www.wikidata.org/wiki/Q2377218","display_name":"Systolic array","level":3,"score":0.4105093479156494},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33068332076072693},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.24956101179122925},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1283557116985321},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160008804954","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804954","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W28782313","https://openalex.org/W1509443229","https://openalex.org/W1685044542","https://openalex.org/W1981401525","https://openalex.org/W1991227098","https://openalex.org/W1996032708","https://openalex.org/W2002252837","https://openalex.org/W2003292633","https://openalex.org/W2018733553","https://openalex.org/W2085551696","https://openalex.org/W2108070649","https://openalex.org/W2139378242","https://openalex.org/W2170396156","https://openalex.org/W2798909945","https://openalex.org/W2995746888"],"related_works":["https://openalex.org/W2126436096","https://openalex.org/W1986431723","https://openalex.org/W2365845987","https://openalex.org/W3029568918","https://openalex.org/W2188022358","https://openalex.org/W2004232015","https://openalex.org/W2020196933","https://openalex.org/W3215706942","https://openalex.org/W2586951184","https://openalex.org/W2032632402"],"abstract_inverted_index":{"Two":[0],"types":[1,39],"of":[2,40,143,146,171],"broadcast":[3,27,41,73,166],"in":[4,33,77,87,93,129,141,182],"algorithms":[5,128],"are":[6,42,105,173,198],"determined:":[7],"(1)":[8],"a":[9,25,48,78,88,108,144,159,168,183],"data":[10,14,153],"broadcast,":[11,111],"where":[12,28],"one":[13,21,29,36,63],"value":[15,65],"is":[16,31,52,119,179],"used":[17],"for":[18,66],"more":[19,34,101],"than":[20],"computation":[22],"and":[23,150,167,193],"(2)":[24],"computational":[26,72,110,165],"variable":[30,64,102],"computed":[32],"then":[35,70],"computation.":[37],"Both":[38],"preferred":[43],"to":[44],"be":[45,75],"eliminated":[46,76],"when":[47,95],"processor":[49],"array":[50],"implementation":[51,172],"desired":[53],"by":[54,82,107,125,188],"using":[55,189],"VLSI":[56],"technology.":[57],"When":[58],"the":[59,71,96,152,164,190],"algorithm":[60,97,178],"computes":[61,98],"only":[62],"each":[67],"index":[68],"vector":[69],"can":[74],"straight":[79],"forward":[80],"manner":[81],"introducing":[83],"counter":[84],"values":[85,103],"resulting":[86],"single":[89,130,185],"assignment":[90,131,186],"code.":[91],"However":[92],"cases":[94],"two":[99],"or":[100],"that":[104,162],"specified":[106],"different":[109,195],"has":[112,122],"not":[113],"been":[114,123],"considered.":[115],"As":[116],"far":[117],"as":[118],"known":[120],"it":[121],"solved":[124],"deriving":[126],"localized":[127,184],"code":[132,187],"heuristically.":[133],"In":[134],"this":[135,139],"paper":[136],"we":[137,157],"define":[138],"problem":[140],"terms":[142],"system":[145],"affine":[147],"recurrence":[148],"equations":[149],"analyze":[151],"dependencies":[154],"introduced.":[155],"Then":[156],"show":[158],"synthesis":[160],"procedure":[161],"eliminates":[163],"few":[169],"examples":[170],"shown.":[174],"The":[175],"QR":[176],"decomposition":[177],"also":[180],"presented":[181],"proposed":[191],"method":[192],"several":[194],"parallel":[196],"implementations":[197],"discussed.":[199]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}