{"id":"https://openalex.org/W2103490690","doi":"https://doi.org/10.1109/hpdc.2006.1652136","title":"Path Grammar Guided Trace Compression and Trace Approximation","display_name":"Path Grammar Guided Trace Compression and Trace Approximation","publication_year":2006,"publication_date":"2006-07-21","ids":{"openalex":"https://openalex.org/W2103490690","doi":"https://doi.org/10.1109/hpdc.2006.1652136","mag":"2103490690"},"language":"en","primary_location":{"id":"doi:10.1109/hpdc.2006.1652136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2006.1652136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 15th IEEE International Conference on High Performance Distributed Computing","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/A5019439900","display_name":"Xiaofeng Gao","orcid":"https://orcid.org/0000-0003-1776-8799"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiaofeng Gao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110725059","display_name":"Allan Snavely","orcid":null},"institutions":[{"id":"https://openalex.org/I181653535","display_name":"San Diego Supercomputer Center","ror":"https://ror.org/04mg3nk07","country_code":"US","type":"facility","lineage":["https://openalex.org/I181653535","https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Snavely","raw_affiliation_strings":["SAN DIEGO SUPERCOMPUTER CENTER#TAB#"],"affiliations":[{"raw_affiliation_string":"SAN DIEGO SUPERCOMPUTER CENTER#TAB#","institution_ids":["https://openalex.org/I181653535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022148799","display_name":"L. Carter","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Carter","raw_affiliation_strings":["University of California,  San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,  San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019439900"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2591,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.8913874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"35","issue":null,"first_page":"57","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8494491577148438},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.8145148754119873},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.5507319569587708},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4901205003261566},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4733037054538727},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47034743428230286},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45878249406814575},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.42189279198646545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39225339889526367},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.341673880815506},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33713918924331665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09847736358642578},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07810264825820923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8494491577148438},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.8145148754119873},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5507319569587708},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4901205003261566},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4733037054538727},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47034743428230286},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45878249406814575},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.42189279198646545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39225339889526367},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.341673880815506},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33713918924331665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09847736358642578},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07810264825820923},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpdc.2006.1652136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2006.1652136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 15th IEEE International Conference on High Performance Distributed Computing","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"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1518149019","https://openalex.org/W1542297259","https://openalex.org/W1551973822","https://openalex.org/W1810183241","https://openalex.org/W1963972873","https://openalex.org/W1987238172","https://openalex.org/W2043844878","https://openalex.org/W2047226031","https://openalex.org/W2048115596","https://openalex.org/W2048352387","https://openalex.org/W2059504991","https://openalex.org/W2072737419","https://openalex.org/W2075183718","https://openalex.org/W2075775922","https://openalex.org/W2095595785","https://openalex.org/W2101537309","https://openalex.org/W2105686649","https://openalex.org/W2106961628","https://openalex.org/W2107745473","https://openalex.org/W2108112890","https://openalex.org/W2109749977","https://openalex.org/W2112121929","https://openalex.org/W2124240969","https://openalex.org/W2134523664","https://openalex.org/W2136452714","https://openalex.org/W2145561364","https://openalex.org/W2145607884","https://openalex.org/W2159065635","https://openalex.org/W2171040775","https://openalex.org/W2197099782","https://openalex.org/W4229530432","https://openalex.org/W4232576303","https://openalex.org/W4246404804","https://openalex.org/W4253486576","https://openalex.org/W6680169542"],"related_works":["https://openalex.org/W2948148442","https://openalex.org/W2461250372","https://openalex.org/W2394342941","https://openalex.org/W2169853506","https://openalex.org/W2547124190","https://openalex.org/W2350586049","https://openalex.org/W2385628723","https://openalex.org/W2057878850","https://openalex.org/W2169871401","https://openalex.org/W3008492011"],"abstract_inverted_index":{"Trace-driven":[0],"simulation":[1,246,276],"is":[2,23,107,194],"an":[3],"important":[4],"technique":[5],"used":[6,125],"in":[7],"the":[8,32,36,98,114,130,192,215,227,245,254,278,281],"evaluation":[9],"of":[10,133,149,190,201,217,234,264,280],"computer":[11],"architecture":[12],"innovations.":[13],"However":[14],"using":[15,93],"it":[16,139],"for":[17,283],"studying":[18],"parallel":[19,150,285],"computers":[20],"and":[21,30,50,59,71,137,210,287],"applications":[22,151,288],"at":[24],"best":[25],"very":[26,187,242],"challenging.":[27],"Acquiring,":[28],"representing":[29],"storing":[31],"traces":[33,87,115,148,252],"are":[34,116,155,183,223,241],"among":[35],"major":[37],"issues.":[38],"In":[39,271],"this":[40],"paper,":[41],"we":[42,174,273],"introduce":[43,175],"path":[44],"grammar":[45],"guided":[46],"trace":[47,53,61,77,172,176,230],"compression":[48,58,131],"(PGGTC)":[49],"effective":[51,170,181,218,251],"address":[52,171,219,257],"approximation":[54,177],"(TA)":[55],"to":[56,68,74,97,128,213,231,244,269],"speedup":[57],"reduce":[60],"sizes.":[62],"PGGTC":[63,82,104,121],"relies":[64],"on":[65,108,186,249],"static":[66],"analysis":[67],"build":[69],"rules":[70],"determine":[72],"actions":[73],"guide":[75],"online":[76],"compression.":[78],"Combined":[79],"with":[80,105,126,152,163],"gzip,":[81],"can":[83,122],"compresses":[84],"control":[85],"flow":[86],"over":[88],"330":[89],"times":[90,111,119,141],"smaller":[91],"than":[92,143],"gzip":[94,106],"alone.":[95],"Compared":[96],"widely":[99],"popular":[100],"Sequitur":[101,127,134,144],"algorithm":[102],"alone,":[103],"average":[109],"40":[110],"faster,":[112],"while":[113,253],"only":[117],"3":[118],"bigger.":[120],"be":[123],"also":[124],"double":[129],"ratios":[132],"by":[135,145,225],"itself":[136],"do":[138],"14":[140],"faster":[142],"itself.":[146],"Address":[147],"significant":[153],"randomness":[154],"often":[156],"impossibly":[157],"large":[158],"even":[159],"after":[160],"being":[161],"compressed":[162],"any":[164],"lossless":[165],"scheme":[166],"including":[167],"PGGTC.":[168],"For":[169],"reduction,":[173],"(TA).":[178],"Performance-wise":[179],"similar":[180],"addresses":[182],"generated":[184,228],"based":[185,248],"compact":[188],"summaries":[189],"how":[191],"memory":[193,211,259],"accessed":[195],"during":[196],"each":[197],"structure":[198],"instance":[199],"instead":[200],"compressing":[202],"them.":[203],"We":[204],"demonstrate":[205],"two":[206],"approaches:":[207],"selective":[208,255],"dumping":[209],"signatures,":[212],"summarize":[214],"properties":[216],"sequences.":[220],"Both":[221],"approaches":[222],"validated":[224],"feeding":[226],"approximate":[229],"cache":[232],"simulators":[233],"25":[235],"different":[236],"configurations.":[237],"The":[238],"simulated":[239],"results":[240,247],"close":[243],"full":[250],"dumped":[256],"or":[258],"signatures":[260],"require":[261],"several":[262],"order":[263],"magnitude":[265],"less":[266],"disk":[267],"space":[268],"store.":[270],"summary,":[272],"move":[274],"trace-driven":[275],"into":[277],"realm":[279],"feasible":[282],"larger":[284],"machines":[286]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}