{"id":"https://openalex.org/W2100720213","doi":"https://doi.org/10.1142/s0218213008003765","title":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","display_name":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W2100720213","doi":"https://doi.org/10.1142/s0218213008003765","mag":"2100720213"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213008003765","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008003765","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5050432598","display_name":"Abid M. Malik","orcid":"https://orcid.org/0000-0002-0706-2824"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"ABID M. MALIK","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044039826","display_name":"Jim McInnes","orcid":null},"institutions":[{"id":"https://openalex.org/I4210113654","display_name":"IBM (Canada)","ror":"https://ror.org/025sxka56","country_code":"CA","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210113654"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JIM McINNES","raw_affiliation_strings":["IBM Canada Toronto Lab, Toronto, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"IBM Canada Toronto Lab, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I4210113654"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103052788","display_name":"Peter van Beek","orcid":"https://orcid.org/0000-0002-4589-5253"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PETER VAN BEEK","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050432598"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":1.5247,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.84937427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":"01","first_page":"37","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","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.9952999949455261,"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/T10126","display_name":"Logic, programming, and type systems","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8950475454330444},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.6484730839729309},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5502384901046753},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5392265915870667},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.4804251194000244},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4624254107475281},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.43162304162979126},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4261947274208069},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.40856754779815674},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3276279866695404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.302678644657135},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.19939187169075012},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16253653168678284},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.1593169867992401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07797381281852722}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8950475454330444},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.6484730839729309},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5502384901046753},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5392265915870667},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.4804251194000244},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4624254107475281},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.43162304162979126},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4261947274208069},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.40856754779815674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3276279866695404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.302678644657135},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.19939187169075012},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16253653168678284},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.1593169867992401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07797381281852722},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0218213008003765","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008003765","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.3676","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.3676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ai.uwaterloo.ca/~vanbeek/Publications/ictai06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.1620","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.1620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwaterloo.ca/research/tr/2005/CS-2005-19.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"},{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W1535560884","https://openalex.org/W2041909047","https://openalex.org/W2048936605","https://openalex.org/W2074352684","https://openalex.org/W2113654469","https://openalex.org/W2114067856","https://openalex.org/W2127126977","https://openalex.org/W2139278915","https://openalex.org/W2146995753"],"related_works":["https://openalex.org/W1601646354","https://openalex.org/W1541585229","https://openalex.org/W1853049011","https://openalex.org/W2479014312","https://openalex.org/W1583465708","https://openalex.org/W1606851719","https://openalex.org/W2091772480","https://openalex.org/W2069811640","https://openalex.org/W2389852039","https://openalex.org/W42780062"],"abstract_inverted_index":{"Instruction":[0],"scheduling":[1,27],"is":[2,28,67],"one":[3],"of":[4,13,43,115,153,156,158],"the":[5,11,64,102,113,120,130,142,154,177,193],"most":[6,76],"important":[7],"steps":[8],"for":[9,35,89,118],"improving":[10,119],"performance":[12],"object":[14],"code":[15,44],"produced":[16],"by":[17],"a":[18,31,36,40,46,51,82,151,169],"compiler.":[19],"A":[20],"fundamental":[21],"problem":[22,65],"that":[23,84],"arises":[24],"in":[25,75,112,161],"instruction":[26],"to":[29,57,104,107,176,186,192],"find":[30],"minimum":[32],"length":[33],"schedule":[34],"basic":[37,90,159,179,182],"block":[38],"\u2014":[39,55,148,173],"straight-line":[41],"sequence":[42],"with":[45,184],"single":[47,52],"entry":[48],"point":[49,54,136],"and":[50,60,69,134,174],"exit":[53],"subject":[56],"precedence,":[58],"latency,":[59],"resource":[61],"constraints.":[62],"Solving":[63],"exactly":[66],"NP-complete,":[68],"heuristic":[70],"approaches":[71],"are":[72],"currently":[73],"used":[74],"compilers.":[77],"In":[78,97],"contrast,":[79],"we":[80],"present":[81],"scheduler":[83,128,144],"finds":[85],"provably":[86],"optimal":[87,100,127,143],"schedules":[88],"blocks":[91,160,183],"using":[92],"techniques":[93,117],"from":[94],"constraint":[95,121],"programming.":[96],"developing":[98],"our":[99,126,162],"scheduler,":[101],"key":[103],"scaling":[105],"up":[106,185],"large,":[108],"real":[109],"problems":[110],"was":[111,145],"development":[114],"preprocessing":[116],"model.":[122],"We":[123],"experimentally":[124],"evaluated":[125],"on":[129],"SPEC":[131],"2000":[132],"integer":[133],"floating":[135],"benchmarks.":[137],"On":[138],"this":[139],"benchmark":[140,163],"suite,":[141],"very":[146],"robust":[147],"all":[149],"but":[150],"handful":[152],"hundreds":[155],"thousands":[157],"suite":[164],"were":[165],"solved":[166],"optimally":[167],"within":[168],"reasonable":[170],"time":[171],"limit":[172],"scaled":[175],"largest":[178],"blocks,":[180],"including":[181],"2600":[187],"instructions.":[188],"This":[189],"compares":[190],"favorably":[191],"best":[194],"previous":[195],"exact":[196],"approaches.":[197]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}