scispace - formally typeset
Search or ask a question

Showing papers on "Cache coloring published in 1973"


Journal ArticleDOI
TL;DR: A cache-based computer system employs a fast, small memory interposed between the usual processor and main memory that provides a smaller ratio of memory access times, and holds the processor idle while blocks of data are being transferred from main memory to cache rather than switching to another task.
Abstract: A cache-based computer system employs a fast, small memory -the " cache" - interposed between the usual processor and main memory. At any given time the cache contains as much as possible the instructions and data the processor needs; as new information is needed it is brought from main memory to cache, displacing old information. The processor tends to operate with a memory of cache speed but with main memory cost-per-bit. This configuration has analogies with other systems employing memory hierarchies, such as "paging" or "virtual memory" systems. In contrast with these latter, a cache is managed by hardware algorithms, deals with smaller blocks of data (32 bytes, for example, rather than 4096), provides a smaller ratio of memory access times (5:1 rather than 1000: 1), and, because of the last factor, holds the processor idle while blocks of data are being transferred from main memory to cache rather than switching to another task. These are important differences, and may suffice to make the cache-based system cost effective in many situations where paging is not.

85 citations


Patent
Couleur J1, Lange R1, Pine D1
05 Nov 1973
TL;DR: In this article, the cache store is cleared by resetting tag directory indicators, a round robin counter and a column full flag, for each column in a four level set associative tag directory to the cache.
Abstract: In a multiprocessor data processing system, all processors must have access to certain communications tables stored in the main memory shared by the processors. Each processor has a cache store embedded within for its individual use. A cache store in one processor might contain data from the communication tables which is obsoleted by operations of a second processor. The cache store clearing apparatus invalidates its data information any time its processor accesses the communication tables. The cache store is cleared by resetting tag directory indicators, a round robin counter and a column full flag, for each column in a four level set associative tag directory to the cache store. The data in the cache store need not be cleared. Using the four level set associative tag directory permits the data information in the cache store to be invalidated by a 16 pulse burst of signals for 1K words of cache store directed to the tag directory indicators.

67 citations


Patent
04 Apr 1973
TL;DR: In this paper, a Content Addressable Cache Management Table (CACMT) is proposed to control the access of the main memory by one of the plural processors to obtain information which may not be present in its associated cache memory.
Abstract: A digital data multi-processing system having a main memory operating at a first rate, a plurality of individual processors, each having its own associated cache memory operating at a second rate substantially faster than the first rate for increasing the throughput of the system. In order to control the access of the main memory by one of the plural processors to obtain information which may not be present in its associated cache memory, a Content Addressable Cache Management Table (CACMT) is provided.

57 citations


Journal ArticleDOI
TL;DR: A virtual memory computer system with a fast buffer (cache) memory between primary memory and the central processing unit is considered and expressions for the distribution of a program which maximizes the useful fraction of the cost-time integral of primary and fast buffer storage are obtained.
Abstract: A virtual memory computer system with a fast buffer (cache) memory between primary memory and the central processing unit is considered. The optimal distribution of a program between the buffer and primary memory is studied using the program's lifetime function. Expressions for the distribution of a program which maximizes the useful fraction of the cost-time integral of primary and fast buffer storage are obtained for swapping and nonswapping buffer management policies.

11 citations