{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:51Z","timestamp":1750307751273,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>\n            In this paper, we describe an extension of the Linux kernel scheduler called the Practical Fair-Share Scheduler (PFS). PFS is a fair-share process scheduler designed to support real-time workloads with\n            <jats:italic>soft<\/jats:italic>\n            (\n            <jats:italic>i.e.<\/jats:italic>\n            , elastic) timeliness requirements. Fair-share scheduling is a common choice for soft real-time systems since it is work conserving and ensures a minimum CPU allocation for each process. A novel aspect of PFS is its treatment of placement and migration in SMP or multi-core settings. Other fair-share schedulers have used ad hoc policies for handling these issues, often leading to underutilization and increased system lag. In contrast, PFS uses a strategy that maintains utilization without unfairly penalizing processes. We spend the remainder of this paper discussing placement and migration. A more extensive description of PFS, including source code, can be found at the download site listed in the citations.\n          <\/jats:p>","DOI":"10.1145\/1341312.1341328","type":"journal-article","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T15:32:16Z","timestamp":1202484736000},"page":"92-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Migration policies for multi-core fair-share scheduling"],"prefix":"10.1145","volume":"42","author":[{"given":"David","family":"Choffnes","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL"}]},{"given":"Mark","family":"Astley","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY"}]},{"given":"Michael J.","family":"Ward","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY"}]}],"member":"320","published-online":{"date-parts":[[2008,1]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"OSDI'00: Proceedings of the 4th conference on Symposium on Operating System Design &amp; Implementation","author":"Chandra A.","year":"2000","unstructured":"Chandra , A. , Adler , M. , Goyal , P. , and Shenoy , P . Surplus fair scheduling: a proportional-share cpu scheduling algorithm for symmetric multiprocessors . In OSDI'00: Proceedings of the 4th conference on Symposium on Operating System Design &amp; Implementation ( Berkeley, CA, USA , 2000 ), USENIX Association, pp. 4--4. Chandra, A., Adler, M., Goyal, P., and Shenoy, P. Surplus fair scheduling: a proportional-share cpu scheduling algorithm for symmetric multiprocessors. In OSDI'00: Proceedings of the 4th conference on Symposium on Operating System Design &amp; Implementation (Berkeley, CA, USA, 2000), USENIX Association, pp. 4--4."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.07.019"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1341312.1341328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1341312.1341328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:14Z","timestamp":1750253954000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1341312.1341328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1145\/1341312.1341328"],"URL":"https:\/\/doi.org\/10.1145\/1341312.1341328","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}