{"id":"https://openalex.org/W2046844867","doi":"https://doi.org/10.1002/cpe.4330020204","title":"A step\u2010wise\u2010overlapped parallel annealing algorithm on a message\u2010passing multiprocessor system","display_name":"A step\u2010wise\u2010overlapped parallel annealing algorithm on a message\u2010passing multiprocessor system","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2046844867","doi":"https://doi.org/10.1002/cpe.4330020204","mag":"2046844867"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330020204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330020204","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/A5061378632","display_name":"Young\u2010Tak Kim","orcid":"https://orcid.org/0000-0001-8664-4234"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Youngtak Kim","raw_affiliation_strings":["Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) P. O. Box 150, Cheongyang, Seoul 130-650, Korea","Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) P. O. Box 150, Cheongyang, Seoul 130\u2010650, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) P. O. Box 150, Cheongyang, Seoul 130-650, Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) P. O. Box 150, Cheongyang, Seoul 130\u2010650, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519586","display_name":"Myung-Hwan Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Myunghwan Kim","raw_affiliation_strings":["School of Electrical Engineering Cornell University Ithaca, New York 14853, USA","School of Electrical Engineering, Cornell University, Ithaca, New York\u200914853 USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering Cornell University Ithaca, New York 14853, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"School of Electrical Engineering, Cornell University, Ithaca, New York\u200914853 USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061378632"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.4713,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71050455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"2","first_page":"123","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9926999807357788,"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/simulated-annealing","display_name":"Simulated annealing","score":0.7912461757659912},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7703163623809814},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7653396129608154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.733056366443634},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6235053539276123},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5964983105659485},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5909906029701233},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5899606943130493},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5213305354118347},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.501755952835083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5004079341888428},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.49618014693260193},{"id":"https://openalex.org/keywords/annealing","display_name":"Annealing (glass)","score":0.43096572160720825},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.10664620995521545}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7912461757659912},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7703163623809814},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7653396129608154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.733056366443634},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6235053539276123},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5964983105659485},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5909906029701233},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5899606943130493},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5213305354118347},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.501755952835083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5004079341888428},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.49618014693260193},{"id":"https://openalex.org/C2777855556","wikidata":"https://www.wikidata.org/wiki/Q4339544","display_name":"Annealing (glass)","level":2,"score":0.43096572160720825},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.10664620995521545},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330020204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330020204","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W129209152","https://openalex.org/W1593394816","https://openalex.org/W1596092670","https://openalex.org/W1964286413","https://openalex.org/W2021730381","https://openalex.org/W2023940388","https://openalex.org/W2024060531","https://openalex.org/W2039698161","https://openalex.org/W2040630985","https://openalex.org/W2042986967","https://openalex.org/W2089452364","https://openalex.org/W2114552889","https://openalex.org/W3016761995","https://openalex.org/W3139666781"],"related_works":["https://openalex.org/W3093207677","https://openalex.org/W2162737912","https://openalex.org/W1997332808","https://openalex.org/W2753964365","https://openalex.org/W2221439609","https://openalex.org/W2028685923","https://openalex.org/W2963531223","https://openalex.org/W3046001238","https://openalex.org/W2892294903","https://openalex.org/W2075324938"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"proposes":[3],"a":[4,16,20,24,89,95,112,152,165,179,184,191],"parallel":[5,10,32,108,126,139],"annealing":[6,11,33,86,109,127,140],"algorithm,":[7],"called":[8],"step\u2010wise\u2010overlapped":[9,138],",":[12],"that":[13,39],"can":[14,174],"provide":[15],"massive":[17],"speed\u2010up":[18],"utilizing":[19],"multiprocessor":[21,181],"system":[22,182],"with":[23,94,164,183],"large":[25,96,153,185],"number":[26,97,154,186],"of":[27,35,47,62,70,79,98,124,131,136,155,167,187],"processors.":[28,99,172],"We":[29,100],"improve":[30],"the":[31,36,48,56,60,67,71,75,80,84,103,137,143],"scheme":[34],"systolic":[37],"algorithm":[38,110,128],"was":[40],"proposed":[41],"by":[42,169],"Aart":[43],"et":[44],"al.":[45],"Instead":[46],"temperature":[49,91],"decrement":[50,57],"at":[51,59],"each":[52,63],"subchain,":[53],"it":[54,159],"decides":[55],"ratio":[58],"start":[61],"Markov":[64,77],"chain":[65,78],"using":[66,170],"standard":[68],"deviation":[69],"cost":[72],"distribution":[73],"in":[74],"previous":[76],"full":[81],"length.":[82],"Thus":[83],"improved":[85],"schedule":[87],"keeps":[88],"good":[90],"profile":[92],"even":[93,150],"also":[101],"enhance":[102],"communication":[104,114,119],"pattern.":[105],"The":[106,121],"new":[107],"has":[111],"simple":[113],"pattern":[115],"and":[116],"thus":[117],"less":[118],"overheads.":[120],"decomposition":[122],"strategy":[123],"this":[125],"is":[129],"independent":[130],"application":[132],"problems.":[133],"Experimental":[134],"results":[135],"algorthm":[141],"for":[142],"travelling":[144],"salesman":[145],"problems":[146],"show":[147],"high":[148],"efficiencies":[149],"when":[151],"processors":[156],"are":[157],"used;":[158],"produces":[160],"near":[161],"optimal":[162],"solutions":[163],"speedup":[166],"70.8":[168],"128":[171],"It":[173],"be":[175],"implemented":[176],"efficiently":[177],"on":[178],"message\u2010passing":[180],"processors,":[188],"such":[189],"as":[190],"hypercube":[192],"computer.":[193]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}