Data processing system having hierarchical memories

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 900, G06F 700

Patent

active

045503672

DESCRIPTION:

BRIEF SUMMARY
BACKGROUND OF THE INVENTION

The present invention relates to a data processing system having hierarchial memories, such as buffer memories of a plurality of central processing units, a main memory which cooperates with the central processing units, an intermediate buffer memory located between the central processing units and the main memory. More particularly the present invention relates to a system in which so-called move-in and move-out operations are achieved, between the intermediate buffer memory and the main memory, under a so-called swap control method, and, further, both the intermediate buffer memory and the main memory are controlled by a so-called set associative method, and, furthermore, the main memory itself is accessed under a so-called interleave control method.
Generally, in a large capacity memory, the main memory comprises of a plurality of memory apparatuses. Each of these memory apparatuses is called a bank or memory bank. A head address for a desired one of the banks is usually specified by one or more of the upper bits of address information. For example, if there are four banks in the main memory, the head address of the desired bank can be specified by two bits (4=2.sup.2) of the address information. Thus, one of the desired banks can be selected by using the upper bits of the address information.
On the other hand, in the above mentioned data processing system, since both the intermediate buffer memory and the main memory are controlled by the set associative method, it is necessary for the address information to specify one desired data set to be accessed by one of the central processing units. Usually, the set can be specified by so-called set address bits, other than one or more of said upper bits, which are contained in the address information.
As mentioned above, the desired data set to be accessed is specified by the address information, and said move-in and move-out operations are achieved by using the address information, in order to realize a swapping of data between the intermediate buffer memory and a main memory. In this case, it should be noted that the memory bank which stores data to be read, through the move-in operation from the main memory to the intermediate buffer memory, it not always the same as the bank which stores data to be written, through the move-out operation from the intermediate buffer memory to the main memory. If the bank in which the move-in operation is conducted, is always the same as the bank in which the move-out operation has been conducted during one step for executing a certain program, the process for achieving the management of the main memory will be simplified, and the operating speed of the main memory will be increased. Howeover, in the usual data processing system having hierarchical memories, it is difficult to simplify the above mentioned process used for achieving the management of the main memory, and also, the operating speed of the main memory cannot be increased. This is because, as previously mentioned, since a requirement, during a step, for occupying or using the memory bank often coincides with a requirement, during another step, for occupying the same bank, it is necessary to introduce a particular protocol in the system, by which protocol traffic control between these conflicting steps is performed.


SUMMARY OF THE INVENTION

An object of the present invention is, therefore, to provide a data processing system having hierarchical memories in which a memory bank for conducting the move-in operation can be always the same as a memory bank for conducting the corresponding move-out operation, and accordingly, it is possible to simplify the process for achieving the management of the main memory and the operating speed of the main memory can also be increased.
According to the present invention, there is provided a data processing system having hierarchical memories, with respect to address information, address bits which are contained in the address information and used for specifying one of the desired memory banks, ar

REFERENCES:
patent: 3840863 (1974-10-01), Fuqua et al.
patent: 4056845 (1977-11-01), Churchill, Jr.
patent: 4156278 (1979-05-01), Wilhite
patent: 4228496 (1980-10-01), Katzman et al.
patent: 4356550 (1982-10-01), Katzman et al.
Computer Group News, vol. 2, No. 8, Mar. 1969, pp. 9-13, New York, US, C. J. Conti: "Concepts for Buffer Storage".
Computer Design, vol. 10, No. 1, Jan. 1971, pp. 87-93, Concord, US, R. M. Meade: "Design Approaches for Cache Memory Control".
Supplementary European Search Report, Appl. No. EP 80 90 1416, The Hague, Compl. Date 2/23/84, Examiner, Ledrut, P.
The Tandem 16: A Fault Tolerant Computing System, .COPYRGT.1977, Tandem Computers Cupertino California.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Data processing system having hierarchical memories does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data processing system having hierarchical memories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing system having hierarchical memories will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-731107

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.