scispace - formally typeset
Search or ask a question

Showing papers on "Cache published in 1975"


Book
01 Jan 1975
TL;DR: It is shown that the performance of the Direct Mapping buffer under near-optimal restructuring is comparable to the performanceOf the Fully Associative buffer, this restructuring is shown to be potentially stronger than that of buffer replacement algorithms.
Abstract: Using the Independent Reference assumption to model program behavior, the performance of different buffer organizations (Fully Associative, Direct Mapping, Set Associative. and Sector) are analyzed' (1) The expressions for their fault rate are derived To show more explicitly the dependence of the fault rate on the factors that affect it, distribution-free upper bounds on fault rates are computed for the Direct Mapping, Set Associative, and Sector buffers The use of such bounds is illustrated in the case of the Direct Mapping buffer (2) The performance of the buffers for FIFO and Random Replacement are shown to be identical (3) It is possible to restructure programs to take advantage of the basic organization of the buffers The effect of such restructuring is quantified for the Direct Mapping buffer It is shown that the performance of the Direct Mapping buffer under near-optimal restructuring is comparable to the performance of the Fully Associative buffer Further, the effect of this restructuring is shown to be potentially stronger than that of buffer replacement algorithms

67 citations


Journal ArticleDOI
TL;DR: Simulation studies of cache storage in a real-time minicomputer environment show direct mapping is shown to be the most effective approach to cache management and the speedup achieved is also seen to depend on the class of program.
Abstract: The letter reports simulation studies of cache storage in a real-time minicomputer environment. Direct mapping is shown to be the most effective approach to cache management and the speedup achieved is also seen to depend on the class of program. Speedup factors of more than 5:1 can be achieved with modest-sized cache stores and relatively simple hardware.

3 citations




01 Jan 1975
TL;DR: Culberson and Smith as discussed by the authors presented a local supplement to a wider-focused report on multiple uses of irrigation canals (Kennedy and Unhanand, 1974), primarily concerned with recreational uses.
Abstract: The Functional and Aesthetic Uses of Two Cache Valley, Utah, Canals by James S. Culberson, Master of Landscape Architecture Utah State University, 1975 Major Professor: Gerald Smith Department: Landscape Architecture and Environmental Planning This report is a local supplement to a wider-focused report on multiple uses of irrigation canals (Kennedy and Unhanand, 1974), primarily concerned with recreational uses. Increasing magnitude and variety of use generated several use conflicts, and the need for a closer look at canal-oriented activities arose. The intent of the study is to show local residents and planning officials the present physical condition of local canals and canal corridors, their present multiple uses, the importance of Cache Valley irrigation canals as recreation systems, and some possible future canal use alternatives.

1 citations


Journal ArticleDOI
01 Jun 1975-Infor
TL;DR: Experimental observations indicate that page size is a parameter of fundamental importance to the performance of a storage hierarchy, and this paper examines the operation of the replacement algorithm which determines the page to be removed from main storage when an absent page is referenced.
Abstract: In this paper, two examples of memory hierarchies are examined: the cache or buffer system, and the virtual memory system. These examples are shown to differ mainly in the mapping function which determines where a given page may reside in the first level of the hierarchy. We also examine the operation of the replacement algorithm which determines the page to be removed from main storage when an absent page is referenced. The inclusion property associated with a class of replacement algorithms known as stack algorithms is described, and some examples of this class are presented.Some experimental observations on the effects of page size are presented, which indicate that page size is a parameter of fundamental importance to the performance of a storage hierarchy. The class of singly determined stack algorithms is then defined, and is shown to include both the popular Least Recently Used (LRU) replacement algorithm, and an optimal algorithm. Singly determined stack algorithms are then shown to have c...