{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:12:09Z","timestamp":1729635129799,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/cgo.2013.6494981","type":"proceedings-article","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T21:38:10Z","timestamp":1365716290000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["Experiences in designing a robust and scalable interpreter profiling framework"],"prefix":"10.1109","author":[{"given":"I.","family":"Gartley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Pirvu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Sundaresan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Grcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.9"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791202"},{"journal-title":"An Infrastructure for Profile-Driven Dynamic Recompilation","year":"1997","author":"burger","key":"11"},{"journal-title":"Approximating the calling context tree via sampling","year":"2000","author":"arnold","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.16"},{"key":"2","article-title":"Bursty tracing: A framework for low-overhead temporal profiling","author":"hirzel","year":"2001","journal-title":"4th ACM Workshop on Feedback-Directed and Dynamic Optimization"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378832"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143180"},{"key":"7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","article-title":"A pragmatic implementation of non-blocking linkedlists","volume":"2180","author":"harris","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"},{"year":"0","key":"5"},{"journal-title":"Apache DayTrader Benchmark Sample","year":"0","key":"4"},{"key":"9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/11795490_3","article-title":"A lazy concurrent list-based set algorithm. Principles of distributed systems","volume":"3974","author":"heller","year":"2006","journal-title":"Lecture Notes in Computer Science"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/564879.564881"}],"event":{"name":"2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","start":{"date-parts":[[2013,2,23]]},"location":"Shenzhen","end":{"date-parts":[[2013,2,27]]}},"container-title":["Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6489844\/6494968\/06494981.pdf?arnumber=6494981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T11:14:51Z","timestamp":1498043691000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6494981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cgo.2013.6494981","relation":{},"subject":[],"published":{"date-parts":[[2013,2]]}}}