{"id":"https://openalex.org/W4249909674","doi":"https://doi.org/10.1109/cgo.2004.1281674","title":"Exploring the performance potential of Itanium Processors with ILP-based scheduling","display_name":"Exploring the performance potential of Itanium Processors with ILP-based scheduling","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W4249909674","doi":"https://doi.org/10.1109/cgo.2004.1281674"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2004.1281674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization, 2004. CGO 2004.","raw_type":"proceedings-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/A5071278914","display_name":"S. Winkel","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"S. Winkel","raw_affiliation_strings":["Compiler Research Group, Informatik Saarland University, Saarbrucken, Germany"],"affiliations":[{"raw_affiliation_string":"Compiler Research Group, Informatik Saarland University, Saarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071278914"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":1.0564,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78531349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"189","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization 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/T10054","display_name":"Parallel Computing and Optimization 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/T10904","display_name":"Embedded Systems Design 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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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.8409280776977539},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7900615334510803},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7594333291053772},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5900850296020508},{"id":"https://openalex.org/keywords/speculative-execution","display_name":"Speculative execution","score":0.5732130408287048},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5445996522903442},{"id":"https://openalex.org/keywords/speculative-multithreading","display_name":"Speculative multithreading","score":0.4958592355251312},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4352014362812042},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.26964831352233887},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15591338276863098},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.11805599927902222},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.10504928231239319},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.09966650605201721}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8409280776977539},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7900615334510803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7594333291053772},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5900850296020508},{"id":"https://openalex.org/C141331961","wikidata":"https://www.wikidata.org/wiki/Q2164465","display_name":"Speculative execution","level":2,"score":0.5732130408287048},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5445996522903442},{"id":"https://openalex.org/C15296174","wikidata":"https://www.wikidata.org/wiki/Q7575343","display_name":"Speculative multithreading","level":4,"score":0.4958592355251312},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4352014362812042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26964831352233887},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15591338276863098},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.11805599927902222},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.10504928231239319},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.09966650605201721}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cgo.2004.1281674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization, 2004. CGO 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.5102","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rw4.cs.uni-sb.de/~sewi/cgo04-ILP.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W205257386","https://openalex.org/W1594264634","https://openalex.org/W1985463181","https://openalex.org/W2010594747","https://openalex.org/W2074352684","https://openalex.org/W2102016326","https://openalex.org/W2119881593","https://openalex.org/W2130762555","https://openalex.org/W2505968561","https://openalex.org/W2988480584","https://openalex.org/W4229844781","https://openalex.org/W4244964007","https://openalex.org/W6602033007","https://openalex.org/W6608343096","https://openalex.org/W6646682572"],"related_works":["https://openalex.org/W4247496551","https://openalex.org/W2135470015","https://openalex.org/W3012114143","https://openalex.org/W2005952754","https://openalex.org/W2090754905","https://openalex.org/W2039947876","https://openalex.org/W2440659839","https://openalex.org/W2170091192","https://openalex.org/W2142474721","https://openalex.org/W1972872690"],"abstract_inverted_index":{"HP":[0],"and":[1,39,106,119],"Intel's":[2,165],"Itanium":[3],"processor":[4,15],"family":[5],"(IPF)":[6],"is":[7,176],"considered":[8],"as":[9,97,99,131,133],"one":[10],"of":[11,31,45,94,141,173],"the":[12,25,29,56,67,114,121,139,142,150,160],"most":[13],"challenging":[14],"architectures":[16],"to":[17,50,55],"generate":[18],"code":[19,36,89,96],"for.":[20],"During":[21],"global":[22,122],"instruction":[23],"scheduling,":[24],"compiler":[26,166],"must":[27],"balance":[28],"use":[30],"strongly":[32],"interdependent":[33],"techniques":[34],"like":[35,103],"motion,":[37],"speculation":[38,105],"predication.":[40,107],"A":[41],"too":[42],"conservative":[43],"application":[44],"these":[46,117,174],"features":[47,102],"can":[48,61],"lead":[49],"empty":[51],"execution":[52],"slots,":[53],"contrary":[54],"EPIC":[57],"philosophy.":[58],"But":[59],"overuse":[60],"cause":[62],"resource":[63],"shortage":[64],"which":[65],"spoils":[66],"benefit.":[68],"We":[69],"tackle":[70],"this":[71],"problem":[72],"using":[73],"integer":[74],"linear":[75],"programming":[76],"(ILP),":[77],"a":[78,126],"proven":[79],"standard":[80],"optimization":[81],"method.":[82],"Our":[83],"ILP":[84,109],"model":[85],"comprises":[86],"global,":[87],"partial-ready":[88],"motion":[90],"with":[91,145],"automated":[92],"generation":[93],"compensation":[95],"well":[98,132],"vital":[100],"IPF":[101],"control/data":[104],"The":[108,170],"approach":[110],"can-with":[111],"some":[112,134],"restrictions-resolve":[113],"interdependences":[115],"between":[116],"decisions":[118],"deliver":[120],"optimum.":[123],"This":[124],"promises":[125],"speedup":[127,172],"for":[128],"compute-intensive":[129],"applications":[130],"theoretically":[135],"funded":[136],"insights":[137],"into":[138],"potential":[140],"architecture.":[143],"Experiments":[144],"several":[146],"hot":[147],"functions":[148],"from":[149],"SPEC":[151],"benchmarks":[152],"show":[153],"substantial":[154],"improvements:":[155],"our":[156],"postpass":[157],"optimizer":[158],"reduces":[159],"schedule":[161],"lengths":[162],"produced":[163],"by":[164,167],"about":[168],"20-40%.":[169],"resulting":[171],"routines":[175],"16%":[177],"on":[178],"average.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
