We revisit the problem of supertasking in Pfairscheduled 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.
This paper describes a statistical evaluation of the performance of the swap scheduling algorithm of an interactive computer system and an investigation into foreground-background scheduling to improve system performance. Input traffic. computer service time demands. and system performance were statistically analyzed. Based on the results of these analyses performance enhancements for the system were determined and then evaluated through use of a validated simulation model.
A methodology for performance-tuning a virtual storage system is discussed. This methodology encompasses Performance measurement, workload characterization, performance evaluation, and planned experimentation. Use of the methodology is illustrated by describing results of a case study involving the
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.