Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
A simple linear model of demand paging performance
Communications of the ACM
A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Dynamic space-sharing in computer systems
Communications of the ACM
Scheduling with Memory Allocation in Multiprocessing Systems
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
PRIME: a modular architecture for terminal-oriented systems
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
An analysis of page allocation strategies for multiprogramming systems with virtual memory
IBM Journal of Research and Development
Discrete-continuous project scheduling with discounted cash flows-A tabu search approach
Computers and Operations Research
Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
Computational Optimization and Applications
| Hi-index | 14.98 |
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.