{"id":"https://openalex.org/W2021209793","doi":"https://doi.org/10.1002/cpe.4330040106","title":"Designing Algorithms on RP3","display_name":"Designing Algorithms on RP3","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2021209793","doi":"https://doi.org/10.1002/cpe.4330040106","mag":"2021209793"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330040106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040106","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5069979326","display_name":"Luigi Brochard","orcid":"https://orcid.org/0000-0003-3699-4089"},"institutions":[{"id":"https://openalex.org/I4210112067","display_name":"IBM (France)","ror":"https://ror.org/02wnbr922","country_code":"FR","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210112067"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Luigi Brochard","raw_affiliation_strings":["IBM France, 68 quai de la Rapee 75592 Paris Cedex 12, France"],"affiliations":[{"raw_affiliation_string":"IBM France, 68 quai de la Rapee 75592 Paris Cedex 12, France","institution_ids":["https://openalex.org/I4210112067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086874971","display_name":"Alex Freau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alex Freau","raw_affiliation_strings":["Institut National des Telecommunications Evry 91011, France"],"affiliations":[{"raw_affiliation_string":"Institut National des Telecommunications Evry 91011, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069979326"],"corresponding_institution_ids":["https://openalex.org/I4210112067"],"apc_list":null,"apc_paid":null,"fwci":0.7321,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73921765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"1","first_page":"79","last_page":"106"},"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.9966999888420105,"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.9966999888420105,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.871207594871521},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7194458246231079},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.7182324528694153},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6635081768035889},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.6202386617660522},{"id":"https://openalex.org/keywords/cache-only-memory-architecture","display_name":"Cache-only memory architecture","score":0.5915762186050415},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5650967359542847},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.48814496397972107},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4680494964122772},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.45343533158302307},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.4505241811275482},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4239903688430786},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.41009700298309326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32873544096946716},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.257622092962265},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.15750223398208618},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.09144118428230286}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.871207594871521},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7194458246231079},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.7182324528694153},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6635081768035889},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.6202386617660522},{"id":"https://openalex.org/C3720319","wikidata":"https://www.wikidata.org/wiki/Q5015937","display_name":"Cache-only memory architecture","level":5,"score":0.5915762186050415},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5650967359542847},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.48814496397972107},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4680494964122772},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.45343533158302307},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.4505241811275482},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4239903688430786},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.41009700298309326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32873544096946716},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.257622092962265},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.15750223398208618},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.09144118428230286}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330040106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040106","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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":14,"referenced_works":["https://openalex.org/W148392365","https://openalex.org/W169858420","https://openalex.org/W1552835837","https://openalex.org/W1559533846","https://openalex.org/W1602366775","https://openalex.org/W1707514944","https://openalex.org/W2004924114","https://openalex.org/W2008747215","https://openalex.org/W2024614888","https://openalex.org/W2034804129","https://openalex.org/W2071649025","https://openalex.org/W2083531088","https://openalex.org/W2132159669","https://openalex.org/W2165191998"],"related_works":["https://openalex.org/W2606565524","https://openalex.org/W1981002423","https://openalex.org/W1961903935","https://openalex.org/W2021535927","https://openalex.org/W3111801817","https://openalex.org/W2021209793","https://openalex.org/W2608622083","https://openalex.org/W1531802798","https://openalex.org/W2570594754","https://openalex.org/W2807409404"],"abstract_inverted_index":{"Abstract":[0],"We":[1,83,139],"study":[2,50],"here":[3],"the":[4,51,57,60,114,149,198],"behavior":[5],"of":[6,26,53,59,90,96,116,144,165,182],"two":[7],"numerical":[8],"algorithms":[9,172,192],"(matrix":[10],"multiplication":[11],"and":[12,37,40,42,81,98,106,123,133,146,167,184],"finite":[13],"difference":[14],"method)":[15],"on":[16,31,43,56,119],"a":[17,68,86,94,110,121,210],"three\u2010level":[18],"memory":[19,77,118,135,186,195,206],"hierarchy":[20],"multi\u2010processor":[21],"RP3.":[22],"Using":[23],"different":[24],"versions":[25],"these":[27,54,91],"algorithms,":[28],"which":[29,74],"differ":[30],"data":[32,44],"placement":[33],"(global,":[34],"local,":[35],"global":[36,134],"cacheable,":[38],"local":[39,117,132],"cacheable)":[41],"access":[45],"(blocked":[46],"or":[47],"non\u2010blocked),":[48],"we":[49,112,188],"impact":[52],"parameters":[55],"performance":[58,63,88],"program.":[61],"This":[62],"analysis":[64,89],"is":[65,102,127],"done":[66],"using":[67,93],"very":[69],"accurate":[70],"monitoring":[71],"system":[72],"(VPMC)":[73],"records":[75],"instructions,":[76],"requests,":[78],"cache":[79,145,157,161],"requests":[80],"misses.":[82],"perform":[84],"also":[85,140],"theoretical":[87,105],"programs":[92],"model":[95],"computation":[97],"communication.":[99],"Good":[100],"agreement":[101],"found":[103],"between":[104],"experimental":[107],"results.":[108],"As":[109],"conclusion":[111],"discuss":[113,141],"use":[115,143],"such":[120],"machine":[122],"show":[124,147,168],"that":[125,148,169,190],"it":[126],"ineffective":[128],"with":[129,162],"RP3":[130],"cache,":[131],"communication":[136],"speed":[137],"ratios.":[138],"optimal":[142,171],"optima":[150],"can":[151],"only":[152],"be":[153,175],"realized":[154],"under":[155],"some":[156],"properties":[158],"(private":[159],"store\u2010in":[160],"user":[163],"control":[164],"write\u2010back)":[166],"blocked":[170],"are":[173],"to":[174,177,209],"used":[176,202],"find":[178],"it.":[179],"Comparing":[180],"programming":[181,204,212],"shared":[183,194],"distributed":[185,205],"multi\u2010processors,":[187],"remark":[189],"optimized":[191],"for":[193,203],"systems":[196],"utilize":[197],"same":[199],"blocking":[200],"techniques":[201],"systems,":[207],"leading":[208],"common":[211],"paradigm.":[213]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}