{"id":"https://openalex.org/W1998023168","doi":"https://doi.org/10.1002/cpe.4330070505","title":"A fast recursive mapping algorithm","display_name":"A fast recursive mapping algorithm","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W1998023168","doi":"https://doi.org/10.1002/cpe.4330070505","mag":"1998023168"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330070505","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070505","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/A5100423614","display_name":"Song Chen","orcid":"https://orcid.org/0000-0003-0341-3428"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Song Chen","raw_affiliation_strings":["Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 07102, USA","Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ 07102, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110132547","display_name":"M.M. Eshaghian","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mary M. Eshaghian","raw_affiliation_strings":["Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 07102, USA","Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ 07102, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100423614"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.506,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71482862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"5","first_page":"391","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7135045528411865},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5779678821563721},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5075482130050659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45832785964012146},{"id":"https://openalex.org/keywords/spec#","display_name":"Spec#","score":0.4203948676586151},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4038490056991577},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38240763545036316},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08636653423309326}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7135045528411865},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5779678821563721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5075482130050659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45832785964012146},{"id":"https://openalex.org/C2778565505","wikidata":"https://www.wikidata.org/wiki/Q2207566","display_name":"Spec#","level":2,"score":0.4203948676586151},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4038490056991577},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38240763545036316},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08636653423309326},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/cpe.4330070505","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070505","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.5296","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.njit.edu/pub/cis/mary/Cluster-M/concur95.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W122517041","https://openalex.org/W185061175","https://openalex.org/W1534741631","https://openalex.org/W1549134103","https://openalex.org/W1963483878","https://openalex.org/W1969750929","https://openalex.org/W1979146060","https://openalex.org/W1998336350","https://openalex.org/W2015032555","https://openalex.org/W2019356799","https://openalex.org/W2022272738","https://openalex.org/W2025896589","https://openalex.org/W2041754927","https://openalex.org/W2043331236","https://openalex.org/W2052809699","https://openalex.org/W2085412609","https://openalex.org/W2090189305","https://openalex.org/W2092333800","https://openalex.org/W2112294982","https://openalex.org/W2118396891","https://openalex.org/W2140056767","https://openalex.org/W2151038512","https://openalex.org/W2152408640","https://openalex.org/W2162397650"],"related_works":["https://openalex.org/W878150521","https://openalex.org/W2008941207","https://openalex.org/W2373662841","https://openalex.org/W1970478390","https://openalex.org/W1533638723","https://openalex.org/W294916044","https://openalex.org/W2131667412","https://openalex.org/W2014546971","https://openalex.org/W2019959197","https://openalex.org/W4365460523"],"abstract_inverted_index":{"Abstract":[0],"The":[1,14,32,112,147],"paper":[2],"presents":[3],"a":[4,18,25,50,55,59,73,79,89,94,119,134,153,157,166],"generic":[5,176],"technique":[6,16],"for":[7,49,72,118,144,180],"mapping":[8,21,149],"parallel":[9,12],"algorithms":[10,107],"onto":[11,165],"architectures.":[13],"proposed":[15],"is":[17,24,66,86,114,133,141,178,191],"fast":[19],"recursive":[20],"algorithm":[22,150,177],"which":[23],"component":[26],"of":[27,35,104,126,156,169,217],"the":[28,38,42,46,69,105,110,182,186,222],"Cluster\u2010M":[29,36,148,200],"programming":[30],"tool.":[31],"other":[33,194,223],"components":[34],"are":[37],"Specification":[39,47],"module":[40],"and":[41,138,185,210],"Representation":[43,70],"module.":[44],"In":[45,68],"module,":[48,71],"given":[51,74,120,158],"task":[52,61,90,121,163],"specified":[53],"by":[54],"high\u2010level":[56],"machine\u2010independent":[57,135],"program,":[58],"clustered":[60,80],"graph":[62,65,82,85,98,122,160,168],"called":[63,83],"Spec":[64,95,159],"generated.":[67,87],"architecture":[75],"or":[76,203,213],"computing":[77],"organization,":[78],"system":[81,128],"Rep":[84,167],"Given":[88],"(or":[91,96],"system)":[92],"graph,":[93],"Rep)":[97],"can":[99],"be":[100],"generated":[101],"using":[102,211],"one":[103],"clustering":[106,113],"presented":[108,151],"in":[109,172,206],"paper.":[111],"done":[115],"only":[116],"once":[117],"(system":[123],"graph)":[124],"independent":[125],"any":[127],"graphs":[129],"(task":[130],"graphs).":[131],"It":[132],"(application\u2010independent)":[136],"clustering,":[137],"therefore":[139],"it":[140],"not":[142],"repeated":[143],"different":[145],"mappings.":[146],"produces":[152,201],"sub\u2010optimal":[154],"matching":[155],"containing":[161],"M":[162],"modules,":[164],"N":[170],"processors,":[171],"O(MN)":[173],"time.":[174],"This":[175],"suitable":[179],"both":[181],"allocation":[183],"problem":[184],"scheduling":[187],"problem.":[188],"Its":[189],"performance":[190],"compared":[192,220],"to":[193,221],"leading":[195],"techniques.":[196],"We":[197],"show":[198],"that":[199],"better":[202],"similar":[204],"results":[205],"significantly":[207],"less":[208],"time":[209],"fewer":[212],"an":[214],"equal":[215],"number":[216],"processors":[218],"as":[219],"known":[224],"methods.":[225]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}