{"id":"https://openalex.org/W247409750","doi":"https://doi.org/10.1109/12.8704","title":"Heuristic algorithms for task assignment in distributed systems","display_name":"Heuristic algorithms for task assignment in distributed systems","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W247409750","doi":"https://doi.org/10.1109/12.8704","mag":"247409750"},"language":"en","primary_location":{"id":"doi:10.1109/12.8704","doi":"https://doi.org/10.1109/12.8704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/12.8704","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"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"},"volume":null,"type":"article","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/A5024401263","display_name":"Virginia M. Lo","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V.M. Lo","raw_affiliation_strings":["Department of Computer and Information Science, University of Oregon, Eugene, OR, USA","Dept. of Comput. & Inf. Sci., Oregon Univ., Eugene, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Oregon, Eugene, OR, USA","institution_ids":["https://openalex.org/I181233156"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Oregon Univ., Eugene, OR, USA","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024401263"],"corresponding_institution_ids":["https://openalex.org/I181233156"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":15.7314,"has_fulltext":false,"cited_by_count":444,"citation_normalized_percentile":{"value":0.98992612,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"37","issue":"11","first_page":"1384","last_page":"1397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9404000043869019,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9404000043869019,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.015699999406933784,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.006300000008195639,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/distributed-computing","display_name":"distributed computing","score":0.6480000019073486},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.9319999814033508},{"id":"https://openalex.org/keywords/communication-overhead","display_name":"communication overhead","score":0.6159999966621399},{"id":"https://openalex.org/keywords/concurrency","display_name":"concurrency","score":0.5730000138282776},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.6460000276565552},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.5759999752044678}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8167961239814758},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.694368839263916},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6498069763183594},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6295771598815918},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5701497197151184},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5186428427696228},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5158202052116394},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.495324045419693},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4844363033771515},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.44038888812065125},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.4327920377254486},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4305822253227234},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4277417063713074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28419017791748047},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25702977180480957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.145516037940979},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08992761373519897},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08611497282981873},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/12.8704","doi":"https://doi.org/10.1109/12.8704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/12.8704","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"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"},{"id":"mag:247409750","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icdcs/icdcs84.html#Lo84","pdf_url":null,"source":{"id":"https://openalex.org/S4306419352","display_name":"International Conference on Distributed Computing Systems","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Distributed Computing Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W6050265","https://openalex.org/W1487184349","https://openalex.org/W1494018018","https://openalex.org/W2008646959","https://openalex.org/W2009480555","https://openalex.org/W2022142019","https://openalex.org/W2022396748","https://openalex.org/W2025896589","https://openalex.org/W2051249422","https://openalex.org/W2067936976","https://openalex.org/W2077340723","https://openalex.org/W2085412609","https://openalex.org/W2090189305","https://openalex.org/W2105543662","https://openalex.org/W2151408086","https://openalex.org/W2249893173","https://openalex.org/W3139993281"],"related_works":["https://openalex.org/W2017020681","https://openalex.org/W2126706960","https://openalex.org/W7096874847","https://openalex.org/W2942552175","https://openalex.org/W2084395877","https://openalex.org/W2091378693","https://openalex.org/W1981908252","https://openalex.org/W2005172784","https://openalex.org/W2331291299","https://openalex.org/W1667850907"],"abstract_inverted_index":{"Investigate":[0],"the":[1,55,58,80,105,132,141,160,168],"problem":[2],"of":[3,15,26,42,49,57,82,95,114,128,143],"static":[4],"task":[5,34],"assignment":[6],"in":[7,131,165],"distributed":[8,24,122],"computing":[9],"systems,":[10],"i.e.":[11],"given":[12],"a":[13,23,40,93,112,153],"set":[14],"k":[16],"communicating":[17,50],"tasks":[18,51,149],"to":[19,29,74,101,104,120,146,150],"be":[20,35,102,121],"executed":[21],"on":[22],"system":[25],"n":[27],"processors,":[28],"which":[30,78],"processor":[31],"should":[32],"each":[33],"assigned?":[36],"The":[37,126],"author":[38],"proposes":[39],"family":[41],"heuristic":[43,181],"algorithms":[44,161],"for":[45],"Stone's":[46,144],"classic":[47],"model":[48,73,133,145],"whose":[52],"goal":[53],"is":[54],"minimization":[56],"total":[59],"execution":[60],"and":[61,164],"communication":[62,89],"costs":[63,77,90,109,130],"incurred":[64],"by":[65],"an":[66],"assignment.":[67],"In":[68],"addition,":[69],"she":[70],"augments":[71],"this":[72],"include":[75],"interference":[76,108,129],"reflect":[79],"degree":[81],"incompatibility":[83],"between":[84,97,116],"two":[85],"tasks.":[86],"Whereas":[87],"high":[88],"serve":[91,110],"as":[92,111,176,178],"force":[94,113],"attraction":[96],"tasks,":[98,117],"causing":[99,118],"them":[100,119],"assigned":[103],"same":[106],"processor,":[107],"repulsion":[115],"over":[123],"many":[124],"processors.":[125,155],"inclusion":[127],"yields":[134],"assignments":[135],"with":[136],"greater":[137],"concurrency,":[138],"thus":[139],"overcoming":[140],"tendency":[142],"assign":[147],"all":[148],"one":[151],"or":[152],"few":[154],"Simulation":[156],"results":[157],"show":[158],"that":[159,167],"perform":[162],"well":[163,177],"particular,":[166],"highly":[169],"efficient":[170],"Simple":[171],"Greedy":[172],"Algorithm":[173],"performs":[174],"almost":[175],"more":[179],"complex":[180],"algorithms.>":[182]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":15}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}