We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems by presenting a generalized "reweighting" algorithm. The generalized algorithm we present breaks new ground by permitting tasks to have non-integer execution costs, by incorporating blocking terms into the analysis, and by assuming a more flexible global-scheduling-model. To demonstrate the efficacy of the supertasking approach, we present an experimental evaluation of our algorithm that suggests that reweighting may often result in almost no schedulability loss in practice.