Memory access technique

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1300

Patent

active

040568458

ABSTRACT:
A memory access technique for use in digital data processing apparatus, particularly in mini-computer systems, in which a plurality of memory modules are used, each of the modules having a main memory and a higher speed auxiliary, or "cache" memory, the data in the "cache" memories of a plurality of modules being capable of storage therein in an interleaved manner. Appropriate modifiable interconnection means, such as modifiable jumper connections, are provided on each memory module to permit the modules to be arranged for either interleaved or non-interleaved operation. As additional modules are added to the system, additional "cache" memory storage is automatically added and the capability of higher order interleaving becomes readily possible.

REFERENCES:
patent: 3445820 (1969-05-01), Wissick
patent: 3588829 (1971-06-01), Boland et al.
patent: 3588839 (1971-06-01), Belady et al.
patent: 3693165 (1972-09-01), Reiley et al.
patent: 3699530 (1972-10-01), Capowski et al.
patent: 3764996 (1973-10-01), Ross
patent: 3810110 (1974-05-01), Kotok et al.
patent: 3820078 (1974-06-01), Curley et al.
patent: 3829840 (1974-08-01), Burk et al.
patent: 3840862 (1974-10-01), Ready
patent: 3866183 (1975-02-01), Lange
Christensen et al. - Overrun Protection for Buffer Stacks; IBM Tech. Discl. Bulletin, vol. 15, No. 12, May 1973, pp. 3857-3858.

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

Memory access technique does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory access technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory access technique will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-10533

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