Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach

This paper proposes a deterministic approach to the preemptive scheduling of independent tasks, which takes into account primary memory allocation in multiprocessor systems with virtual memory and a common primary memory. Each central processing unit (CPU) is assumed to have dedicated paging devices and thus paging- device competition does not exist in the system. The system workload is based on an analytic approximation to the lifetime curve of a task. Exact and approximate algorithms are presented which minimize or tend to minimize the length of schedules on an arbitrary number of identical processors. In the general case, the exact algorithm is based on nonlinear programming; however, the approximate algorithm requires the solution of several nonlinear equations with one unknown. For certain cases, analytical results have also been obtained.