{"id":"https://openalex.org/W313411071","doi":null,"title":"A communication-ordered task graph allocation algorithm","display_name":"A communication-ordered task graph allocation algorithm","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W313411071","mag":"313411071"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.3893","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utah.edu/techreports/1992/pdf/UUCS-92-026.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5016099408","display_name":"John Andrew Evans","orcid":"https://orcid.org/0000-0002-1973-1458","observed_orcids":["https://orcid.org/0000-0002-1973-1458"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John A. Evans","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1973-1458","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044206744","display_name":"Robert R. Kessler","orcid":"https://orcid.org/0009-0000-4625-811X","observed_orcids":["https://orcid.org/0009-0000-4625-811X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert R. Kessler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4646,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60978044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7163000106811523,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7163000106811523,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.263700008392334,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.0024999999441206455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/static-task-allocation","display_name":"static task allocation","score":0.7929999828338623},{"id":"https://openalex.org/keywords/communication-cost-minimization","display_name":"communication cost minimization","score":0.8149999976158142},{"id":"https://openalex.org/keywords/parallel-scheduling","display_name":"parallel scheduling","score":0.4860000014305115},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.6520000100135803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6069339513778687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5026845932006836},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49665766954421997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4556754529476166},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3593040108680725},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09217393398284912},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.3893","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utah.edu/techreports/1992/pdf/UUCS-92-026.pdf","raw_type":"text"},{"id":"mag:313411071","doi":null,"is_oa":false,"landing_page_url":"https://collections.lib.utah.edu/dl_files/c0/cd/c0cdd8deedd79fe59bef00ba58709730b6c7ef02.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":15,"referenced_works":["https://openalex.org/W43570251","https://openalex.org/W79185306","https://openalex.org/W82085062","https://openalex.org/W212689908","https://openalex.org/W213174430","https://openalex.org/W1963483878","https://openalex.org/W1978662106","https://openalex.org/W1982109271","https://openalex.org/W2000533899","https://openalex.org/W2019820705","https://openalex.org/W2022272738","https://openalex.org/W2025082736","https://openalex.org/W2027662813","https://openalex.org/W2068104438","https://openalex.org/W2149724016"],"related_works":["https://openalex.org/W2267998431","https://openalex.org/W121821274","https://openalex.org/W1596042904","https://openalex.org/W191946773","https://openalex.org/W4234713419","https://openalex.org/W1534770290","https://openalex.org/W2992549705","https://openalex.org/W148424458","https://openalex.org/W6903554737","https://openalex.org/W36753261"],"abstract_inverted_index":{"The":[0,41],"inherently":[1],"asynchronous":[2],"nature":[3],"of":[4,13,38,45,58,88,96,99],"the":[5,11,56,86,94],"data":[6],"flow":[7],"computation":[8,108],"model":[9,22],"allows":[10],"exploitation":[12],"maximum":[14,67],"parallelism":[15,68],"in":[16,31,85],"program":[17,39],"execution.":[18],"While":[19],"this":[20],"computational":[21],"holds":[23],"great":[24],"promise,":[25],"several":[26],"problems":[27],"must":[28],"be":[29,69,84],"solved":[30],"order":[32],"to":[33,83,101],"achieve":[34],"a":[35,112],"high":[36],"degree":[37],"performance.":[40],"allocation":[42,98],"and":[43,75,79,109],"scheduling":[44],"programs":[46],"on":[47],"MIMD":[48,104],"distributed":[49,102],"memory":[50,103],"parallel":[51,60],"hardware,":[52],"is":[53,111],"necessary":[54],"for":[55],"implementation":[57],"efficient":[59],"systems.":[61],"Finding":[62],"optimal":[63],"solutions":[64],"requires":[65],"that":[66],"achieved":[70],"consistent":[71],"with":[72],"resource":[73],"limits":[74],"minimizing":[76],"communication":[77,110],"costs,":[78],"has":[80],"been":[81],"proven":[82],"class":[87],"NP-complete":[89],"problems.":[90],"This":[91],"paper":[92],"addresses":[93],"problem":[95],"static":[97],"tasks":[100],"systems":[105],"where":[106],"simultaneous":[107],"factor.":[113]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}