{"id":"https://openalex.org/W4239289337","doi":"https://doi.org/10.1145/1190216.1190268","title":"Preferential path profiling","display_name":"Preferential path profiling","publication_year":2007,"publication_date":"2007-01-17","ids":{"openalex":"https://openalex.org/W4239289337","doi":"https://doi.org/10.1145/1190216.1190268"},"language":"en","primary_location":{"id":"doi:10.1145/1190216.1190268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011779401","display_name":"Kapil Vaswani","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kapil Vaswani","raw_affiliation_strings":["Indian Institute of Science, Bangalore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111937381","display_name":"Aditya V. Nori","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Aditya V. Nori","raw_affiliation_strings":["Microsoft Research India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013670321","display_name":"Trishul Chilimbi","orcid":"https://orcid.org/0000-0001-6711-1117"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Trishul M. Chilimbi","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4482,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.90960922,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"362"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9941999912261963,"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.6887260675430298},{"id":"https://openalex.org/keywords/profiling","display_name":"Profiling (computer programming)","score":0.6624687910079956},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5636439323425293},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5487141013145447},{"id":"https://openalex.org/keywords/numbering","display_name":"Numbering","score":0.5433424711227417},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5349726676940918},{"id":"https://openalex.org/keywords/spec#","display_name":"Spec#","score":0.480059951543808},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46397432684898376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.326321542263031},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25573208928108215},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18391987681388855},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12002640962600708},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07511690258979797}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6887260675430298},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.6624687910079956},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5636439323425293},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5487141013145447},{"id":"https://openalex.org/C191916993","wikidata":"https://www.wikidata.org/wiki/Q362019","display_name":"Numbering","level":2,"score":0.5433424711227417},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5349726676940918},{"id":"https://openalex.org/C2778565505","wikidata":"https://www.wikidata.org/wiki/Q2207566","display_name":"Spec#","level":2,"score":0.480059951543808},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46397432684898376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.326321542263031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25573208928108215},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18391987681388855},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12002640962600708},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07511690258979797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1190216.1190268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1965341318","https://openalex.org/W2036918610","https://openalex.org/W2093226410","https://openalex.org/W2101134669","https://openalex.org/W2129652681","https://openalex.org/W2131781330","https://openalex.org/W2132685744","https://openalex.org/W2134499232","https://openalex.org/W2151881397","https://openalex.org/W2911940095"],"related_works":["https://openalex.org/W878150521","https://openalex.org/W2380905223","https://openalex.org/W2008941207","https://openalex.org/W2316187651","https://openalex.org/W2373662841","https://openalex.org/W1970478390","https://openalex.org/W2005053760","https://openalex.org/W74604206","https://openalex.org/W1485272726","https://openalex.org/W2339556925"],"abstract_inverted_index":{"Path":[0],"profiles":[1,39,71],"provide":[2],"a":[3,8,41,47,76,95,108,151,195],"more":[4,21],"accurate":[5],"characterization":[6],"of":[7,34,44,59,69,78,97,128,150,164,173,183,190],"program's":[9],"dynamic":[10],"behavior":[11],"than":[12],"basic":[13],"block":[14],"or":[15],"edge":[16,38],"profiles,":[17],"but":[18],"are":[19,72],"relatively":[20],"expensive":[22],"to":[23,102,120,142,185,194],"collect.":[24],"This":[25,134],"has":[26],"limited":[27],"their":[28,35],"use":[29,117],"in":[30,75,146],"practice":[31],"despite":[32],"demonstrations":[33],"advantages":[36],"over":[37],"for":[40,125],"wide":[42],"variety":[43],"applications.We":[45],"present":[46],"new":[48],"algorithm":[49],"called":[50],"preferential":[51],"path":[52,60,70,114,129,136,144,197],"profiling":[53,165],"(PPP),":[54],"that":[55,66,158],"reduces":[56,160],"the":[57,64,126,161,169,174],"overhead":[58,85,163],"profiling.":[61],"PPP":[62,82,140,159],"leverages":[63],"observation":[65],"most":[67],"consumers":[68],"only":[73],"interested":[74],"subset":[77],"all":[79],"program":[80],"paths.":[81,105],"achieves":[83],"low":[84],"by":[86,132,168],"separating":[87],"interesting":[88,104],"paths":[89,92,166],"from":[90,178],"other":[91],"and":[93,99,113,116],"assigning":[94],"set":[96],"unique":[98],"compact":[100,135],"numbers":[101],"these":[103],"We":[106],"draw":[107],"parallel":[109],"between":[110],"arithmetic":[111],"coding":[112],"numbering,":[115],"this":[118],"connection":[119],"prove":[121],"an":[122,147],"optimality":[123],"result":[124],"compactness":[127],"numbering":[130,137],"produced":[131],"PPP.":[133],"enables":[138],"our":[139],"implementation":[141],"record":[143],"information":[145],"array":[148],"instead":[149],"hash":[152],"table.":[153],"Our":[154],"experimental":[155],"results":[156],"indicate":[157],"runtime":[162],"exercised":[167],"largest":[170],"(ref)":[171],"inputs":[172],"SPEC":[175],"CPU2000":[176],"benchmarks":[177],"50%":[179],"on":[180,187],"average":[181,188],"(maximum":[182,189],"132%)":[184],"15%":[186],"26%)":[191],"as":[192],"compared":[193],"state-of-the-art":[196],"profiler.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}