{"id":"https://openalex.org/W2063721323","doi":"https://doi.org/10.1142/s0129626494000168","title":"ON THE INTRACTABILITY OF TASK ALLOCATION IN DISTRIBUTED SYSTEMS","display_name":"ON THE INTRACTABILITY OF TASK ALLOCATION IN DISTRIBUTED SYSTEMS","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W2063721323","doi":"https://doi.org/10.1142/s0129626494000168","mag":"2063721323"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626494000168","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000168","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5047703641","display_name":"Hesham Ali","orcid":"https://orcid.org/0000-0001-6675-7987"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HESHAM H. ALI","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054669233","display_name":"Hesham El\u2010Rewini","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"HESHAM EL-REWINI","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182-0243, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182-0243, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047703641"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.5347,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72746897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"01n02","first_page":"149","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.785327672958374},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.750159740447998},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5350974798202515},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5345100164413452},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5011818408966064},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.49306532740592957},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4813735783100128},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4524669349193573},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.41777175664901733},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39856967329978943},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33445316553115845},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3222464323043823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16025397181510925},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.09672707319259644}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.785327672958374},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.750159740447998},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5350974798202515},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5345100164413452},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5011818408966064},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.49306532740592957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4813735783100128},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4524669349193573},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.41777175664901733},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39856967329978943},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33445316553115845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3222464323043823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16025397181510925},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.09672707319259644},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626494000168","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000168","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W4285171291","https://openalex.org/W2162082186","https://openalex.org/W2951533720","https://openalex.org/W2389368518"],"abstract_inverted_index":{"The":[0],"fast":[1],"progress":[2],"of":[3,21,76,96,102,113,129,145,162,185,203,221,237],"large":[4],"integration":[5],"technology":[6],"has":[7,33],"made":[8],"distributed":[9,29,167],"computing":[10,30],"economically":[11],"attractive":[12],"for":[13],"many":[14],"computer":[15],"applications.":[16],"Task":[17],"allocation":[18,105,131,180,205,250],"is":[19,55,132,229,252],"one":[20],"the":[22,51,77,90,100,103,127,136,146,147,160,178,183,201,207,213,219,235,242,248,258],"most":[23],"important":[24],"and":[25,69],"challenging":[26],"problems":[27],"in":[28,37,89,135,189,206,225],"systems":[31,168],"that":[32,53,109,126,218,247],"received":[34],"considerable":[35],"attention":[36],"recent":[38],"years.":[39],"Several":[40],"researchers":[41,59],"have":[42,60],"introduced":[43],"different":[44],"heuristics":[45],"to":[46,63,99,158,176,199],"solve":[47],"this":[48,120],"problem":[49,128,161,181,184,220,236,251],"with":[50,182],"assumption":[52],"it":[54],"computationally":[56],"intractable.":[57],"These":[58],"been":[61],"referring":[62],"an":[64],"early":[65],"work":[66,88],"by":[67],"Stone":[68],"some":[70],"private":[71],"communication":[72,148],"as":[73],"their":[74],"sources":[75],"problem\u2019s":[78],"intractability.":[79,97],"However,":[80],"neither":[81],"Stone\u2019s":[82],"paper":[83,121],"nor":[84],"any":[85],"other":[86],"related":[87],"literature":[91],"provided":[92],"a":[93,110,124,155,195,232,255],"formal":[94,111],"proof":[95,112,125],"Due":[98],"importance":[101],"task":[104,130,179,204,249],"problem,":[106],"we":[107,122,216,245],"believe":[108],"its":[114],"complexity":[115],"must":[116],"be":[117],"provided.":[118],"In":[119,212,241],"provide":[123,194],"intractable":[133],"even":[134],"restricted":[137,208],"case":[138,209],"when":[139],"there":[140],"are":[141],"only":[142],"two":[143],"values":[144],"cost:":[149],"zero":[150],"or":[151],"one.":[152],"We":[153,193],"introduce":[154],"new":[156],"model":[157,173],"represent":[159],"allocating":[163],"tasks":[164],"on":[165],"heterogeneous":[166],"using":[169,231,254],"split":[170,191,227],"graphs.":[171,192],"This":[172],"allows":[174],"us":[175],"relate":[177],"weighted":[186,222,259],"clique":[187,223,260],"partitioning":[188,224,261],"complete":[190,226],"two-step":[196],"reduction":[197],"method":[198],"prove":[200,217],"intractability":[202],"mentioned":[210],"above.":[211],"first":[214],"step,":[215,244],"graph":[228],"NP-complete":[230,253],"transformation":[233,256],"from":[234,257],"partition":[238],"into":[239],"triangles.":[240],"second":[243],"show":[246],"problem.":[262]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}