|Title:||THE COMPETITIVENESS OF ON-LINE DEMAND PAGING ALGORITHMS FOR GENERALIZED TWO LEVEL MEMORIES (Preliminary Version)
|Authors:||G. Matz1iach and O. Shmue1i
|Abstract:||We investigate the performance of on-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memories, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical interest. We especially investigate LRU and FIFO, which are both known as good demand paging algorithms for "ordinary" two level memories (ST], and which are widely used. We extend the results to the case in which the on-line algorithms are allowed to use additional primary memory frames.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0619), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion