{"id":"https://openalex.org/W2167344161","doi":"https://doi.org/10.1080/00207160008804974","title":"Localized algorithms for vlsi processor arrays","display_name":"Localized algorithms for vlsi processor arrays","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2167344161","doi":"https://doi.org/10.1080/00207160008804974","mag":"2167344161"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804974","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804974","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/A5085745151","display_name":"David J. Evans","orcid":"https://orcid.org/0000-0002-1315-4258"},"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":"D.J. Evans","raw_affiliation_strings":["Parallel Algorithms Research Centre , University of Technology , Loughborough, UK, Leics"],"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , University of Technology , Loughborough, UK, Leics","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005558317","display_name":"Marjan Gu\u0161ev","orcid":"https://orcid.org/0000-0003-0351-9783"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M Gusev","raw_affiliation_strings":["PMF Institut za Informatika , University\"Kiril i Metodij\"of Skopje , Arhimedova 5, p.f 162, Skopje, Yugoslavia, Yu-91000, Macedonia"],"affiliations":[{"raw_affiliation_string":"PMF Institut za Informatika , University\"Kiril i Metodij\"of Skopje , Arhimedova 5, p.f 162, Skopje, Yugoslavia, Yu-91000, Macedonia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085745151"],"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.15147606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"75","issue":"2","first_page":"149","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991000294685364,"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.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.8641359806060791},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.5309625864028931},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5181073546409607},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5044885873794556},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4720395803451538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.468385249376297},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44525015354156494},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.41569384932518005},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.15635794401168823}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.8641359806060791},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.5309625864028931},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5181073546409607},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5044885873794556},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4720395803451538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.468385249376297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44525015354156494},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41569384932518005},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.15635794401168823},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160008804974","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804974","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W28782313","https://openalex.org/W1509443229","https://openalex.org/W1599533721","https://openalex.org/W1685044542","https://openalex.org/W2002252837","https://openalex.org/W2003292633","https://openalex.org/W2139378242","https://openalex.org/W2798909945","https://openalex.org/W2995746888"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W797244100","https://openalex.org/W4298155039","https://openalex.org/W2801186172","https://openalex.org/W2367560286","https://openalex.org/W2181812531","https://openalex.org/W2368845094"],"abstract_inverted_index":{"In":[0],"this":[1,67,140],"paper":[2],"we":[3,189],"analyze":[4],"the":[5,33,43,52,69,73,79,86,91,97,102,118,122,131,147,158,183,192,201,230,241,249,255,258,262,268,271,279],"algorithms":[6,15,20,108,221],"expressed":[7,84],"as":[8],"a":[9,143,150,198],"system":[10,34,151],"of":[11,25,35,54,146,152,248,257,270],"recurrence":[12,36,154],"equations.":[13],"The":[14,45,135,175,251],"are":[16,30,58,64,109],"called":[17],"2\u22171":[18],"output":[19,23],"if":[21,51],"two":[22,56],"values":[24,57],"one":[26],"function":[27],"(variable":[28],"identification)":[29],"specified":[31],"by":[32,66,130,138,156],"equations":[37,155],"for":[38,121,172,239,245],"each":[39],"index":[40],"point":[41],"in":[42,48,85,96,111,133,212,254],"algorithm.":[44,105,250],"algorithm":[46,81,94,126,148,193,244,274],"is":[47,275],"free":[49],"form":[50,89,100,145,186,199],"indexes":[53],"these":[55,107,220],"not":[59],"dependent.":[60],"Two":[61],"standard":[62,280],"classes":[63],"determined":[65],"criteria:":[68],"nearest":[70,98,184,272],"neighbour":[71,99,185,273],"and":[72,149,160,203,261],"all":[74,87,123],"pair":[75,88,124],"form.":[76],"For":[77,228],"example":[78],"sorting":[80],"can":[82,168,194,206,222,236],"be":[83,169,179,195,207,223,237],"i.e.,":[90,101],"linear":[92],"insertion":[93],"or":[95],"bubble":[103],"sort":[104],"However":[106],"different":[110],"their":[112],"nature.":[113],"A":[114,215],"procedure":[115,141,177],"to":[116],"eliminate":[117],"computational":[119,159,202],"broadcast":[120,205],"2\u22171output":[125],"has":[127],"been":[128],"proposed":[129,176],"authors":[132],"[1].":[134],"result":[136,211],"obtained":[137],"implementing":[139],"was":[142],"localized":[144,213],"uniform":[153],"eliminating":[157],"data":[161,165,204,259],"broadcast.":[162],"So":[163],"he":[164],"dependence":[166],"method":[167],"efficiently":[170],"used":[171,238],"parallel":[173],"implementations.":[174],"cannot":[178],"implemented":[180,224],"directly":[181],"on":[182,225],"algorithms.":[187,214],"Here":[188],"show":[190,218,266],"how":[191,219],"restructured":[196],"into":[197],"where":[200],"eliminated.":[208],"These":[209],"transformations":[210],"few":[216],"examples":[217],"processor":[226,263],"arrays.":[227],"example,":[229],"Gentleman":[231],"Kung":[232],"triangular":[233],"array":[234],"[2]":[235],"solving":[240],"QR":[242],"decomposition":[243],"both":[246],"forms":[247],"implementations":[252],"differ":[253],"order":[256],"flow":[260],"operation.":[264],"We":[265],"that":[267],"implementation":[269],"even":[276],"better":[277],"than":[278],"one.":[281]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}