Summary: Implementing Pfairness on a Symmetric Multiprocessor #
Philip Holman and James H. Anderson
University of North Carolina, Chapel Hill, NC 27599­3175
Abstract
We consider the implementation of a Pfair scheduler
on a symmetric multiprocessor (SMP). Simulations pre­
sented herein suggest that bus contention resulting from
simultaneous scheduling decisions can substantially de­
grade performance. To correct this problem, we pro­
pose a staggered model for Pfair scheduling under which
scheduling points are uniformly distributed over time.
1 Introduction
Recent research on real­time multiprocessor scheduling
has shown that global scheduling provides many advan­
tages over partitioning approaches, including improved
schedulability and flexibility [1, 2, 13]. Furthermore,
these benefits can be achieved without incurring signif­
icantly more (worst­case) overhead [15]. However, there
remain questions as to whether global scheduling can
achieve comparable average­case performance.

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences