{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:15:46Z","timestamp":1756167346487,"version":"3.44.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/hipc.2012.6507480","type":"proceedings-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T16:41:28Z","timestamp":1367599288000},"page":"1-10","source":"Crossref","is-referenced-by-count":5,"title":["Workload dependent IO scheduling for fairness and efficiency in shared storage systems"],"prefix":"10.1109","author":[{"given":"Ajay","family":"Gulati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arif","family":"Merchant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustafa","family":"Uysal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeep","family":"Padala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Varman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/2.268888"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2003.1238060"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277871"},{"key":"23","article-title":"PARDA: Proportionate allocation of resources for distributed storage access","author":"gulati","year":"2009","journal-title":"Proc Conference on File and Storage Technology (FAST '09)"},{"key":"18","article-title":"MClock: Handling Throughput Variability for Hypervisor IO Scheduling","author":"gulati","year":"2010","journal-title":"OSDI"},{"key":"24","first-page":"131","article-title":"Facade: Virtual storage devices with performance guarantees","author":"lumb","year":"2003","journal-title":"USENIX FAST"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/MMCS.1999.778459"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1168910.1168913"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146658"},{"key":"11","first-page":"3","article-title":"Analysis and simulation of a fair queuing algorithm","volume":"1","author":"demers","year":"1990","journal-title":"Journal of Internetworking Research and Experience"},{"key":"12","article-title":"WF2Q: Worst-case fair weighted fair queueing","author":"bennett","year":"1996","journal-title":"INFOCOM"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1111609.1111612"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1357010.1352595"},{"key":"20","article-title":"The design and implementation of Aqua: An adaptive quality of service aware object-based storage device","author":"wu","year":"2006","journal-title":"MSST"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254885"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005694"},{"key":"10","first-page":"45","article-title":"Buttress: A toolkit for flexible and high fidelity I\/O benchmarking","author":"anderson","year":"2004","journal-title":"USENIX FAST"},{"key":"7","article-title":"Storage workload characterization and consolidation in virtualized environments","author":"gulati","year":"2009","journal-title":"VPACT"},{"key":"6","article-title":"Argon: Performance insulation for shared storage servers","author":"wachs","year":"2007","journal-title":"USENIX FAST"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005692"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2006.46"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502046"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1145\/217382.217453","article-title":"Efficient fair queueing using deficit round robin","author":"shreedhar","year":"1995","journal-title":"Proc of SIGCOMM '95"}],"event":{"name":"2012 19th International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2012,12,18]]},"location":"Pune, India","end":{"date-parts":[[2012,12,22]]}},"container-title":["2012 19th International Conference on High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6504607\/6507469\/06507480.pdf?arnumber=6507480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T20:19:09Z","timestamp":1756153149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6507480\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/hipc.2012.6507480","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}