{"id":"https://openalex.org/W2015393122","doi":"https://doi.org/10.1002/cpe.4330040705","title":"Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations","display_name":"Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2015393122","doi":"https://doi.org/10.1002/cpe.4330040705","mag":"2015393122"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330040705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040705","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/A5111391750","display_name":"Nashat Mansour","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nashat Mansour","raw_affiliation_strings":["Computer & Information Science Syracuse University, USA","Computer and Information Science, Syracuse University, USA"],"affiliations":[{"raw_affiliation_string":"Computer & Information Science Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"Computer and Information Science, Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108016089","display_name":"Geoffrey Fox","orcid":"https://orcid.org/0000-0001-8198-4117"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geoffrey C. Fox","raw_affiliation_strings":["Northeast Parallel Architectures Center Syracuse University, USA","Northeast Parallel Architectures Center, Syracuse University, USA"],"affiliations":[{"raw_affiliation_string":"Northeast Parallel Architectures Center Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"Northeast Parallel Architectures Center, Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111391750"],"corresponding_institution_ids":["https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":2.6767,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90042198,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"7","first_page":"557","last_page":"574"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9975000023841858,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9968000054359436,"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.8284045457839966},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6725339889526367},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6381891965866089},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5356649160385132},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.533721923828125},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.47485852241516113},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.47329774498939514},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.4718382656574249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43033578991889954},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30924224853515625},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2020624876022339}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8284045457839966},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6725339889526367},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6381891965866089},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5356649160385132},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.533721923828125},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.47485852241516113},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.47329774498939514},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.4718382656574249},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43033578991889954},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30924224853515625},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2020624876022339},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330040705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040705","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":19,"referenced_works":["https://openalex.org/W1493035029","https://openalex.org/W1497256448","https://openalex.org/W1559533846","https://openalex.org/W1560068970","https://openalex.org/W2010526455","https://openalex.org/W2011967465","https://openalex.org/W2012500472","https://openalex.org/W2024060531","https://openalex.org/W2025663173","https://openalex.org/W2051719061","https://openalex.org/W2058901976","https://openalex.org/W2085374061","https://openalex.org/W2096159022","https://openalex.org/W2111516947","https://openalex.org/W2114030927","https://openalex.org/W2128193809","https://openalex.org/W2156698647","https://openalex.org/W3023540311","https://openalex.org/W7070139461"],"related_works":["https://openalex.org/W2261837478","https://openalex.org/W2077092686","https://openalex.org/W3007136692","https://openalex.org/W1967687468","https://openalex.org/W2089397391","https://openalex.org/W2002077985","https://openalex.org/W173512906","https://openalex.org/W2382432451","https://openalex.org/W2394090522","https://openalex.org/W2979021254"],"abstract_inverted_index":{"Abstract":[0],"Three":[1],"optimization":[2],"methods":[3,98],"derived":[4],"from":[5],"natural":[6],"sciences":[7],"are":[8,17,60,74,136],"considered":[9],"for":[10,65,111,153,168],"allocating":[11],"data":[12],"to":[13,39,171],"multicomputer":[14],"nodes.":[15],"These":[16],"simulated":[18],"annealing,":[19],"genetic":[20,119],"algorithms":[21,43,89,107,120],"and":[22,30,35,49,63,81,99,118,124],"neural":[23,140],"networks.":[24],"A":[25],"number":[26],"of":[27,33,41,57,95,148],"design":[28],"choices":[29],"the":[31,42,55,87,116,139,149,154],"addition":[32],"preprocessing":[34],"postprocessing":[36],"steps":[37,151],"lead":[38],"versions":[40,59],"which":[44,165],"differ":[45],"in":[46,162],"solution":[47,75],"qualities":[48],"execution":[50,77,163],"times.":[51],"In":[52],"this":[53],"paper":[54],"performances":[56],"these":[58],"critically":[61],"evaluated":[62],"compared":[64],"test":[66],"cases":[67],"with":[68],"different":[69,106,112],"features.":[70],"The":[71],"performance":[72],"criteria":[73],"quality,":[76],"time,":[78,164],"robustness,":[79],"bias":[80,129],"parallelizability.":[82],"Experimental":[83],"results":[84],"show":[85,127],"that":[86,100],"physical":[88,155],"produce":[90,121],"better":[91,122],"solutions":[92,123],"than":[93,138],"those":[94],"recursive":[96],"bisection":[97],"they":[101,135],"have":[102],"diverse":[103],"properties.":[104],"Hence,":[105],"would":[108],"be":[109],"suitable":[110],"applications.":[113],"For":[114],"example,":[115],"annealing":[117],"do":[125],"not":[126],"a":[128,159],"towards":[130],"particular":[131],"problem":[132],"structures,":[133],"but":[134],"slower":[137],"network":[141],"algorithms.":[142],"Preprocessing":[143],"graph":[144],"contraction":[145],"is":[146,166],"one":[147],"additional":[150],"suggested":[152],"methods.":[156],"It":[157],"produces":[158],"significant":[160],"reduction":[161],"necessary":[167],"their":[169],"applicability":[170],"large":[172],"problems.":[173]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}