{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:57:23Z","timestamp":1726408643611},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346263"},{"type":"electronic","value":"9783030346270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34627-0_5","type":"book-chapter","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T09:02:55Z","timestamp":1573549375000},"page":"61-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Footmark: A New Formulation for Working Set Statistics"],"prefix":"10.1007","author":[{"given":"Liang","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Wesley","family":"Smith","sequence":"additional","affiliation":[]},{"given":"Sicong","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Zixu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Yunquan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,13]]},"reference":[{"key":"5_CR1","unstructured":"Loca: Program locality analysis tools (2018). \nhttps:\/\/github.com\/dcompiler\/loca"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Brock, J., Ding, C., Lavaee, R., Liu, F., Yuan, L.: Prediction and bounds on shared cache demand from memory access interleaving. In: Proceedings of the International Symposium on Memory Management, pp. 96\u2013108 (2018). \nhttps:\/\/doi.org\/10.1145\/3210563.3210565\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3210563.3210565","DOI":"10.1145\/3210563.3210565"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Chen, D., Liu, F., Ding, C., Pai, S.: Locality analysis through static parallel sampling. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 557\u2013570 (2018). \nhttps:\/\/doi.org\/10.1145\/3192366.3192402\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3192366.3192402","DOI":"10.1145\/3192366.3192402"},{"key":"5_CR4","volume-title":"Operating Systems Theory","author":"EG Coffman Jr","year":"1973","unstructured":"Coffman Jr., E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall, Englewood Cliffs (1973)"},{"key":"5_CR5","unstructured":"Denning, P.J.: Resource Allocation in Multiprocess Computer Systems. Ph.D. thesis, Massachusetts Institute of Technology (1968)"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/363095.363141","volume":"11","author":"PJ Denning","year":"1968","unstructured":"Denning, P.J.: The working set model for program behaviour. Commun. ACM 11(5), 323\u2013333 (1968)","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/361268.361281","volume":"15","author":"PJ Denning","year":"1972","unstructured":"Denning, P.J., Schwartz, S.C.: Properties of the working set model. Commun. ACM 15(3), 191\u2013198 (1972)","journal-title":"Commun. ACM"},{"issue":"9","key":"5_CR8","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1145\/359588.359598","volume":"21","author":"PJ Denning","year":"1978","unstructured":"Denning, P.J., Slutz, D.R.: Generalized working sets for segment reference strings. Commun. ACM 21(9), 750\u2013759 (1978)","journal-title":"Commun. ACM"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Ding, C., Chilimbi, T.: All-window profiling of concurrent executions. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (2008). Poster paper","DOI":"10.1145\/1345206.1345248"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3185751","volume":"14","author":"X Hu","year":"2018","unstructured":"Hu, X., et al.: Fast miss ratio curve modeling for storage cache. ACM Trans. Storage 14(2), 12:1\u201312:34 (2018). \nhttps:\/\/doi.org\/10.1145\/3185751\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3185751","journal-title":"ACM Trans. Storage"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Luk, C.K., et al.: Pin: building customized program analysis tools with dynamic instrumentation. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 190\u2013200 (2005)","DOI":"10.1145\/1065010.1065034"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Pan, C., Hu, X., Zhou, L., Luo, Y., Wang, X., Wang, Z.: PACE: penalty aware cache modeling with enhanced AET. In: 9th ACM SIGOPS Asia-Pacific Workshop on Systems (APSys 2018) (2018)","DOI":"10.1145\/3265723.3265736"},{"issue":"10","key":"5_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355620.361167","volume":"17","author":"DR Slutz","year":"1974","unstructured":"Slutz, D.R., Traiger, I.L.: A note on the calculation working set size. Commun. ACM 17(10), 563\u2013565 (1974). \nhttps:\/\/doi.org\/10.1145\/355620.361167\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/355620.361167","journal-title":"Commun. ACM"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Xiang, X., Bao, B., Ding, C., Gao, Y.: Linear-time modeling of program working set in shared cache. In: Proceedings of the International Conference on Parallel Architecture and Compilation Techniques, pp. 350\u2013360 (2011)","DOI":"10.1109\/PACT.2011.66"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Xiang, Y., Wang, X., Huang, Z., Wang, Z., Luo, Y., Wang, Z.: DCAPS: dynamic cache allocation with partial sharing. In: Proceedings of the EuroSys Conference, pp. 13:1\u201313:15 (2018). \nhttps:\/\/doi.org\/10.1145\/3190508.3190511\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3190508.3190511","DOI":"10.1145\/3190508.3190511"},{"key":"5_CR16","unstructured":"Yuan, L., Ding, C., Denning, P.J., Zhang, Y.: A measurement theory of locality. CoRR abs\/1802.01254 (2018). \nhttp:\/\/arxiv.org\/abs\/1802.01254"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34627-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T09:03:52Z","timestamp":1573549432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34627-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346263","9783030346270"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34627-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salt Lake City, UT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lcpcworkshop.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}