{"id":"https://openalex.org/W1971621805","doi":"https://doi.org/10.1137/s009753979834610x","title":"Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads","display_name":"Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1971621805","doi":"https://doi.org/10.1137/s009753979834610x","mag":"1971621805"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979834610x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979834610x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5056980887","display_name":"Waleed Meleis","orcid":"https://orcid.org/0000-0003-4158-6071"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Waleed M. Meleis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5056980887"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1606,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79309355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"6","first_page":"1921","last_page":"1941"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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.9973999857902527,"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/computer-science","display_name":"Computer science","score":0.7292479872703552},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.652908205986023},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5957739353179932},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.594190239906311},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5687877535820007},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5091912150382996},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4819497764110565},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.39052215218544006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24684226512908936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23551854491233826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22652000188827515},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09317106008529663}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7292479872703552},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.652908205986023},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5957739353179932},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.594190239906311},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5687877535820007},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5091912150382996},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4819497764110565},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.39052215218544006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24684226512908936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23551854491233826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22652000188827515},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09317106008529663},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s009753979834610x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979834610x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":39,"referenced_works":["https://openalex.org/W163216920","https://openalex.org/W1977580236","https://openalex.org/W1991589299","https://openalex.org/W1992401193","https://openalex.org/W1994137996","https://openalex.org/W1998763232","https://openalex.org/W2003804316","https://openalex.org/W2023200270","https://openalex.org/W2024598204","https://openalex.org/W2026539022","https://openalex.org/W2027077493","https://openalex.org/W2031533676","https://openalex.org/W2044304745","https://openalex.org/W2044636417","https://openalex.org/W2048936605","https://openalex.org/W2056304107","https://openalex.org/W2057392949","https://openalex.org/W2066202680","https://openalex.org/W2069329354","https://openalex.org/W2070053315","https://openalex.org/W2072929215","https://openalex.org/W2081692214","https://openalex.org/W2087843505","https://openalex.org/W2088579057","https://openalex.org/W2092333800","https://openalex.org/W2100139716","https://openalex.org/W2117720131","https://openalex.org/W2121619519","https://openalex.org/W2136693413","https://openalex.org/W2137300667","https://openalex.org/W2142550124","https://openalex.org/W2159003768","https://openalex.org/W2171595223","https://openalex.org/W2607786361","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W3148529197","https://openalex.org/W4251068092","https://openalex.org/W4252424613"],"related_works":["https://openalex.org/W2117014006","https://openalex.org/W4233815414","https://openalex.org/W2372170743","https://openalex.org/W2779562428","https://openalex.org/W1558545464","https://openalex.org/W1977216575","https://openalex.org/W2388194743","https://openalex.org/W2068829429","https://openalex.org/W2089348006","https://openalex.org/W1977602459"],"abstract_inverted_index":{"We":[0,141],"describe":[1],"an":[2],"algorithm":[3],"that":[4,17,36,143],"finds":[5],"a":[6,14,31,41,58,67,74,136,172],"minimum":[7,235],"cost":[8,170],"schedule,":[9],"including":[10],"spill":[11,111],"code,":[12],"for":[13,89],"register-constrained":[15],"machine":[16],"can":[18],"issue":[19],"up":[20],"to":[21,156,180],"one":[22,26],"arithmetic":[23,46,202],"operation":[24,29],"and":[25,47,53,97,106,113,120,128,159,210],"memory":[27],"access":[28],"at":[30],"time,":[32],"under":[33],"the":[34,37,144,152,162,167,192,199,206,213,219],"restrictions":[35],"dependence":[38],"graph":[39],"is":[40,73,147,151,161,178,191,198,205,212],"full":[42],"binary":[43,90],"tree,":[44],"all":[45,54,63,225],"store":[48],"operations":[49,56,65,155],"have":[50,57,66,234],"unit":[51],"latency,":[52],"load":[55,64],"latency":[59,68],"of":[60,69,76,139,154,164,171,194,201,208,215],"1":[61],"or":[62],"2.":[70],"This":[71],"problem":[72],"generalization":[75],"two":[77],"problems":[78],"whose":[79],"efficient":[80],"solutions":[81],"are":[82],"well":[83],"understood:":[84],"optimaldual-issue":[85],"scheduling":[86,109],"without":[87],"spills":[88,165],"expression":[91],"trees,":[92],"solved":[93,116],"by":[94,117],"Bernstein,":[95],"Jaffe,":[96],"Rodeh":[98],"[SIAM":[99],"J.":[100],"Comput.,":[101],"18":[102],"(1989),":[103],"pp.":[104,132],"1098--1127],":[105],"optimal":[107,230],"single-issue":[108],"with":[110],"code":[112],"delayed":[114],"loads,":[115],"Kurlander,":[118],"Proebsting,":[119],"Fischer":[121],"[":[122],"ACM":[123],"Transactions":[124],"on":[125],"Programming":[126],"Languages":[127],"Systems,":[129],"17":[130],"(1995),":[131],"740--776],":[133],"both":[134],"assuming":[135],"fixed":[137],"number":[138,153,163,193,200,207,214],"registers.":[140],"show":[142],"algorithm's":[145],"complexity":[146],"O(nk)":[148],"where":[149,189],"n":[150],"be":[157,181],"scheduled":[158],"k":[160,204],"in":[166,218],"schedule.":[168,223],"The":[169],"\"contiguous\"":[173],"schedule":[174],"(i.e.,":[175],"its":[176],"length)":[177],"shown":[179],"$\\rho":[182],"+":[183,185,187],"2k":[184],"g":[186,211],"|A|$,":[188],"$\\rho$":[190],"registers":[195],"used,":[196],"|A|":[197],"operations,":[203],"spills,":[209],"empty":[216],"slots":[217],"associated":[220],"single":[221,231],"processor":[222,232],"Therefore":[224],"contiguous":[226],"schedules":[227,233],"formed":[228],"from":[229],"cost.":[236]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}