| The basic issue with real-time systems is to make sure that tasks meet their time constraints, which makes task scheduling a critical process. The selection of a schedule for a set of tasks for a real-time system depends on critical timing constraints, such as deadlines and response time.; It is known that any task system phi satisfying x3F x.w ≤ ln 2, (where x.w represents the weight of the corresponding task), can be scheduled in a "proportionate fair" (Pfair) manner by the Weight Monotonic Algorithm. This density bound has been loosely defined for the Weight Monotonic (WM) Algorithm, which is a static-priority algorithm with pfair contention.; In this thesis, we present a formal upper bound on the lowest density threshold, which fails for weight monotonic pfair schedules on a single processor. An investigation on the multiprocessor simulations of the weight monotonic algorithm was also carried out. |
