{"id":"https://openalex.org/W1986517065","doi":"https://doi.org/10.1080/10637199508915525","title":"ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING","display_name":"ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1986517065","doi":"https://doi.org/10.1080/10637199508915525","mag":"1986517065"},"language":"en","primary_location":{"id":"doi:10.1080/10637199508915525","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915525","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-0500, USA","\u2020 University of Nebraska, Omaha;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Nebraska at Omaha , Omaha, NE 68182-0500, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"\u2020 University of Nebraska, Omaha;","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-0500, USA","Computer Science"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Nebraska at Omaha , Omaha, NE 68182-0500, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Computer Science","institution_ids":[]}]}],"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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10251341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"1-2","first_page":"107","last_page":"119"},"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.9994999766349792,"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.9994999766349792,"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.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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/loop-unrolling","display_name":"Loop unrolling","score":0.9865564703941345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7896420955657959},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5076895952224731},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47228723764419556},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1655542254447937},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0978078842163086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09651103615760803},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.09618327021598816}],"concepts":[{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.9865564703941345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7896420955657959},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5076895952224731},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47228723764419556},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1655542254447937},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0978078842163086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09651103615760803},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.09618327021598816}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199508915525","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915525","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W325986762","https://openalex.org/W634463279","https://openalex.org/W1484040084","https://openalex.org/W1522370717","https://openalex.org/W1534741631","https://openalex.org/W1536051636","https://openalex.org/W1556711032","https://openalex.org/W1601372155","https://openalex.org/W1837593827","https://openalex.org/W1973538756","https://openalex.org/W1996256520","https://openalex.org/W2057392949","https://openalex.org/W2067945058","https://openalex.org/W2092333800","https://openalex.org/W2098596217","https://openalex.org/W2099736035","https://openalex.org/W2119560736","https://openalex.org/W4232496889"],"related_works":["https://openalex.org/W2093143612","https://openalex.org/W2156140864","https://openalex.org/W2921290383","https://openalex.org/W2383874519","https://openalex.org/W1985751298","https://openalex.org/W2370568399","https://openalex.org/W2068352344","https://openalex.org/W2902243168","https://openalex.org/W2766021003","https://openalex.org/W2490154600"],"abstract_inverted_index":{"In":[0],"this":[1,57],"paper,":[2],"we":[3],"study":[4],"the":[5,18,23,73,98,115],"problem":[6],"of":[7,25,100],"scheduling":[8,40,94],"loop":[9,26,33,36,66,102],"task":[10,37,70],"graphs":[11],"onto":[12],"two":[13,44],"processor":[14],"systems":[15],"to":[16,28],"minimize":[17],"execution":[19],"lime.":[20],"We":[21,60,106],"use":[22],"idea":[24],"unrolling":[27,49,58,67,91,103,117],"uncover":[29],"dependence":[30],"among":[31],"different":[32],"iterations":[34],"in":[35,77],"graphs.":[38],"The":[39],"is":[41,104],"divided":[42],"into":[43],"stages:":[45],"determining":[46],"an":[47,53],"optimal":[48,54,65,90,101],"factor,":[50],"and":[51,110],"constructing":[52],"schedule":[55],"for":[56,64,68,88],"factor.":[59,118],"propose":[61],"a":[62,78,85],"criterion":[63],"unit-delay":[69],"graphs,":[71],"where":[72],"tasks":[74],"are":[75],"enclosed":[76],"single":[79],"loop.":[80],"Our":[81],"main":[82],"theorem":[83],"presents":[84],"useful":[86],"test":[87],"detecting":[89],"factors.":[92],"A":[93],"algorithm":[95],"that":[96],"employs":[97],"concept":[99],"introduced.":[105],"also":[107],"present":[108],"serial":[109],"parallel":[111],"algorithms":[112],"lo":[113],"find":[114],"best":[116]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}