{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:16Z","timestamp":1750306096489,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,9,24]],"date-time":"2017-09-24T00:00:00Z","timestamp":1506211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1401258"],"award-info":[{"award-number":["U1401258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Basic Research Program of China (973 Program)","award":["2015CB352400"],"award-info":[{"award-number":["2015CB352400"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,9,24]]},"DOI":"10.1145\/3127479.3132689","type":"proceedings-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:34:00Z","timestamp":1506515640000},"page":"655-655","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Prometheus"],"prefix":"10.1145","author":[{"given":"Guoyao","family":"Xu","sequence":"first","affiliation":[{"name":"Wayne State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Zhong","family":"Xu","sequence":"additional","affiliation":[{"name":"Wayne State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USENIX ATC '17","author":"Iorgulescu Calin","year":"2017","unstructured":"Calin Iorgulescu , Florin Dinu , Aunn Raza , Wajih Ul Hassan , and Willy Zwaenepoel . 2017 . Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling . In USENIX ATC '17 . Calin Iorgulescu, Florin Dinu, Aunn Raza, Wajih Ul Hassan, and Willy Zwaenepoel. 2017. Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling. In USENIX ATC '17."},{"key":"e_1_3_2_1_2_1","volume-title":"Ernest: Efficient Performance Prediction for Large-Scale Advanced Analytics. In NSDI '16","author":"Venkataraman Shivaram","year":"2016","unstructured":"Shivaram Venkataraman , Zongheng Yang , Michael Franklin , Benjamin Recht , and Ion Stoica . 2016 . Ernest: Efficient Performance Prediction for Large-Scale Advanced Analytics. In NSDI '16 . Shivaram Venkataraman, Zongheng Yang, Michael Franklin, Benjamin Recht, and Ion Stoica. 2016. Ernest: Efficient Performance Prediction for Large-Scale Advanced Analytics. In NSDI '16."},{"key":"e_1_3_2_1_3_1","volume-title":"Prophet: Scheduling Executors with Time-varying Resource Demands on Data-Parallel Computation Frameworks. In ICAC '16","author":"Xu Guoyao","year":"2016","unstructured":"Guoyao Xu , Cheng-Zhong Xu , and Song Jiang . 2016 . Prophet: Scheduling Executors with Time-varying Resource Demands on Data-Parallel Computation Frameworks. In ICAC '16 . Guoyao Xu, Cheng-Zhong Xu, and Song Jiang. 2016. Prophet: Scheduling Executors with Time-varying Resource Demands on Data-Parallel Computation Frameworks. In ICAC '16."}],"event":{"name":"SoCC '17: ACM Symposium on Cloud Computing","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Santa Clara California","acronym":"SoCC '17"},"container-title":["Proceedings of the 2017 Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3127479.3132689","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3127479.3132689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:29Z","timestamp":1750217429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3127479.3132689"}},"subtitle":["online estimation of optimal memory demands for workers in in-memory distributed computation"],"short-title":[],"issued":{"date-parts":[[2017,9,24]]},"references-count":3,"alternative-id":["10.1145\/3127479.3132689","10.1145\/3127479"],"URL":"https:\/\/doi.org\/10.1145\/3127479.3132689","relation":{},"subject":[],"published":{"date-parts":[[2017,9,24]]},"assertion":[{"value":"2017-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}