{"id":"https://openalex.org/W4232305906","doi":"https://doi.org/10.1109/cgo.2004.1281678","title":"Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems","display_name":"Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W4232305906","doi":"https://doi.org/10.1109/cgo.2004.1281678"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2004.1281678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281678","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/A5061361302","display_name":"Rahul Joshi","orcid":"https://orcid.org/0000-0002-5871-890X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Joshi","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044161672","display_name":"Michael D. Bond","orcid":"https://orcid.org/0000-0002-8971-4944"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.D. Bond","raw_affiliation_strings":["Department of Computer Sciences, University of Texas, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061361302"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.9174,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87194153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.983299970626831,"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/profiling","display_name":"Profiling (computer programming)","score":0.7873184680938721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6893172264099121},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4720117747783661},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44403594732284546},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4158569276332855},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37166231870651245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3452477753162384},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32312268018722534},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1346108615398407},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07168823480606079}],"concepts":[{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.7873184680938721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6893172264099121},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4720117747783661},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44403594732284546},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4158569276332855},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37166231870651245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3452477753162384},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32312268018722534},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1346108615398407},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07168823480606079},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2004.1281678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281678","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1613767","https://openalex.org/W201406093","https://openalex.org/W262335958","https://openalex.org/W1561389604","https://openalex.org/W1965341318","https://openalex.org/W2038769854","https://openalex.org/W2040183246","https://openalex.org/W2046523746","https://openalex.org/W2063255488","https://openalex.org/W2077324087","https://openalex.org/W2098984303","https://openalex.org/W2101134669","https://openalex.org/W2151881397","https://openalex.org/W2153228154","https://openalex.org/W2161570038","https://openalex.org/W2998283004","https://openalex.org/W4205854416","https://openalex.org/W4232576303","https://openalex.org/W4234952063","https://openalex.org/W4242990635","https://openalex.org/W4243060322","https://openalex.org/W4249818463","https://openalex.org/W6652263421","https://openalex.org/W6675115123"],"related_works":["https://openalex.org/W2161444195","https://openalex.org/W2589019771","https://openalex.org/W2985540061","https://openalex.org/W2611230223","https://openalex.org/W2144265691","https://openalex.org/W1605991620","https://openalex.org/W113683524","https://openalex.org/W4387251676","https://openalex.org/W4385261619","https://openalex.org/W93624718"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,16,41,50,62],"technique":[3],"for":[4,53,104],"reducing":[5,85],"the":[6,13,38,59,71,86,131,148,155],"overhead":[7,132],"of":[8,15,40,46,64,88,133],"collecting":[9],"path":[10,27,42,74],"profiles":[11],"in":[12,61],"context":[14],"dynamic":[17,54],"optimizer.":[18],"The":[19],"key":[20],"idea":[21],"to":[22,31,36,70,101,142,147],"our":[23],"approach,":[24],"called":[25],"targeted":[26],"profiling":[28,48,75],"(TPP),":[29],"is":[30,49,67],"use":[32],"an":[33,68,122],"edge":[34,123],"profile":[35,134],"simplify":[37],"collection":[39,135],"profile.":[43,124],"This":[44],"notion":[45],"profile-guided":[47],"natural":[51],"fit":[52],"optimizers,":[55],"which":[56],"typically":[57],"optimize":[58],"code":[60],"series":[63],"stages.":[65],"TPP":[66],"extension":[69],"Ball-Lams":[72],"efficient":[73],"algorithm.":[76],"Its":[77],"increased":[78],"efficiency":[79],"comes":[80],"from":[81,121],"two":[82],"sources:":[83],"(i)":[84],"number":[87],"potential":[89],"paths":[90,94,116],"by":[91,139],"not":[92,112],"enumerating":[93],"with":[95,151],"cold":[96],"edges,":[97],"allowing":[98],"array":[99],"accesses":[100],"be":[102,118,137],"substituted":[103],"more":[105],"expensive":[106],"hash":[107],"table":[108],"lookups,":[109],"and":[110],"(ii)":[111],"instrumenting":[113],"regions":[114],"where":[115],"can":[117,136],"unambiguously":[119],"derived":[120],"Our":[125],"results":[126],"suggest":[127],"that":[128],"on":[129,154],"average":[130],"reduced":[138],"half":[140],"(SPEC95)":[141],"almost":[143],"two-thirds":[144],"(SPEC2000)":[145],"relative":[146],"Ball-Larus":[149],"algorithm":[150],"minimal":[152],"impact":[153],"information":[156],"collected.":[157]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}