{"id":"https://openalex.org/W1984146582","doi":"https://doi.org/10.1109/hpcs.2010.5547138","title":"Strategy of resource brokering for efficient parallelization of MLP training","display_name":"Strategy of resource brokering for efficient parallelization of MLP training","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1984146582","doi":"https://doi.org/10.1109/hpcs.2010.5547138","mag":"1984146582"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs.2010.5547138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs.2010.5547138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on High Performance Computing & Simulation","raw_type":"proceedings-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/A5050920253","display_name":"Volodymyr Turchenko","orcid":"https://orcid.org/0000-0003-3810-6970"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Volodymyr Turchenko","raw_affiliation_strings":["Department of Electronics, Informatics and Systems, University of Calabria, Rende, Cosenza, Italy","Department of Electronics, Informatics and Systems, University of Calabria via P. Bucci 41C, 87036, Rende (CS), Italy"],"affiliations":[{"raw_affiliation_string":"Department of Electronics, Informatics and Systems, University of Calabria, Rende, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Department of Electronics, Informatics and Systems, University of Calabria via P. Bucci 41C, 87036, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044280107","display_name":"Lucio Grandinetti","orcid":null},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Lucio Grandinetti","raw_affiliation_strings":["Department of Electronics, Informatics and Systems, University of Calabria, Rende, Cosenza, Italy","Department of Electronics, Informatics and Systems, University of Calabria via P. Bucci 41C, 87036, Rende (CS), Italy"],"affiliations":[{"raw_affiliation_string":"Department of Electronics, Informatics and Systems, University of Calabria, Rende, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Department of Electronics, Informatics and Systems, University of Calabria via P. Bucci 41C, 87036, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050920253"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.9021,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79141353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"140","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9607999920845032,"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/T10320","display_name":"Neural Networks and Applications","score":0.9607999920845032,"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/T13734","display_name":"Advanced Computational Techniques and Applications","score":0.9318000078201294,"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.8250895738601685},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6501350402832031},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5434638857841492},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.541970431804657},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5243000388145447},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.51636803150177},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4818495512008667},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.47962459921836853},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.436898410320282},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"Automatic parallelization","score":0.4331788420677185},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2943645119667053},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.25216978788375854},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15028035640716553}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8250895738601685},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6501350402832031},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5434638857841492},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.541970431804657},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5243000388145447},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.51636803150177},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4818495512008667},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.47962459921836853},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.436898410320282},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.4331788420677185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2943645119667053},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.25216978788375854},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15028035640716553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs.2010.5547138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs.2010.5547138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on High Performance Computing & Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1497291856","https://openalex.org/W1560903740","https://openalex.org/W1569198079","https://openalex.org/W1569512666","https://openalex.org/W1674669864","https://openalex.org/W1965218064","https://openalex.org/W1984734282","https://openalex.org/W1996234899","https://openalex.org/W1998876510","https://openalex.org/W2018198597","https://openalex.org/W2027999075","https://openalex.org/W2045259716","https://openalex.org/W2051622837","https://openalex.org/W2074449159","https://openalex.org/W2079960809","https://openalex.org/W2111713407","https://openalex.org/W2112205200","https://openalex.org/W2115750857","https://openalex.org/W2126154129","https://openalex.org/W2152551290","https://openalex.org/W2496571351","https://openalex.org/W4236435395","https://openalex.org/W6629850751","https://openalex.org/W6634326339","https://openalex.org/W6670552845"],"related_works":["https://openalex.org/W1976687121","https://openalex.org/W2166312568","https://openalex.org/W2947806671","https://openalex.org/W2390878257","https://openalex.org/W2764698212","https://openalex.org/W2107117001","https://openalex.org/W2945080676","https://openalex.org/W2013209581","https://openalex.org/W2103597754","https://openalex.org/W4200080306"],"abstract_inverted_index":{"A":[0,26],"strategy":[1,48,83],"of":[2,8,17,31,40,49,69,74,92,94,98,103],"resource":[3,50,81],"brokering":[4,51,82],"for":[5,37,62,66],"efficient":[6,67],"parallelization":[7,45,68,105],"the":[9,32,38,58,70,79,88,95,99,104,108],"parallel":[10,33],"batch":[11],"pattern":[12],"back":[13],"propagation":[14],"training":[15],"algorithm":[16,34,100],"a":[18],"multilayer":[19],"perceptron":[20],"is":[21,35,52],"presented":[22],"in":[23,107],"this":[24],"paper.":[25],"BSP-based":[27],"computational":[28],"cost":[29],"model":[30],"used":[36],"prediction":[39],"its":[41],"execution":[42,96],"time":[43,97],"and":[44],"efficiency.":[46],"The":[47,72],"based":[53],"on":[54],"Pareto":[55],"optimality":[56],"with":[57,87,101],"weighted":[59],"sum":[60],"approach":[61],"choosing":[63],"optimal":[64],"solutions":[65],"algorithm.":[71],"results":[73],"experimental":[75],"research":[76],"show":[77],"that":[78],"developed":[80],"has":[84],"good":[85],"conformity":[86],"desired":[89],"scheduling":[90],"policy":[91],"minimization":[93],"maximization":[102],"efficiency":[106],"most":[109],"economic":[110],"way.":[111]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}