{"id":"https://openalex.org/W2034045337","doi":"https://doi.org/10.1080/00207169208804089","title":"Fast linear systolic matrix vector multiplication","display_name":"Fast linear systolic matrix vector multiplication","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2034045337","doi":"https://doi.org/10.1080/00207169208804089","mag":"2034045337"},"language":"en","primary_location":{"id":"doi:10.1080/00207169208804089","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169208804089","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":false,"raw_author_name":"M. Gu\u0161ev","raw_affiliation_strings":["Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics,  U.K","Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics,  U.K","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"middle","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,  U.K","Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics,  U.K","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113510413","display_name":"J.F. Tasi\u010d","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":"J. Tasi\u010d","raw_affiliation_strings":["Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics,  U.K","Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics,  U.K","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, Leics, U.K","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":null,"apc_paid":null,"fwci":0.9698,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78344748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":"3-4","first_page":"231","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9961000084877014,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9832000136375427,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/systolic-array","display_name":"Systolic array","score":0.7916774749755859},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.7411680817604065},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7324559688568115},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6899165511131287},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.649262011051178},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.540759265422821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46539318561553955},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4645417034626007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45304444432258606},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.42056381702423096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4001597762107849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2428719699382782},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.13303393125534058}],"concepts":[{"id":"https://openalex.org/C150741067","wikidata":"https://www.wikidata.org/wiki/Q2377218","display_name":"Systolic array","level":3,"score":0.7916774749755859},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.7411680817604065},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7324559688568115},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6899165511131287},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.649262011051178},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.540759265422821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46539318561553955},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4645417034626007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45304444432258606},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.42056381702423096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4001597762107849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2428719699382782},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.13303393125534058},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169208804089","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169208804089","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":10,"referenced_works":["https://openalex.org/W114716186","https://openalex.org/W589822813","https://openalex.org/W2003292633","https://openalex.org/W2017369466","https://openalex.org/W2054388411","https://openalex.org/W2064130185","https://openalex.org/W2079092669","https://openalex.org/W2158901487","https://openalex.org/W2995746888","https://openalex.org/W4229992011"],"related_works":["https://openalex.org/W4287593139","https://openalex.org/W3099313426","https://openalex.org/W2022229285","https://openalex.org/W46448156","https://openalex.org/W1506547947","https://openalex.org/W2283084692","https://openalex.org/W2130878144","https://openalex.org/W2086146848","https://openalex.org/W4206811032","https://openalex.org/W2995605830"],"abstract_inverted_index":{"The":[0,20],"systolic":[1,74,139],"concept":[2],"in":[3,31,81,87,92,154,192],"the":[4,10,24,29,43,49,85,88,116,123,129,133,152,159,162,166,172,179,188],"parallel":[5],"architecture":[6],"design":[7,101],"proposed":[8,68],"by":[9,105],"H.":[11,65,173],"T.":[12,66,174],"Kung":[13,67,175],"[1,2]":[14],"obtains":[15],"high":[16],"throughput":[17],"and":[18,109,150,165,183,196],"speedups.":[19],"linear":[21,73,138,176],"array":[22,75,89],"for":[23,59,71,158],"matrix":[25],"vector":[26],"multiplication":[27],"executes":[28,151],"algorithm":[30,153,180],"2n":[32,38],"\u2212":[33,39],"1":[34,40],"time":[35,95,156,194],"steps":[36,157,199],"using":[37,76],"processors.":[41],"Although":[42],"speedup":[44],"obtained":[45],"is":[46,51,181],"very":[47,52],"high,":[48],"efficiency":[50,58],"poor":[53],"(typical":[54],"values":[55],"of":[56,118,135],"25%":[57],"problem":[60],"size":[61],"greater":[62],"than":[63],"10).":[64],"an":[69],"idea":[70],"a":[72,136,144],"two":[77],"data":[78,169],"streams":[79],"flowing":[80],"opposite":[82],"directions.":[83],"However,":[84],"processors":[86,119,149,189],"perform":[90],"operations":[91],"every":[93,193],"second":[94],"moment.":[96],"Attempts":[97],"to":[98,121,142],"improve":[99],"this":[100],"have":[102],"been":[103],"made":[104],"many":[106],"researchers.":[107],"Nonlinear":[108],"folding":[110],"transformations":[111],"techniques":[112],"[3,4,5]":[113],"only":[114],"decrease":[115],"number":[117],"used":[120],"half":[122],"size,":[124],"but":[125],"do":[126],"not":[127],"affect":[128],"time.":[130],"We":[131],"propose":[132],"use":[134],"fast":[137],"computation":[140],"procedure":[141],"obtain":[143],"solution":[145],"that":[146],"uses":[147],"3n/2":[148,155],"same":[160,163,167],"cells,":[161],"communication":[164],"regular":[168],"flow":[170],"as":[171],"array.":[177],"Only":[178],"restructured":[182],"more":[184],"efficiently":[185],"organized.":[186],"Now":[187],"are":[190,200],"utilized":[191],"step":[195],"no":[197],"idle":[198],"required.":[201]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}