Dual-L2 processor subsystem architecture for networking system

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S119000, C711S123000, C711S130000, C711S153000, C711S173000

Reexamination Certificate

active

06751704

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention relates generally to computer architectures and, more particularly, to a memory management scheme and architecture for allowing faster access to data and instructions.
2. Description of the Related Art
As computer and networking applications become Input/Output (I/O) intensive, the conventional computer architecture is becoming a limiting factor in obtaining higher processing speeds. Conventional computer architectures typically utilize a processor and memory architecture that creates a bottleneck in accessing data as memory accesses are slow and multiple devices and applications compete for memory access.
Conventional computer architectures generally utilize a cache comprising smaller, high-speed memory in addition to larger, slower main memory, such as Dynamic Random Access Memory (DRAM), in an attempt to increase memory access speeds. The cache typically stores a subset of shared data stored in main memory, which is generally paged in and out of the cache.
Cache is typically configured in multiple levels. Level 1 (L1) cache is usually designed into the processor chip and is commonly referred to as internal cache. Level 2 (L2) cache is the external memory closest to the processor chip. Additional levels are possible, but with each additional level, the access speed typically decreases.
In a microprocessor-based design, when the processor performs a read instruction, the processor first attempts to read the requested data from the cache. If the requested data is found in the cache, the slower main memory is not accessed. If the requested data is not contained in the cache, however, older data is paged out of the cache and the requested data is paged into the cache. The paging of data out of cache frequently requires additional memory delays and memory accesses because the data is frequently shared by other applications and/or devices, and the data must be re-read from the shared memory into the cache, resulting in slower memory access speeds.
The above description is particularly troublesome in networking environments involving the movement of packet data within a networking system. The movement of shared data can be broken down into 3 basic steps: (a) exchange of buffer information or Direct Memory Access (DMA) descriptors, (b) transfer of packet data to and from main memory, and (c) process of packet header by the processor. Steps (a) and (b) involve networking interface devices accessing shared data. Steps (a) and (c) involve the processor accessing the same blocks of shared data. Therefore, shared data are generally accessed by both the networking interface devices and the processor.
Conventional architectures utilizing an L2 cache, however, are designed to provide only the processor with access to the L2 cache. As a result, packet traffic cannot benefit from fast memory such as the L2 cache. Instead, packet buffers are transferred between the cache and the main memory store as they are accessed by the processor and the networking interface devices. In a conventional design, these actions will cause the shuffling of shared data back and forth between the L1/L2 caches and the main memory store.
Prior attempts to fix the limitations of the conventional computer architecture discussed above are not optimal for I/O intensive network router applications. Attempts utilizing DRAM technology are inefficient due to the limited memory bandwidth of the DRAM. Other attempts, such as employing a distributed routing scheme and/or specialized hardware with Static Random Access Memory (SRAM), are generally expensive and involve a redesign of the system.
Therefore, there is a need for a caching scheme to further extend the life of generic computing architecture in networking products to allow an efficient and cost-effective memory scheme.
SUMMARY OF THE INVENTION
The present invention comprises a method for providing an efficient and cost-effective memory caching scheme. This is achieved by configuring a computer memory architecture to utilize dual-L2 caches, preferably configured as an L2 Program Cache and an L2 Packet Cache. By use of this invention, memory access speeds may be increased as paging shared data is decreased and networking interface devices are given access to fast caches.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of a preferred embodiment of the invention, as illustrated in the accompanying drawing wherein like reference numbers represent like parts of the invention.


REFERENCES:
patent: 5535359 (1996-07-01), Hata et al.
patent: 5680571 (1997-10-01), Bauman
patent: 5704058 (1997-12-01), Derrick et al.
patent: 5848241 (1998-12-01), Misinai et al.
patent: 6000013 (1999-12-01), Lau et al.
patent: 6119202 (2000-09-01), Borkenhagen et al.
patent: 6292490 (2001-09-01), Gratacap et al.
patent: 6334175 (2001-12-01), Chih
patent: 6425090 (2002-07-01), Arimilli et al.
patent: 6549984 (2003-04-01), Patterson et al.

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

Dual-L2 processor subsystem architecture for networking system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dual-L2 processor subsystem architecture for networking system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dual-L2 processor subsystem architecture for networking system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3313499

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