On the Memory Conflict Problem in Multiprocessor Systems
- 1 March 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (3) , 286-293
- https://doi.org/10.1109/t-c.1974.223924
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Optimal Scheduling Strategies in a Multiprocessor SystemIEEE Transactions on Computers, 1972
- Optimal Preemptive Scheduling on Two-Processor SystemsIEEE Transactions on Computers, 1969
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Considerations in the design of a multiple computer system with extended core storageCommunications of the ACM, 1968
- Microprogamming under a page on demand strategyCommunications of the ACM, 1967
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966