{"id":"https://openalex.org/W2049821450","doi":"https://doi.org/10.1080/10637199408962536","title":"ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS","display_name":"ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2049821450","doi":"https://doi.org/10.1080/10637199408962536","mag":"2049821450"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408962536","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408962536","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/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":true,"raw_author_name":"HESHAM EL-REWINI","raw_affiliation_strings":["Department of Computer Science , University of Nebraska at Omaha , Omaha, NE, 68182, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Nebraska at Omaha , Omaha, NE, 68182, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","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":false,"raw_author_name":"HESHAM H. ALI","raw_affiliation_strings":["Department of Computer Science , University of Nebraska at Omaha , Omaha, NE, 68182, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Nebraska at Omaha , Omaha, NE, 68182, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054669233"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":1.1235,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79690794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"3-4","first_page":"177","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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.7618756890296936},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5148876905441284},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4821488559246063},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.47932565212249756},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4564708173274994},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4428797960281372},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.40706774592399597},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34151023626327515},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3332139253616333},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.28943291306495667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26519864797592163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17312663793563843}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7618756890296936},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5148876905441284},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4821488559246063},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.47932565212249756},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4564708173274994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4428797960281372},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.40706774592399597},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34151023626327515},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3332139253616333},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.28943291306495667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26519864797592163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17312663793563843},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408962536","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408962536","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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":13,"referenced_works":["https://openalex.org/W205453288","https://openalex.org/W1585751115","https://openalex.org/W1973538756","https://openalex.org/W1998978603","https://openalex.org/W2027077493","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2066129337","https://openalex.org/W2067945058","https://openalex.org/W2074762232","https://openalex.org/W2092333800","https://openalex.org/W2147417089","https://openalex.org/W2152408640"],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2956094179","https://openalex.org/W2106332846","https://openalex.org/W2245286458","https://openalex.org/W27741389","https://openalex.org/W2541348386","https://openalex.org/W1570967612","https://openalex.org/W2182592860","https://openalex.org/W2172075652","https://openalex.org/W2369829641"],"abstract_inverted_index":{"ABSTRACT":[0],"The":[1,44,71],"problem":[2,37,48,75,94,137,140,187,204],"of":[3,35,46,73,91,120,127,141,148,156,188,205,230,239],"scheduling":[4,93,136,166,176,189],"task":[5,150,158,179,192,220],"graphs":[6,159],"on":[7,78,118,130,196,224],"multiprocessor":[8],"systems":[9],"is":[10,42,56,82,173],"known":[11],"to":[12,66,84,99,175,202,215],"be":[13,100,200],"NP-complete":[14,101],"in":[15,145,163],"its":[16,231],"general":[17],"form":[18],"as":[19,21],"well":[20],"many":[22],"restricted":[23],"cases.":[24],"Few":[25],"polynomial":[26,213],"algorithms":[27],"have":[28,61],"been":[29,62],"developed":[30],"for":[31],"solving":[32],"special":[33],"cases":[34,165],"this":[36,108],"when":[38,52],"the":[39,47,68,74,86,92,113,125,131,134,139,146,149,154,177,186,203,228,237,240],"communication":[40,53,69,87,96,115,129,172,195,223],"cost":[41,80,88],"ignored.":[43],"complexity":[45,72],"rises":[49],"even":[50],"further":[51],"among":[54],"tasks":[55],"considered.":[57],"Several":[58,89],"different":[59,103,114],"models":[60,104],"used":[63,83],"by":[64,227],"researchers":[65],"compute":[67],"cost.":[70],"changes":[76],"based":[77],"which":[79],"model":[81],"estimate":[85],"versions":[90],"with":[95,181,194,222],"were":[97],"proven":[98],"using":[102],"[10,":[105],"11].":[106],"In":[107],"paper,":[109],"we":[110,123],"first":[111],"Survey":[112],"models.":[116],"Focusing":[117],"one":[119],"these":[121],"models,":[122],"study":[124],"effect":[126],"considering":[128,171],"relationship":[132],"between":[133],"two-processor":[135],"and":[138,160],"finding":[142],"maximum":[143],"matching":[144],"complement":[147],"graph":[151,169,180,193,221,233],"We":[152,183,210],"introduce":[153,211],"idea":[155],"augmented":[157,168,208,232],"show":[161,184],"that":[162,185],"some":[164],"an":[167,190,207],"without":[170],"equivalent":[174],"original":[178],"communication.":[182],"arbitrary":[191],"two":[197,225],"processors":[198,226],"can":[199],"reduced":[201],"constructing":[206],"graph.":[209],"a":[212,218],"algorithm":[214],"optimally":[216,238],"schedule":[217],"tree-structured":[219],"construction":[229],"e":[234],"also":[235],"prove":[236],"introduced":[241],"algorithm.":[242]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}