{"id":"https://openalex.org/W4234952063","doi":"https://doi.org/10.1109/cgo.2004.1281679","title":"Extending path profiling across loop backedges and procedure boundaries","display_name":"Extending path profiling across loop backedges and procedure boundaries","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W4234952063","doi":"https://doi.org/10.1109/cgo.2004.1281679"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2004.1281679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281679","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/A5076081070","display_name":"Sriraman Tallam","orcid":"https://orcid.org/0000-0002-6303-8132"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Tallam","raw_affiliation_strings":["Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107249133","display_name":"Xiangyu Zhang","orcid":"https://orcid.org/0000-0002-9544-2500"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiangyu Zhang","raw_affiliation_strings":["Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100699251","display_name":"Rajiv Gupta","orcid":"https://orcid.org/0000-0002-9348-3974"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Gupta","raw_affiliation_strings":["Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076081070"],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":0.5266,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.69646353,"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":"251","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9936000108718872,"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.5523468255996704},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4922915995121002},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4897763729095459},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48240721225738525},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.41103655099868774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3285769820213318},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2793521285057068}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5523468255996704},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4922915995121002},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4897763729095459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48240721225738525},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.41103655099868774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3285769820213318},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2793521285057068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2004.1281679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281679","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1561389604","https://openalex.org/W1965341318","https://openalex.org/W1983166063","https://openalex.org/W1987238172","https://openalex.org/W1999362312","https://openalex.org/W2036918610","https://openalex.org/W2062444590","https://openalex.org/W2092467549","https://openalex.org/W2108112890","https://openalex.org/W2118263004","https://openalex.org/W2129276112","https://openalex.org/W2129962996","https://openalex.org/W2130711572","https://openalex.org/W2151881397","https://openalex.org/W3004836696","https://openalex.org/W4232305906","https://openalex.org/W4238089251","https://openalex.org/W4238502383","https://openalex.org/W4247679082","https://openalex.org/W4249725883","https://openalex.org/W4256018993","https://openalex.org/W6674278402","https://openalex.org/W6679307170"],"related_works":["https://openalex.org/W2129550502","https://openalex.org/W2009808060","https://openalex.org/W2093961518","https://openalex.org/W2372801012","https://openalex.org/W2009843927","https://openalex.org/W2361133696","https://openalex.org/W1995629993","https://openalex.org/W2069032895","https://openalex.org/W2092513144","https://openalex.org/W1974037309"],"abstract_inverted_index":{"Since":[0],"their":[1,107],"introduction,":[2],"path":[3,76,169,186],"profiles":[4],"have":[5],"been":[6],"used":[7],"to":[8,29,48,94,105,175,192],"guide":[9],"the":[10,57,66,78,135,156,178],"application":[11],"of":[12,33,56,62,69,80,82,123,125,138,141,151,163],"aggressive":[13],"code":[14],"optimizations":[15],"and":[16,23,40,100],"performing":[17],"instruction":[18],"scheduling.":[19],"However,":[20,154],"for":[21,53],"optimization":[22],"scheduling,":[24],"it":[25],"is":[26,85,144,147],"often":[27],"desirable":[28],"obtain":[30],"frequency":[31,67],"counts":[32,68],"paths":[34,71,93,99,111,143,165],"that":[35,134,150],"extend":[36,89],"across":[37],"loop":[38],"iterations":[39],"cross":[41],"procedure":[42],"boundaries.":[43],"These":[44],"longer":[45,97,114,128],"paths,":[46,51,117],"referred":[47],"as":[49],"interesting":[50,70,129,164],"account":[52],"over":[54],"75%":[55],"flow":[58,162],"in":[59,159],"a":[60],"subset":[61],"SPEC":[63],"benchmarks.":[64],"Although":[65],"can":[72],"be":[73],"estimated":[74,160],"from":[75,167,172,184,190],"profiles,":[77],"degree":[79],"imprecision":[81,158,180],"these":[83,110],"estimates":[84,182],"very":[86,120],"high.":[87],"We":[88],"Ball":[90],"Larus":[91],"(BL)":[92],"create":[95],"slightly":[96,113],"overlapping":[98,142,185],"develop":[101],"an":[102],"instrumentation":[103],"algorithm":[104],"collect":[106],"frequencies.":[108],"While":[109],"are":[112],"than":[115],"BL":[116,152,168],"they":[118],"enable":[119],"precise":[121],"estimation":[122],"frequencies":[124,140,170,187],"potentially":[126],"much":[127],"paths.":[130,153],"Our":[131],"experiments":[132],"show":[133],"average":[136,157,179],"cost":[137],"collecting":[139],"86.8%,":[145],"which":[146],"4.2":[148],"times":[149],"while":[155],"total":[161],"derived":[166,183],"ranges":[171,188],"-38":[173],"%":[174],"+138":[176],"%,":[177],"inflow":[181],"only":[189],"-4%":[191],"+8%.":[193]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"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"}