{"id":"https://openalex.org/W1994796030","doi":"https://doi.org/10.1145/1111583.1111585","title":"Recursive data structure profiling","display_name":"Recursive data structure profiling","publication_year":2005,"publication_date":"2005-06-12","ids":{"openalex":"https://openalex.org/W1994796030","doi":"https://doi.org/10.1145/1111583.1111585","mag":"1994796030"},"language":"en","primary_location":{"id":"doi:10.1145/1111583.1111585","doi":"https://doi.org/10.1145/1111583.1111585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1111583.1111585","pdf_url":null,"source":{"id":"https://openalex.org/S4306425817","display_name":"Workshop on Memory System Performance and Correctness","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 workshop on Memory system performance","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5052674252","display_name":"Easwaran Raman","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Easwaran Raman","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008319090","display_name":"David I. August","orcid":"https://orcid.org/0000-0003-3327-1803","observed_orcids":["https://orcid.org/0000-0003-3327-1803"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David I. August","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.8679,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.7037037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"14"},"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.9961000084877014,"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.9961000084877014,"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.0017999999690800905,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/recursive-data-structures","display_name":"recursive data structures","score":0.9710000157356262},{"id":"https://openalex.org/keywords/memory-access-patterns","display_name":"memory access patterns","score":0.8849999904632568},{"id":"https://openalex.org/keywords/memory-profiling","display_name":"memory profiling","score":0.4959999918937683},{"id":"https://openalex.org/keywords/processor-memory-performance-gap","display_name":"processor-memory performance gap","score":0.8059999942779541},{"id":"https://openalex.org/keywords/data-structure-optimization","display_name":"data structure optimization","score":0.7749999761581421}],"concepts":[{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.8875554800033569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8371208906173706},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7428056001663208},{"id":"https://openalex.org/C2778565505","wikidata":"https://www.wikidata.org/wiki/Q2207566","display_name":"Spec#","level":2,"score":0.7375098466873169},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.680894136428833},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5581729412078857},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.4534991383552551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3433615267276764},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23784363269805908},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1737757921218872}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1111583.1111585","doi":"https://doi.org/10.1145/1111583.1111585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1111583.1111585","pdf_url":null,"source":{"id":"https://openalex.org/S4306425817","display_name":"Workshop on Memory System Performance and Correctness","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 workshop on Memory system performance","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W34604755","https://openalex.org/W43953174","https://openalex.org/W112132368","https://openalex.org/W1587967619","https://openalex.org/W2034641516","https://openalex.org/W2072858236","https://openalex.org/W2082827821","https://openalex.org/W2114496697","https://openalex.org/W2117184662","https://openalex.org/W2134633067","https://openalex.org/W2134694138","https://openalex.org/W2139356751","https://openalex.org/W2149982801","https://openalex.org/W2153691881","https://openalex.org/W2752885492","https://openalex.org/W2912560299","https://openalex.org/W4236999231","https://openalex.org/W4239813889","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W7096396276","https://openalex.org/W842142381","https://openalex.org/W2134642248","https://openalex.org/W2149982801","https://openalex.org/W7096532391","https://openalex.org/W2109317282","https://openalex.org/W34604755","https://openalex.org/W2511088194","https://openalex.org/W2525625085","https://openalex.org/W2123415027"],"abstract_inverted_index":{"As":[0],"the":[1,8,27,46,67,71,103,156,165,168,185],"processor-memory":[2],"performance":[3],"gap":[4],"increases,":[5],"so":[6],"does":[7],"need":[9],"for":[10,125],"aggressive":[11],"data":[12,55,76,96,221],"structure":[13,97,206,222],"optimizations":[14,21],"to":[15,42,89,93,183,204,219],"reduce":[16],"memory":[17,28,47,83,119,177],"access":[18,48],"latencies.":[19],"Such":[20],"require":[22],"a":[23,34,112,117,123,149,173,181],"better":[24,44,174],"understanding":[25,175],"of":[26,30,50,70,74,105,116,151,167,176,187,189],"behavior":[29,49,69,104],"programs.":[31],"We":[32],"propose":[33],"profiling":[35,79,84,139],"technique":[36],"called":[37],"Recursive":[38],"Data":[39],"Structure":[40],"Profiling":[41],"help":[43],"understand":[45],"programs":[51],"that":[52,199],"use":[53],"recursive":[54,75],"structures":[56],"(RDS)":[57],"such":[58],"as":[59],"lists,":[60],"trees,":[61],"etc.":[62],"An":[63],"RDS":[64,78,127,138,169,191,195],"profile":[65,128,170],"captures":[66],"runtime":[68],"individual":[72,106],"instances":[73],"structures.":[77],"differs":[80],"from":[81,155],"other":[82,160],"techniques":[85],"in":[86,171],"its":[87,205,208],"ability":[88],"aggregate":[90],"information":[91],"pertaining":[92],"an":[94,190,216],"entire":[95],"instance,":[98],"rather":[99],"than":[100],"merely":[101],"capturing":[102],"loads":[107],"and":[108,145,159,211],"stores,":[109],"thereby":[110],"giving":[111],"more":[113],"global":[114],"view":[115],"program's":[118],"accesses.This":[120],"paper":[121],"describes":[122],"method":[124],"collecting":[126],"without":[129],"requiring":[130],"any":[131],"high-level":[132],"program":[133],"representation":[134],"or":[135],"type":[136],"information.":[137],"achieves":[140],"this":[141],"with":[142],"manageable":[143],"space":[144],"time":[146],"overhead":[147],"on":[148],"mixture":[150],"pointer":[152],"intensive":[153],"benchmarks":[154],"SPEC,":[157],"Olden":[158],"benchmark":[161],"suites.":[162],"To":[163],"illustrate":[164],"potential":[166],"providing":[172],"accesses,":[178],"we":[179],"introduce":[180],"metric":[182],"quantify":[184],"notion":[186],"stability":[188],"instance.":[192],"A":[193],"stable":[194],"instance":[196],"is":[197],"one":[198],"undergoes":[200],"very":[201],"few":[202],"changes":[203],"between":[207],"initial":[209],"creation":[210],"final":[212],"destruction,":[213],"making":[214],"it":[215],"attractive":[217],"candidate":[218],"certain":[220],"optimizations.":[223]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}