{"id":"https://openalex.org/W1997652984","doi":"https://doi.org/10.1002/cpe.4330060602","title":"Allocating data to distributed\u2010memory multiprocessors by genetic algorithms","display_name":"Allocating data to distributed\u2010memory multiprocessors by genetic algorithms","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W1997652984","doi":"https://doi.org/10.1002/cpe.4330060602","mag":"1997652984"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330060602","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330060602","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/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]},{"id":"https://openalex.org/I160368002","display_name":"Lebanese University","ror":"https://ror.org/05x6qnc69","country_code":"LB","type":"education","lineage":["https://openalex.org/I160368002"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Nashat Mansour","raw_affiliation_strings":["American Lebanese University, Lebanon Northeast Parallel Architectures Center, USA"],"affiliations":[{"raw_affiliation_string":"American Lebanese University, Lebanon Northeast Parallel Architectures Center, USA","institution_ids":["https://openalex.org/I56306041","https://openalex.org/I160368002"]}]},{"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":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111391750"],"corresponding_institution_ids":["https://openalex.org/I160368002","https://openalex.org/I56306041"],"apc_list":null,"apc_paid":null,"fwci":1.0902,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.8101216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"6","first_page":"485","last_page":"504"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9761999845504761,"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/hypercube","display_name":"Hypercube","score":0.7770124673843384},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7721208333969116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7664602994918823},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6715456247329712},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5514605045318604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4323852062225342},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3497157692909241}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7770124673843384},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7721208333969116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7664602994918823},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6715456247329712},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5514605045318604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4323852062225342},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3497157692909241},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330060602","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330060602","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":[{"id":"https://openalex.org/F4320309532","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W20846018","https://openalex.org/W132676638","https://openalex.org/W173310340","https://openalex.org/W1485961250","https://openalex.org/W1495400246","https://openalex.org/W1496327969","https://openalex.org/W1497437240","https://openalex.org/W1515745228","https://openalex.org/W1516187680","https://openalex.org/W1533716699","https://openalex.org/W1559533846","https://openalex.org/W1560068970","https://openalex.org/W1566107011","https://openalex.org/W1566803874","https://openalex.org/W1585199708","https://openalex.org/W1787544972","https://openalex.org/W1804524650","https://openalex.org/W1939346899","https://openalex.org/W2011967465","https://openalex.org/W2054673685","https://openalex.org/W2058901976","https://openalex.org/W2096159022","https://openalex.org/W2100104057","https://openalex.org/W2111516947","https://openalex.org/W2151676833","https://openalex.org/W2156698647","https://openalex.org/W3023540311","https://openalex.org/W3184911997","https://openalex.org/W7070139461"],"related_works":["https://openalex.org/W2916710807","https://openalex.org/W4286907761","https://openalex.org/W2413588304","https://openalex.org/W3205447645","https://openalex.org/W2009411567","https://openalex.org/W2371629703","https://openalex.org/W2097769911","https://openalex.org/W2774705104","https://openalex.org/W72835634","https://openalex.org/W4250003423"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"three":[3,59],"genetic":[4],"algorithms":[5],"(GAs)":[6],"for":[7,40,104],"allocating":[8],"irregular":[9],"data":[10],"sets":[11],"to":[12],"multiprocessors.":[13],"These":[14],"are":[15,30,38,66,76],"a":[16,20,24,48,51,83],"sequential":[17],"hybrid":[18],"GA,":[19],"coarse\u2010grain":[21,99],"GA":[22,100],"and":[23,50,79],"fine\u2010grain":[25],"GA.":[26],"The":[27,74,89],"last":[28],"two":[29,90],"based":[31],"on":[32,47],"models":[33],"of":[34,107],"natural":[35],"evolution":[36],"that":[37,57],"suitable":[39],"parallel":[41,91],"implementation;":[42],"they":[43],"have":[44,93],"been":[45],"implemented":[46],"hypercube":[49],"Connection":[52],"Machine.":[53],"Experimental":[54],"results":[55],"show":[56,82],"the":[58,98,105],"GAs":[60,75,92],"evolve":[61],"good":[62],"suboptimal":[63],"solutions":[64,103],"which":[65],"better":[67,102],"than":[68],"those":[69],"produced":[70],"by":[71],"other":[72],"methods.":[73],"also":[77],"robust":[78],"do":[80],"not":[81],"bias":[84],"towards":[85],"particular":[86],"problem":[87],"configurations.":[88],"reasonable":[94],"execution":[95],"times,":[96],"with":[97],"producing":[101],"allocation":[106],"loosely":[108],"synchronous":[109],"computations.":[110]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}