{"id":"https://openalex.org/W4235141998","doi":"https://doi.org/10.1109/cec.2004.1331057","title":"Genetic algorithms for parallel code optimization","display_name":"Genetic algorithms for parallel code optimization","publication_year":2005,"publication_date":"2005-01-17","ids":{"openalex":"https://openalex.org/W4235141998","doi":"https://doi.org/10.1109/cec.2004.1331057"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1331057","doi":"https://doi.org/10.1109/cec.2004.1331057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331057","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391","observed_orcids":["https://orcid.org/0000-0003-0276-1391"]},"institutions":[{"id":"https://openalex.org/I100072489","display_name":"Yeditepe University","ror":"https://ror.org/025mx2575","country_code":"TR","type":"education","lineage":["https://openalex.org/I100072489"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"E. Ozcan","raw_affiliation_strings":["Department of Computer Engineering, Yeditepe University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Yeditepe University, Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052792813","display_name":"Esin Onba\u015fio\u011flu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I100072489","display_name":"Yeditepe University","ror":"https://ror.org/025mx2575","country_code":"TR","type":"education","lineage":["https://openalex.org/I100072489"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"E. Onbasioglu","raw_affiliation_strings":["Department of Computer Engineering, Yeditepe University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Yeditepe University, Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100072489"],"apc_list":null,"apc_paid":null,"fwci":1.5188,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81209373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1375","last_page":"1381"},"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.9218999743461609,"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.9218999743461609,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.04879999905824661,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.02160000056028366,"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/genetic-algorithm","display_name":"genetic algorithm","score":0.925000011920929},{"id":"https://openalex.org/keywords/parallel-code-optimization","display_name":"parallel code optimization","score":0.9480000138282776},{"id":"https://openalex.org/keywords/data-distribution","display_name":"data distribution","score":0.8209999799728394},{"id":"https://openalex.org/keywords/degree-of-parallelism","display_name":"degree of parallelism","score":0.9860000014305115},{"id":"https://openalex.org/keywords/communication-structure","display_name":"communication structure","score":0.9110000133514404},{"id":"https://openalex.org/keywords/distributed-memory-systems","display_name":"distributed memory systems","score":0.9750000238418579},{"id":"https://openalex.org/keywords/steady-state-genetic-algorithm","display_name":"steady-state genetic algorithm","score":0.8999999761581421},{"id":"https://openalex.org/keywords/crossover-operator","display_name":"crossover operator","score":0.9980000257492065},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.6980000138282776}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7802377939224243},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7457996010780334},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6915813684463501},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6203054189682007},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5845604538917542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5698935389518738},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5637720227241516},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5234412550926208},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4998359680175781},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.45240622758865356},{"id":"https://openalex.org/C6135463","wikidata":"https://www.wikidata.org/wiki/Q5532920","display_name":"Genetic representation","level":3,"score":0.4460217356681824},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.065461665391922},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.06281834840774536},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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.1109/cec.2004.1331057","doi":"https://doi.org/10.1109/cec.2004.1331057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331057","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.5003","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cse.yeditepe.edu.tr/~eozcan/research/papers/CEC04_PCO.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W205633621","https://openalex.org/W1492417045","https://openalex.org/W1496559142","https://openalex.org/W1497256448","https://openalex.org/W1540418512","https://openalex.org/W1649413295","https://openalex.org/W1939156876","https://openalex.org/W1989396323","https://openalex.org/W2014848638","https://openalex.org/W2024804689","https://openalex.org/W2070922326","https://openalex.org/W2081062896","https://openalex.org/W2090457779","https://openalex.org/W2119609467","https://openalex.org/W2126637747","https://openalex.org/W2135581789","https://openalex.org/W2140639562","https://openalex.org/W2150730789","https://openalex.org/W3023540311","https://openalex.org/W4210551159","https://openalex.org/W6632315471"],"related_works":["https://openalex.org/W1997652984","https://openalex.org/W2966225591","https://openalex.org/W2077641332","https://openalex.org/W1545422613","https://openalex.org/W7096804874","https://openalex.org/W1924861875","https://openalex.org/W7095274108","https://openalex.org/W2332402125","https://openalex.org/W1543127209","https://openalex.org/W1597805552"],"abstract_inverted_index":{"Determining":[0],"the":[1,9,41,47,59,82,87,107],"optimum":[2],"data":[3,49],"distribution,":[4],"degree":[5],"of":[6,31,44,58,81,86,111],"parallelism":[7],"and":[8,46,91,100],"communication":[10,90,98],"structure":[11],"on":[12],"distributed":[13],"memory":[14],"machines":[15],"for":[16,55,116],"a":[17,22,27,34,97,101],"given":[18],"algorithm":[19,29,36,65,71],"is":[20,37,66,77],"not":[21],"straightforward":[23],"task.":[24],"Assuming":[25],"that":[26],"parallel":[28,60],"consists":[30],"consecutive":[32],"stages,":[33],"genetic":[35,64,70],"proposed":[38],"to":[39,52],"find":[40],"best":[42,48],"number":[43],"processors":[45],"distribution":[50],"method":[51],"be":[53],"used":[54],"each":[56],"stage":[57],"algorithm.":[61],"Steady":[62],"state":[63],"compared":[67],"with":[68],"transgenerational":[69],"using":[72],"different":[73],"crossover":[74],"operators.":[75],"Performance":[76],"evaluated":[78],"in":[79,106],"terms":[80],"total":[83],"execution":[84],"time":[85],"program":[88],"including":[89],"computation":[92,95],"times.":[93],"A":[94],"intensive,":[96],"intensive":[99],"mixed":[102],"implementation":[103],"are":[104],"utilized":[105],"experiments.":[108],"The":[109],"performance":[110],"GA":[112],"provides":[113],"satisfactory":[114],"results":[115],"these":[117],"illustrative":[118],"examples.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-26T11:51:55.731654","created_date":"2022-05-12T00:00:00"}