{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:23Z","timestamp":1750306343522,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"10","license":[{"start":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T00:00:00Z","timestamp":1474502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2016,9,22]]},"abstract":"<jats:p>Taking advantage of idleness to reduce dropped frames and memory consumption.<\/jats:p>","DOI":"10.1145\/2948991","type":"journal-article","created":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T17:55:52Z","timestamp":1474566952000},"page":"34-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Idle-time garbage-collection scheduling"],"prefix":"10.1145","volume":"59","author":[{"given":"Ulan","family":"Degenbaev","sequence":"first","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Eisinger","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Ernst","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross","family":"Mcilroy","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Payer","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908106"},{"volume-title":"H. PLDI'16 Artifact: Idle time garbage collection scheduling","year":"2016","author":"Degenbaev U.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","unstructured":"Google Inc. The RAIL performance model; http:\/\/developers.google.com\/Web\/tools\/chrome-devtools\/profile\/evaluate-perforrnance\/rail.  Google Inc. The RAIL performance model; http:\/\/developers.google.com\/Web\/tools\/chrome-devtools\/profile\/evaluate-perforrnance\/rail."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2003690.2003692"},{"key":"e_1_2_1_5_1","unstructured":"McIlroy. R. Cooperative scheduling of background tasks. W3C editor's draft (2016); https:\/\/w3c.github.io\/requestidlecallback\/.  McIlroy. R. Cooperative scheduling of background tasks. W3C editor's draft (2016); https:\/\/w3c.github.io\/requestidlecallback\/."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800020.808261"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2948991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2948991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:46Z","timestamp":1750222546000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2948991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,22]]},"references-count":6,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016,9,22]]}},"alternative-id":["10.1145\/2948991"],"URL":"https:\/\/doi.org\/10.1145\/2948991","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2016,9,22]]},"assertion":[{"value":"2016-09-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}