{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:13:43Z","timestamp":1746159223313,"version":"3.40.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Embedded Computing"],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p> We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task's processor share is specified as a weight. When a task is reweighted, a new weight is computed for it, which is then used in future scheduling. Task reweighting can be used as a means for consuming (or making available) spare processing capacity. The responsiveness of a reweighting scheme can be assessed by comparing its allocations to those of an ideal scheduler that can reweight tasks instantaneously. A reweighting scheme is fine-grained if any additional per-task \u201cerror\u201d (in comparison to an ideal allocation) caused by a reweighting event is constant. In prior work on uniprocessor\\\/ notions of fairness, a number of fine-grained reweighting schemes were proposed. However, in the multiprocessor case, prior work has failed to produce such a scheme. In this paper, we remedy this shortcoming by presenting a multiprocessor reweighting scheme that is fine-grained. We also present an experimental evaluation of this scheme that shows that it is often much more responsive than prior (non-fine-grained) schemes in enacting weight-change requests. <\/jats:p>","DOI":"10.3233\/jec-2009-0109","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T12:26:12Z","timestamp":1737721572000},"page":"71-86","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fine-grained task reweighting on multiprocessors"],"prefix":"10.1177","volume":"4","author":[{"given":"Aaron","family":"Block","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of North Carolina at Chapel Hill, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of North Carolina at Chapel Hill, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Bishop","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of North Carolina at Chapel Hill, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,5,1]]},"container-title":["Journal of Embedded Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JEC-2009-0109","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JEC-2009-0109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T17:36:36Z","timestamp":1746120996000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JEC-2009-0109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.3233\/JEC-2009-0109"],"URL":"https:\/\/doi.org\/10.3233\/jec-2009-0109","relation":{},"ISSN":["1740-4460","1875-9025"],"issn-type":[{"type":"print","value":"1740-4460"},{"type":"electronic","value":"1875-9025"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}