JPS58177584A - Control system for associative buffer memory - Google Patents

Abstract

PURPOSE:To shorten the time of data access and to improve a processing speed by storing data having high stack access frequencies in an associative buffer memory and storing data having low stack access frequencies in a stack. CONSTITUTION:In a figure, 5 is a detection part and 6 is a control part. The detection part 5 detects and outputs data having a minimum stack access frequency stored in an access frequency memory part 4 among data corresponding to associated addresses generated by a write address generation part 3 among data stored in a data memory part 2. Under the control of the control part 6, the stack access frequency of data obtained by accessing the stack newly is compared with the frequency of the data detected by the detection part 5 and when the frequency detected by the detection part 5 is less, the data and its access frequency are erased from the memory part 2 and access frequency memory part 4 to write the newly accessed data and its frequency therein respectively.

Description

[Detailed description of the invention] (4) Departure from the field of aO technology This invention relates to a control method that increases the speed of information processing and performs nine-association pacifame. A method for identifying the memory data SO contents (e number) is installed as a pacifame % at the stack and anchor ring device O, and research is being conducted on various ways to use it, such as using it to improve the shielding degree of the island. It is.

C) Prior art and advantages In a system in which an associative buffer memory is provided between the stack and the processing device, writing data to the associative buffer memory is conventionally performed using LR[T(least
tly us@d ) method was used.

The LRU method is a method in which the processing unit writes the data obtained by accessing the stack, giving priority to the newest data over the oldest data, but it improves processing speed in memory that is accessed sequentially like the stack. However, the effect of the associative buffer T memory is not fully demonstrated. Another object of the present invention is to provide an associative buffer memory control method that can improve processing speed.

(g) #I# of the invention: The associative backup memory control method of the present invention is applicable to a device that processes information using a group I obtained by sequentially accessing and searching a list of data. Search Kl! The system is provided with an associative buffer 7 memory in which an entry is configured according to the number of accesses of the stack, and the processing speed is improved by controlling writing of data to the associative buffer memory according to the number of accesses.

Sub-Invention O Examples Next, the gist of the present invention will be specifically explained using examples shown in the drawings.

The figure shows an embodiment of the present invention, l is a read address generation unit that generates an associative address corresponding to the content of read data;
2 is a data storage section that stores data corresponding to input of an associative address; 3 is a write address generation section that generates an associative address corresponding to the contents of data newly obtained by accessing the stack; 4 is a data memory section Reference numeral 2 refers to an access number memory section that stores the number of stack accesses required for retrieving data to be stored in correspondence with the data; 5 refers to an access number memory section 4 for the write aterator among the data stored in the data memory section 2; Stored stack 7213
A detection unit 6 detects the data with the minimum number of times and outputs it together with the number of stack accesses, and a detection unit 6 detects the number of stack accesses of data obtained by newly accessing the stack and the number of stack accesses of the data detected by the detection unit 5. By comparison, if the number of stack accesses of the data detected by the detection unit 5 is small, the data and the number of stack accesses thereof are respectively erased from the memory s2 and the access circuit memory s4, and the stack is newly accessed. The control unit controls the writing of the obtained data and the number of accesses to the stack.

As described above, a continuous buffer memory is obtained in which an entry is formed by data and the number of stack accesses required to retrieve the data, and it is possible to always retrieve data that is accessed more often than the stack.0 IG) Invention As described in detail, according to the present invention, it is possible to store data that has been accessed many times on the stack in the associative buffer memory, and to store data on the stack that has been accessed less often on the i stack. The overall time required for access can be shortened, and processing speed can be improved.

[Brief explanation of drawings]

The figure shows an embodiment of the present invention, in which 2 is a data memory section, 4 is a data memory section;
are the access count memory section and the 6ri control section.

Claims (1)

[Claims] In a device that performs information l&ring using data I obtained by accessing and searching a stacked stratification, a sequence that constitutes an entry by the data and the number of stacks accessed iI obtained by searching the data I is used. Equipped with a layer of buffer candy,
The associative buffer memory control method is characterized in that O-day/IO writing to the F77 memory is controlled by the number of accesses.