Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
An Algorithm to Design the Memory Configuration of a Computer Network
Journal of the ACM (JACM)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Operating Systems Theory
Measurements of sharing in Multics
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Bounds on scheduling with limited resources
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Scheduling tasks with critical sections
ACM '77 Proceedings of the 1977 annual conference
| Hi-index | 0.01 |
One aspect of network design is the extent to which memory is shared among the processing elements. In this paper a model with limited sharing (only two processors connected to each memory) is analyzed and its performance compared with the performance of two other models that have appeared in the literature. One of these is a model of multiple processors sharing a single memory; the other model considers a multiprocessor configuration in which each processor has its own dedicated memory. The tasks processed by these networks are described by both time and memory requirements. The largest-memory-first (LMF) scheduling algorithm is employed and its performance with respect to an enumerative optimal scheduling algorithm is bounded. On the basis of this measure we conclude that memory sharing is only desirable on very small networks and is disadvantageous on networks of larger size.