{"id":"https://openalex.org/W2090189305","doi":"https://doi.org/10.1109/tc.1985.1676563","title":"A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion","display_name":"A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion","publication_year":1985,"publication_date":"1985-03-01","ids":{"openalex":"https://openalex.org/W2090189305","doi":"https://doi.org/10.1109/tc.1985.1676563","mag":"2090189305"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1985.1676563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.1676563","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5111988402","display_name":"Chien-Chung Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chien-Chung Shen","raw_affiliation_strings":["Institute of Computer Engineering, National Chiao Tung University"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Engineering, National Chiao Tung University","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102160275","display_name":"Wen\u2010Hsiang Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wen-Hsiang Tsai","raw_affiliation_strings":["Institute of Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan","[Institute of Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan]"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"[Institute of Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan]","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111988402"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":11.7485,"has_fulltext":false,"cited_by_count":337,"citation_normalized_percentile":{"value":0.98561983,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"C-34","issue":"3","first_page":"197","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9993000030517578,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9987000226974487,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.7155319452285767},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.715416431427002},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6853085160255432},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.5372258424758911},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5165873765945435},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.479645311832428},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47450679540634155},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44029441475868225},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.43881455063819885},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.429312527179718},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4221193492412567},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3842165172100067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3672308325767517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22189590334892273},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14214128255844116}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7155319452285767},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.715416431427002},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6853085160255432},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.5372258424758911},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5165873765945435},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.479645311832428},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47450679540634155},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44029441475868225},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.43881455063819885},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.429312527179718},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4221193492412567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3842165172100067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3672308325767517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22189590334892273},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14214128255844116},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1985.1676563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.1676563","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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":17,"referenced_works":["https://openalex.org/W1486083926","https://openalex.org/W1971978556","https://openalex.org/W1977774371","https://openalex.org/W2008646959","https://openalex.org/W2022142019","https://openalex.org/W2022272738","https://openalex.org/W2022396748","https://openalex.org/W2025896589","https://openalex.org/W2045527716","https://openalex.org/W2051249422","https://openalex.org/W2059690541","https://openalex.org/W2067936976","https://openalex.org/W2073067110","https://openalex.org/W2077340723","https://openalex.org/W2090189305","https://openalex.org/W2149724016","https://openalex.org/W2160645305"],"related_works":["https://openalex.org/W2358965113","https://openalex.org/W1966664777","https://openalex.org/W2800185592","https://openalex.org/W2067336310","https://openalex.org/W2074638575","https://openalex.org/W2565453737","https://openalex.org/W2317016566","https://openalex.org/W3016821709","https://openalex.org/W2893020844","https://openalex.org/W2561372086"],"abstract_inverted_index":{"A":[0,20,60],"graph":[1,146],"matching":[2],"approach":[3,89],"is":[4,31,68,111,140,162,171,191],"proposed":[5,32,88,101],"in":[6,16,24,56,179],"this":[7],"paper":[8],"for":[9,33,47,97,186],"solving":[10],"the":[11,35,44,58,65,100,105,119,127,175,189,205,208],"task":[12,38,49,109,125,160],"assignment":[13,110,136,161],"problem":[14],"encountered":[15],"distributed":[17,132],"computing":[18,133],"systems.":[19],"cost":[21,41,102],"function":[22,42,103],"defined":[23],"terms":[25],"of":[26,37,76,81,122,130,145,153,207],"a":[27,48,123,131,143,166],"single":[28],"unit,":[29],"time,":[30],"evaluating":[34],"effectiveness":[36,206],"assignment.":[39],"This":[40],"represents":[43],"maximum":[45],"time":[46],"to":[50,94,117,137,158,203],"complete":[51],"module":[52,120],"execution":[53],"and":[54,79,104,126,196],"communication":[55,78],"all":[57],"processors.":[59],"new":[61],"optimization":[62],"criterion,":[63,67,107],"called":[64,148],"minimax":[66,106],"also":[69,201],"proposed,":[70],"based":[71],"on":[72],"which":[73],"both":[74],"minimization":[75],"interprocessor":[77],"balance":[80],"processor":[82,128],"loading":[83],"can":[84],"be":[85,95],"achieved.":[86],"The":[87,151],"allows":[90],"various":[91],"system":[92,138],"constraints":[93],"included":[96,202],"consideration.":[98],"With":[99],"optimal":[108,154,159],"defined.":[112],"Graphs":[113],"are":[114,200],"then":[115,172],"used":[116],"represent":[118],"relationship":[121],"given":[124],"structure":[129],"system.":[134],"Module":[135],"processors":[139],"transformed":[141],"into":[142],"type":[144],"matching,":[147],"weak":[149,155],"homomorphism.":[150],"search":[152,168,190],"homomorphism":[156],"corresponding":[157],"next":[163],"formulated":[164],"as":[165],"state-space":[167],"problem.":[169],"It":[170],"solved":[173],"by":[174],"well-known":[176],"A*":[177],"algorithm":[178],"artificial":[180],"intelligence":[181],"after":[182],"proper":[183],"heuristic":[184,209],"information":[185],"speeding":[187],"up":[188],"suggested.":[192],"An":[193],"illustrative":[194],"example":[195],"some":[197],"experimental":[198],"results":[199],"show":[204],"search.":[210]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":13}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}