{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T17:07:59Z","timestamp":1792861679351,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146396","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"72-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Grouped distributed queues"],"prefix":"10.1145","author":[{"given":"Bogdan","family":"Caprita","sequence":"first","affiliation":[{"name":"Google, Inc., New York, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jason","family":"Nieh","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"120","volume-title":"Proceedings of IEEE INFOCOM '96","author":"Jon C.","year":"1996","unstructured":"Jon C. R. Bennett and Hui Zhang. WF2Q: Worst-Case Fair Weighted Fair Queueing . In Proceedings of IEEE INFOCOM '96 , pages 120 -- 128 , San Francisco, CA , Mar. 1996 . Jon C. R. Bennett and Hui Zhang. WF2Q: Worst-Case Fair Weighted Fair Queueing. In Proceedings of IEEE INFOCOM '96, pages 120--128, San Francisco, CA, Mar. 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383074"},{"key":"e_1_3_2_1_3_1","first-page":"337","volume-title":"Proceedings of the 2005 USENIX Annual Technical Conference","author":"Caprita Bogdan","year":"2005","unstructured":"Bogdan Caprita , Wong Chun Chan , Jason Nieh , Clifford Stein , and Haoqiang Zheng . Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems . In Proceedings of the 2005 USENIX Annual Technical Conference , pages 337 -- 352 , Anaheim, CA , April 2005 . USENIX. Bogdan Caprita, Wong Chun Chan, Jason Nieh, Clifford Stein, and Haoqiang Zheng. Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. In Proceedings of the 2005 USENIX Annual Technical Conference, pages 337--352, Anaheim, CA, April 2005. USENIX."},{"key":"e_1_3_2_1_4_1","first-page":"45","volume-title":"Proceedings of the 4th Symposium on Operating System Design & Implementation","author":"Chandra Abhishek","year":"2000","unstructured":"Abhishek Chandra , Micah Adler , Pawan Goyal , and Prashant J. Shenoy . Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors . In Proceedings of the 4th Symposium on Operating System Design & Implementation , pages 45 -- 58 , San Diego, CA , Oct. 2000 . Abhishek Chandra, Micah Adler, Pawan Goyal, and Prashant J. Shenoy. Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors. In Proceedings of the 4th Symposium on Operating System Design & Implementation, pages 45--58, San Diego, CA, Oct. 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/882481.883792"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"e_1_3_2_1_10_1","series-title":"Queueing Systems","volume-title":"Computer Applications","author":"Kleinrock L.","year":"1976","unstructured":"L. Kleinrock . Computer Applications , volume II of Queueing Systems . John Wiley & Sons , New York, NY , 1976 . L. Kleinrock. Computer Applications, volume II of Queueing Systems. John Wiley & Sons, New York, NY, 1976."},{"key":"e_1_3_2_1_11_1","volume-title":"Linux Kernel Development. SAMS","author":"Love Robert","year":"2004","unstructured":"Robert Love . Linux Kernel Development. SAMS , Developmer Library Series , first edition, 2004 . Robert Love. Linux Kernel Development. SAMS, Developmer Library Series, first edition, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_3_2_1_13_1","volume-title":"Fair scheduling of dynamic task systems on multiprocessors","author":"Srinivasan A.","year":"2003","unstructured":"A. Srinivasan and J. Anderson . Fair scheduling of dynamic task systems on multiprocessors , 2003 . A. Srinivasan and J. Anderson. Fair scheduling of dynamic task systems on multiprocessors, 2003."},{"key":"e_1_3_2_1_14_1","volume-title":"Network Processor Design: Issues and Practices","author":"Srinivasan A.","year":"2004","unstructured":"A. Srinivasan , P. Holman , J. Anderson , S. Baruah , and J. Kaur . Network Processor Design: Issues and Practices Volume II , chapter Multiprocessor Scheduling in Processor-based Router Platforms: Issues and Ideas. Morgan Kaufamann Publishers , 2004 . A. Srinivasan, P. Holman, J. Anderson, S. Baruah, and J. Kaur. Network Processor Design: Issues and Practices Volume II, chapter Multiprocessor Scheduling in Processor-based Router Platforms: Issues and Ideas. Morgan Kaufamann Publishers, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1014"},{"key":"e_1_3_2_1_16_1","volume-title":"UNIX Internals: The New Frontiers","author":"Vahalia Uresh","year":"1996","unstructured":"Uresh Vahalia . UNIX Internals: The New Frontiers . Prentice Hall , Upper Saddle River, NJ, 1996 . Uresh Vahalia. UNIX Internals: The New Frontiers. Prentice Hall, Upper Saddle River, NJ, 1996."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2001.990693"}],"event":{"name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","location":"Denver Colorado USA","acronym":"PODC06","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T23:59:22Z","timestamp":1673481562000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146396"}},"subtitle":["distributed queue, proportional share multiprocessor scheduling"],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":17,"alternative-id":["10.1145\/1146381.1146396","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146396","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}