Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
Considerations in the design of a multiple computer system with extended core storage
Communications of the ACM
Microprogamming under a page on demand strategy
Communications of the ACM
Optimal Preemptive Scheduling on Two-Processor Systems
IEEE Transactions on Computers
Optimal Scheduling Strategies in a Multiprocessor System
IEEE Transactions on Computers
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Cache system design in the tightly coupled multiprocessor system
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
| Hi-index | 14.98 |
This paper presents quadratic programming models of memory conflict in multiprocessor systems where main memory consists of a set of memory modules common to all processors. Two jobs (programs) are said to be in conflict, or subject to memory conflict, whenever at a given time portions of them must be executed in the same memory module by different processors. We are interested in minimizing the total conflict by the proper assignment of jobs to main memory. Two allocation models are considered: one in which the jobs-to-memory assignment is to be made independent of any particular processors-to-jobs schedule, that is, expected memory conflict is to be minimized over the space of all schedules; and the second in which a definite processor schedule is assumed to be available. For both models, algorithms are formulated for the assignment of jobs to memory.