{"id":"https://openalex.org/W2132357315","doi":"https://doi.org/10.1145/1044111.1044115","title":"A scheduling algorithm for optimization and early planning in high-level synthesis","display_name":"A scheduling algorithm for optimization and early planning in high-level synthesis","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2132357315","doi":"https://doi.org/10.1145/1044111.1044115","mag":"2132357315"},"language":"en","primary_location":{"id":"doi:10.1145/1044111.1044115","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1044111.1044115","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt63b1q3sw/qt63b1q3sw.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111716641","display_name":"Seda \u00d6\u01e7renci Memik","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seda Ogrenci Memik","raw_affiliation_strings":["Northwestern University, Evanston, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000231774","display_name":"Ryan Kastner","orcid":"https://orcid.org/0000-0001-9062-5570"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Kastner","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, CA","University of California, Santa Barbara Santa Barbara, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara Santa Barbara, CA#TAB#","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111951877","display_name":"Elaheh Bozorgzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elaheh Bozorgzadeh","raw_affiliation_strings":["University of California, Irvine, Irvine, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078132977","display_name":"Majid Sarrafzadeh","orcid":"https://orcid.org/0000-0001-8407-8689"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Majid Sarrafzadeh","raw_affiliation_strings":["University of California, Los Angeles, Los Angeles, CA",", University of California Los Angeles, Los Angeles, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":", University of California Los Angeles, Los Angeles, CA#TAB#","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3449,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.88902848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"1","first_page":"33","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":1.0,"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/T10904","display_name":"Embedded Systems Design Techniques","score":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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.8453208208084106},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5817171335220337},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5731052160263062},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5121715068817139},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49982428550720215},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.49383407831192017},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45788896083831787},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43797633051872253},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.43558287620544434},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27268320322036743},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19210991263389587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09470957517623901}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8453208208084106},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5817171335220337},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5731052160263062},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5121715068817139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49982428550720215},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49383407831192017},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45788896083831787},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43797633051872253},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.43558287620544434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27268320322036743},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19210991263389587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09470957517623901},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1044111.1044115","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1044111.1044115","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt63b1q3sw","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/63b1q3sw","pdf_url":"https://escholarship.org/content/qt63b1q3sw/qt63b1q3sw.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems, vol 10, iss 1","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.2738","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~seda/schedTodaes.pdf","raw_type":"text"},{"id":"pmh:qt63b1q3sw","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/63b1q3sw","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Memik, S O; Kastner, Ryan; Bozorgzadeh, E; & Sarrafzadeh, M. (2005). A scheduling algorithm for optimization and early planning in high-level synthesis. ACM Transactions on Design Automation of Electronic Systems, 10(1), 33 - 57. UC Santa Barbara: Retrieved from: http://www.escholarship.org/uc/item/63b1q3sw","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt63b1q3sw","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/63b1q3sw","pdf_url":"https://escholarship.org/content/qt63b1q3sw/qt63b1q3sw.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems, vol 10, iss 1","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2132357315.pdf","grobid_xml":"https://content.openalex.org/works/W2132357315.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1486117303","https://openalex.org/W1496477466","https://openalex.org/W1966224002","https://openalex.org/W1972763734","https://openalex.org/W1986207994","https://openalex.org/W1992992401","https://openalex.org/W2030934436","https://openalex.org/W2063255488","https://openalex.org/W2065260591","https://openalex.org/W2092360141","https://openalex.org/W2093032919","https://openalex.org/W2093842169","https://openalex.org/W2095968002","https://openalex.org/W2100882463","https://openalex.org/W2109876904","https://openalex.org/W2110591261","https://openalex.org/W2111911282","https://openalex.org/W2112432448","https://openalex.org/W2116299797","https://openalex.org/W2117285153","https://openalex.org/W2118052680","https://openalex.org/W2126685573","https://openalex.org/W2129922840","https://openalex.org/W2129962996","https://openalex.org/W2136536603","https://openalex.org/W2142490124","https://openalex.org/W2147892946","https://openalex.org/W2156417149","https://openalex.org/W2159414285","https://openalex.org/W2164377872","https://openalex.org/W2180651675","https://openalex.org/W2462300308","https://openalex.org/W2535919346","https://openalex.org/W2752885492","https://openalex.org/W4236661098","https://openalex.org/W4237835609","https://openalex.org/W4250395788","https://openalex.org/W4256356508","https://openalex.org/W6697202281"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W4281297310","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W2365237642","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Complexities":[0],"of":[1,17,50,80,104,170,214,220,245,262,268,274,283],"applications":[2,21],"implemented":[3],"on":[4,65,161,182,280],"embedded":[5],"and":[6,15,277],"programmable":[7],"systems":[8],"grow":[9],"with":[10,106,198,271],"the":[11,67,78,92,123,126,146,152,162,183,192,199,204,208,215,227,235,239,246,266,281,292],"advances":[12],"in":[13,66,77,238,249,291],"capacities":[14],"capabilities":[16],"these":[18,75,288],"systems.":[19],"Mapping":[20],"onto":[22],"them":[23],"manually":[24],"is":[25,43,87,119,132],"becoming":[26],"a":[27,47,102,113,135,143,158,167,178],"very":[28],"tedious":[29],"task.":[30],"This":[31,116,155],"draws":[32],"attention":[33],"to":[34,45,56,121,150,207,234,254,264,286],"using":[35,195],"high-level":[36,93],"synthesis":[37,94],"within":[38,91],"design":[39,62,68],"flows.":[40],"Meanwhile,":[41],"it":[42],"essential":[44,89],"provide":[46],"flexible":[48],"formulation":[49,213,244],"optimization":[51,257],"objectives":[52,63,289],"as":[53,55,134],"well":[54],"perform":[57],"efficient":[58],"planning":[59],"for":[60,125,165],"various":[61],"early":[64],"flow.":[69,95],"In":[70,187,217],"this":[71,176],"work,":[72],"we":[73,190],"address":[74],"issues":[76],"context":[79],"data":[81,107],"flow":[82],"graph":[83],"(DFG)":[84],"scheduling,":[85],"which":[86],"an":[88,98],"element":[90],"We":[96,141,259],"present":[97,260],"algorithm":[99,197,225,251,270,285],"that":[100],"schedules":[101],"chain":[103,169],"operations":[105,111],"dependencies":[108],"among":[109],"consecutive":[110],"at":[112],"single":[114,168],"step.":[115],"local":[117,130],"problem":[118,131],"repeated":[120],"generate":[122],"schedule":[124],"whole":[127],"DFG.":[128],"The":[129,243],"formulated":[133],"maximum":[136],"weight":[137],"noncrossing":[138],"bipartite":[139],"matching.":[140],"use":[142],"technique":[144,156],"from":[145],"computational":[147],"geometry":[148],"domain":[149],"solve":[151],"matching":[153],"problem.":[154,216],"provides":[157,177,252],"theoretical":[159],"guarantee":[160],"solution":[163,206,237],"quality":[164],"scheduling":[166,185],"operations.":[171],"Although":[172],"still":[173],"being":[174],"local,":[175],"relatively":[179],"wider":[180],"perspective":[181],"global":[184],"objectives.":[186],"our":[188,196,224,250,269,284],"experiments":[189],"compared":[191],"latencies":[193,201,232],"obtained":[194],"optimal":[200,228,236],"given":[202],"by":[203],"exact":[205],"integer":[209],"linear":[210],"programming":[211],"(ILP)":[212],"9":[218],"out":[219],"14":[221],"DFGs":[222],"tested,":[223],"found":[226],"solution,":[229],"while":[230],"generating":[231],"comparable":[233],"remaining":[240],"five":[241],"benchmarks.":[242],"objective":[247,275],"function":[248],"flexibility":[253],"incorporate":[255],"different":[256],"goals.":[258],"examples":[261,273],"how":[263],"exploit":[265],"versatility":[267],"specific":[272],"functions":[276],"experimental":[278],"results":[279],"ability":[282],"capture":[287],"efficiently":[290],"final":[293],"schedules.":[294]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}