This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1981 (vol. 7 no. 1)
pp. 135-146
A.J. Smith, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California
It has been suggested that the algorithm used to schedule those processes active and in main memory can have an effect on memory contention. We create models for memory contention in a system that uses global LRU replacement and either round robin or priority internal scheduling. Parameters to our model include the ratio of secondary storage to primary storage access times, thus allowing consideration of a variety of storage technologies. The round robin quantum size is included and is shown to have some effect. Our model uses LRU miss ratio curves and thus reflects actual program characteristics. Trace driven simulations are used to verify the accuracy of the models. We find that in most cases internal scheduling has only a small effect on page fault rates and CPU utilization. In certain cases, however priority scheduling is found to besignificant in relieving thrashing.
Index Terms:
virtual memory, LRU, memory contention, paging, priority scheduling, program behavior, round robin scheduling, scheduling, storage technology, thrashing
Citation:
A.J. Smith, "Internal Scheduling and Memory Contention," IEEE Transactions on Software Engineering, vol. 7, no. 1, pp. 135-146, Jan. 1981, doi:10.1109/TSE.1981.230820
Usage of this product signifies your acceptance of the Terms of Use.