{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:38Z","timestamp":1750220018983,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2022,3,22]]},"abstract":"<jats:p>Parallelizable workloads are ubiquitous and appear across a diverse array of modern computer systems. Data centers, supercomputers, machine learning clusters, distributed computing frameworks, and databases all process jobs designed to be parallelized across many servers or cores. Unlike the jobs in more classical models, such as the M\/G\/k queue, that each run on a single server, parallelizable jobs are capable of running on multiple servers simultaneously. When a job is parallelized across additional servers or cores, the job receives a speedup and can be completed more quickly.<\/jats:p>","DOI":"10.1145\/3529113.3529136","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T22:30:42Z","timestamp":1648247442000},"page":"65-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The Case for Phase-Aware Scheduling of Parallelizable Jobs"],"prefix":"10.1145","volume":"49","author":[{"given":"Benjamin","family":"Berg","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Whitehouse","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weina","family":"Wang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Harchol-Balter","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"NoisePage - The Self-Driving Database Management System. https:\/\/noise.page.  NoisePage - The Self-Driving Database Management System. https:\/\/noise.page."},{"key":"e_1_2_1_2_1","volume-title":"Towards optimality in parallel scheduling. ACM POMACS, 1(2)","author":"Berg B.","year":"2018","unstructured":"B. Berg , J.P. Dorsman , and M. Harchol-Balter . Towards optimality in parallel scheduling. ACM POMACS, 1(2) , 2018 . B. Berg, J.P. Dorsman, and M. Harchol-Balter. Towards optimality in parallel scheduling. ACM POMACS, 1(2), 2018."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400265"},{"key":"e_1_2_1_4_1","first-page":"237","volume-title":"The Star Schema Benchmark and Augmented Fact Table Indexing","author":"O'Neil Patrick","year":"2009","unstructured":"Patrick O'Neil , Elizabeth O'Neil , Xuedong Chen , and Stephen Revilak . The Star Schema Benchmark and Augmented Fact Table Indexing , pages 237 -- 252 . 2009 . Patrick O'Neil, Elizabeth O'Neil, Xuedong Chen, and Stephen Revilak. The Star Schema Benchmark and Augmented Fact Table Indexing, pages 237--252. 2009."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529113.3529136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:25Z","timestamp":1750182685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3,22]]}},"alternative-id":["10.1145\/3529113.3529136"],"URL":"https:\/\/doi.org\/10.1145\/3529113.3529136","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"2022-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}